Can You Hear Me Now? A Benchmark for Long-Range Graph Propagation
Not on the map. Why?
Abstract (arXiv)
Effectively capturing long-range interactions remains a fundamental yet unresolved challenge in graph neural network (GNN) research, critical for applications across diverse fields of science. To systematically address this, we introduce ECHO (Evaluating Communication over long HOps), a novel benchmark specifically designed to rigorously assess the capabilities of GNNs in handling very long-range graph propagation. ECHO includes three synthetic graph tasks, namely single-source shortest paths, node eccentricity, and graph diameter, each constructed over diverse and structurally challenging topologies intentionally designed to introduce significant information bottlenecks. ECHO also includes two real-world datasets, ECHO-Charge and ECHO-Energy, which define chemically grounded benchmarks for predicting atomic partial charges and molecular total energies, respectively, with reference computations obtained at the density functional theory (DFT) level. Both tasks inherently depend on capturing complex long-range molecular interactions. Our extensive benchmarking of popular GNN architectures reveals clear performance gaps, emphasizing the difficulty of true long-range propagation and highlighting design choices capable of overcoming inherent limitations. ECHO thereby sets a new standard for evaluating long-range information propagation, also providing a compelling example for its need in AI for science.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 52 of its 95 references that are in the map. First posted on arXiv 19 Dec 2025.
Builds on
52 of 95 references.
References · 52
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,089
- 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,102
- 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,051
- 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
- 2019Strategies for Pre-training Graph Neural Networkscited by 971
- 2020Simple and Deep Graph Convolutional Networkscited by 860
- 2015Convolutional Networks on Graphs for Learning Molecular Fingerprintscited by 754
38 more
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
- 2020Benchmarking Graph Neural Networkscited by 680
- 2020On the Bottleneck of Graph Neural Networks and its Practical Implicationscited by 631
- 2020Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classificationcited by 506
- 2020Principal Neighbourhood Aggregation for Graph Netscited by 478
- 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 478
- 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 443
- 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 335
- 2020Improving Graph Neural Network Expressivity via Subgraph Isomorphism Countingcited by 313
- 2022Long Range Graph Benchmarkcited by 263
- 2020A Note on Over-Smoothing for Graph Neural Networkscited by 249
- 2023A Survey on Oversmoothing in Graph Neural Networkscited by 247
- 2023Exphormer: Sparse Transformers for Graphscited by 170
- 2023On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topologycited by 166
- 2023Graph Inductive Biases in Transformers without Message Passingcited by 153
- 2024Graph-Mamba: Towards Long-Range Graph Sequence Modeling with Selective State Spacescited by 134
- 2021ETA Prediction with Graph Neural Networks in Google Mapscited by 130
- 2022Graph-Coupled Oscillator Networkscited by 124
- 2022A Generalization of ViT/MLP-Mixer to Graphscited by 93
- 2024Graph Mamba: Towards Learning on Graphs with State Space Modelscited by 86
- 2023Where Did the Gap Go? Reassessing the Long-Range Graph Benchmarkcited by 85
- 2023DRew: Dynamically Rewired Message Passing with Delaycited by 82
- 2023On the Connection Between MPNN and Graph Transformercited by 61
- 2022Anti-Symmetric DGN: a stable architecture for Deep Graph Networkscited by 60
- 2025On Vanishing Gradients, Over-Smoothing, and Over-Squashing in GNNs: Bridging Recurrent and Graph Learningcited by 43
- 2023Path Neural Networks: Expressive and Accurate Graph Neural Networkscited by 32
- 2024On Oversquashing in Graph Neural Networks Through the Lens of Dynamical Systemscited by 28
- 2023Adaptive Message Passing: A General Framework to Mitigate Oversmoothing, Oversquashing, and Underreachingcited by 24
- 2025Towards Quantifying Long-Range Interactions in Graph Machine Learning: a Large Graph Dataset and a Measurementcited by 20
- 2023Deep learning for dynamic graphs: models and benchmarkscited by 19
- 2024Spatio-Spectral Graph Neural Networkscited by 17
- 2024Port-Hamiltonian Architectural Bias for Long-Range Propagation in Deep Graph Networkscited by 16
- 2023CIN++: Enhancing Topological Message Passingcited by 14
- 2024Topology-Informed Graph Transformercited by 13
- 2025Return of ChebNet: Understanding and Improving an Overlooked GNN on Long Range Taskscited by 12
- 2023Recurrent Distance Filtering for Graph Representation Learningcited by 11
- 2025On Measuring Long-Range Interactions in Graph Neural Networkscited by 11
- 2023Diffusing Graph Attentioncited by 5
50 most cited of 52 All 52 (JSON)
Built on by
Citing papers per year: 2026: 10.
10 papers.
- 2026From Message-Passing to Linearized Graph Sequence Modelscited by 1
- 2026A Generalized Tikhonov Layer for Interpretable-by-design Graph Neural Networkscited by 1
- 2026Can Graph Foundation Models Generalize Over Architecture?cited by 0
- 2026Graph Rewiring in GNNs to Mitigate Over-Squashing and Over-Smoothing: A Surveycited by 0
- 2026RAwR: Role-Aware Rewiring via Approximate Equitable Partitioncited by 0
- 2026Graph Hierarchical Recurrence for Long-Range Generalizationcited by 0
- 2026HOPPER: Learnable Hop Extraction for Linearized Graph Sequence Modelscited by 0
- 2026Reachability is not enough: Diagnosing long-range behavior in GNNscited by 0
- 2026Get a GRIP, this will be a long TRIP: A Quantifiable Long-Range Framework for Verifying Over-squashingcited by 0
- 2026Mitigating Over-squashing without Rewiring: A Sheaf Effective Resistance Perspectivecited by 0
- 2026Mitigating Over-squashing without Rewiring: A Sheaf Effective Resistance Perspective3 Oct 2026
- 2026Get a GRIP, this will be a long TRIP: A Quantifiable Long-Range Framework for Verifying Over-squashing2 Oct 2026
- 2026Reachability is not enough: Diagnosing long-range behavior in GNNs27 Sep 2026
- 2026HOPPER: Learnable Hop Extraction for Linearized Graph Sequence Models10 Aug 2026
- 2026A Generalized Tikhonov Layer for Interpretable-by-design Graph Neural Networks27 May 2026
- 2026Graph Hierarchical Recurrence for Long-Range Generalization18 May 2026
- 2026From Message-Passing to Linearized Graph Sequence Models12 May 2026
- 2026RAwR: Role-Aware Rewiring via Approximate Equitable Partition10 May 2026
- 2026Graph Rewiring in GNNs to Mitigate Over-Squashing and Over-Smoothing: A Survey1 May 2026
- 2026Can Graph Foundation Models Generalize Over Architecture?24 Mar 2026