{"list":"other","total":53,"rows":[{"id":"1412.6980","title":"Adam: A Method for Stochastic Optimization","created":"2014-12-22","cited_by_count":37240},{"id":"1609.02907","title":"Semi-Supervised Classification with Graph Convolutional Networks","created":"2016-09-09","cited_by_count":11361},{"id":"1710.10903","title":"Graph Attention Networks","created":"2017-10-30","cited_by_count":8923},{"id":"1706.02216","title":"Inductive Representation Learning on Large Graphs","created":"2017-06-07","cited_by_count":6320},{"id":"1810.00826","title":"How Powerful are Graph Neural Networks?","created":"2018-10-01","cited_by_count":4393},{"id":"1704.01212","title":"Neural Message Passing for Quantum Chemistry","created":"2017-04-04","cited_by_count":3487},{"id":"1606.09375","title":"Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering","created":"2016-06-30","cited_by_count":2089},{"id":"1902.07153","title":"Simplifying Graph Convolutional Networks","created":"2019-02-19","cited_by_count":1477},{"id":"1810.05997","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","created":"2018-10-14","cited_by_count":993},{"id":"1806.03536","title":"Representation Learning on Graphs with Jumping Knowledge Networks","created":"2018-06-09","cited_by_count":877},{"id":"2007.02133","title":"Simple and Deep Graph Convolutional Networks","created":"2020-07-04","cited_by_count":860},{"id":"2105.14491","title":"How Attentive are Graph Attention Networks?","created":"2021-05-30","cited_by_count":835},{"id":"2002.05287","title":"Geom-GCN: Geometric Graph Convolutional Networks","created":"2020-02-13","cited_by_count":826},{"id":"2006.05205","title":"On the Bottleneck of Graph Neural Networks and its Practical Implications","created":"2020-06-09","cited_by_count":631},{"id":"2006.07988","title":"Adaptive Universal Generalized PageRank Graph Neural Network","created":"2020-06-14","cited_by_count":595},{"id":"1909.13021","title":"Multi-scale Attributed Node Embedding","created":"2019-09-28","cited_by_count":548},{"id":"2111.14522","title":"Understanding over-squashing and bottlenecks on graphs via curvature","created":"2021-11-29","cited_by_count":478},{"id":"2101.00797","title":"Beyond Low-frequency Information in Graph Convolutional Networks","created":"2021-01-04","cited_by_count":362},{"id":"2302.11640","title":"A critical look at the evaluation of GNNs under heterophily: Are we really making progress?","created":"2023-02-22","cited_by_count":343},{"id":"2110.14446","title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","created":"2021-10-27","cited_by_count":311},{"id":"2007.09296","title":"Towards Deeper Graph Neural Networks","created":"2020-07-18","cited_by_count":296},{"id":"2205.07308","title":"Finding Global Homophily in Graph Neural Networks When Meeting Heterophily","created":"2022-05-15","cited_by_count":179},{"id":"2202.07082","title":"Graph Neural Networks for Graphs with Heterophily: A Survey","created":"2022-02-14","cited_by_count":175},{"id":"2302.02941","title":"On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topology","created":"2023-02-06","cited_by_count":166},{"id":"2306.10759","title":"SGFormer: Simplifying and Empowering Transformers for Large-Graph Representations","created":"2023-06-19","cited_by_count":133},{"id":"1710.10370","title":"Topology Adaptive Graph Convolutional Networks","created":"2017-10-28","cited_by_count":113},{"id":"2302.06835","title":"Understanding Oversquashing in GNNs through the Lens of Effective Resistance","created":"2023-02-14","cited_by_count":97},{"id":"2301.09474","title":"DIFFormer: Scalable (Graph) Transformers Induced by Energy Constrained Diffusion","created":"2023-01-23","cited_by_count":87},{"id":"2109.05641","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","created":"2021-09-12","cited_by_count":82},{"id":"2405.11416","title":"Discrete-state Continuous-time Diffusion for Graph Generation","created":"2024-05-19","cited_by_count":76},{"id":"2210.02997","title":"Expander Graph Propagation","created":"2022-10-06","cited_by_count":75},{"id":"2302.01524","title":"Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing","created":"2023-02-03","cited_by_count":67},{"id":"2209.06177","title":"Characterizing Graph Datasets for Node Classification: Homophily-Heterophily Dichotomy and Beyond","created":"2022-09-13","cited_by_count":60},{"id":"2310.01668","title":"Locality-Aware Graph-Rewiring in GNNs","created":"2023-10-02","cited_by_count":56},{"id":"2406.06647","title":"How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark","created":"2024-06-10","cited_by_count":43},{"id":"2305.18612","title":"Networked Time Series Imputation via Position-aware Graph Enhanced Variational Autoencoders","created":"2023-05-29","cited_by_count":32},{"id":"2308.14181","title":"Class-Imbalanced Graph Learning without Class Rebalancing","created":"2023-08-27","cited_by_count":29},{"id":"2308.15651","title":"Ensuring User-side Fairness in Dynamic Recommender Systems","created":"2023-08-29","cited_by_count":27},{"id":"2310.02156","title":"Probabilistically Rewired Message-Passing Neural Networks","created":"2023-10-03","cited_by_count":26},{"id":"2311.07073","title":"Exposition on over-squashing problem on GNNs: Current Methods, Benchmarks and Challenges","created":"2023-11-13","cited_by_count":22},{"id":"2404.04264","title":"Logic Query of Thoughts: Guiding Large Language Models to Answer Complex Logic Queries with Knowledge Graphs","created":"2024-03-17","cited_by_count":20},{"id":"2306.00488","title":"Reconstructing Graph Diffusion History from a Single Snapshot","created":"2023-06-01","cited_by_count":13},{"id":"2307.09768","title":"How Curvature Enhance the Adaptation Power of Framelet GCNs","created":"2023-07-19","cited_by_count":13},{"id":"2405.16805","title":"Gradient Compressed Sensing: A Query-Efficient Gradient Estimator for High-Dimensional Zeroth-Order Optimization","created":"2024-05-27","cited_by_count":12},{"id":"2410.06467","title":"WAPITI: A Watermark for Finetuned Open-Source LLMs","created":"2024-10-09","cited_by_count":12},{"id":"2501.06647","title":"TUCKET: A Tensor Time Series Data Structure for Efficient and Accurate Factor Analysis over Time Ranges","created":"2025-01-11","cited_by_count":12},{"id":"2409.10951","title":"Fair Anomaly Detection For Imbalanced Groups","created":"2024-09-17","cited_by_count":10},{"id":"2411.01992","title":"Ask, and it shall be given: On the Turing completeness of prompting","created":"2024-11-04","cited_by_count":10},{"id":"2505.14728","title":"MORALISE: A Structured Benchmark for Moral Alignment in Visual Language Models","created":"2025-05-20","cited_by_count":10},{"id":"2406.08819","title":"AIM: Attributing, Interpreting, Mitigating Data Unfairness","created":"2024-06-13","cited_by_count":9},{"id":"2507.21494","title":"Latte: Collaborative Test-Time Adaptation of Vision-Language Models in Federated Learning","created":"2025-07-29","cited_by_count":9},{"id":"2505.17293","title":"Graph Data Selection for Domain Adaptation: A Model-Free Approach","created":"2025-05-22","cited_by_count":7},{"id":"2412.09805","title":"Making Classic GNNs Strong Baselines Across Varying Homophily: A Smoothness-Generalization Perspective","created":"2024-12-13","cited_by_count":2}],"next_cursor":null}