mlsanityData to 14 Oct 2026

Can You Hear Me Now? A Benchmark for Long-Range Graph Propagation

arXiv 2512.17762 ↗First posted 19 Dec 2025cs.LGcited by 10

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

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Inductive Representation Learning on Large Graphscited by 6,320
  3. 2018How Powerful are Graph Neural Networks?cited by 4,393
  4. 2017Neural Message Passing for Quantum Chemistrycited by 3,487
  5. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  6. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,089
  7. 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,102
  8. 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,051
  9. 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
  10. 2019Strategies for Pre-training Graph Neural Networkscited by 971
  11. 2020Simple and Deep Graph Convolutional Networkscited by 860
  12. 2015Convolutional Networks on Graphs for Learning Molecular Fingerprintscited by 754
38 more
  1. 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
  2. 2020Benchmarking Graph Neural Networkscited by 680
  3. 2020On the Bottleneck of Graph Neural Networks and its Practical Implicationscited by 631
  4. 2020Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classificationcited by 506
  5. 2020Principal Neighbourhood Aggregation for Graph Netscited by 478
  6. 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 478
  7. 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 443
  8. 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 335
  9. 2020Improving Graph Neural Network Expressivity via Subgraph Isomorphism Countingcited by 313
  10. 2022Long Range Graph Benchmarkcited by 263
  11. 2020A Note on Over-Smoothing for Graph Neural Networkscited by 249
  12. 2023A Survey on Oversmoothing in Graph Neural Networkscited by 247
  13. 2023Exphormer: Sparse Transformers for Graphscited by 170
  14. 2023On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topologycited by 166
  15. 2023Graph Inductive Biases in Transformers without Message Passingcited by 153
  16. 2024Graph-Mamba: Towards Long-Range Graph Sequence Modeling with Selective State Spacescited by 134
  17. 2021ETA Prediction with Graph Neural Networks in Google Mapscited by 130
  18. 2022Graph-Coupled Oscillator Networkscited by 124
  19. 2022A Generalization of ViT/MLP-Mixer to Graphscited by 93
  20. 2024Graph Mamba: Towards Learning on Graphs with State Space Modelscited by 86
  21. 2023Where Did the Gap Go? Reassessing the Long-Range Graph Benchmarkcited by 85
  22. 2023DRew: Dynamically Rewired Message Passing with Delaycited by 82
  23. 2023On the Connection Between MPNN and Graph Transformercited by 61
  24. 2022Anti-Symmetric DGN: a stable architecture for Deep Graph Networkscited by 60
  25. 2025On Vanishing Gradients, Over-Smoothing, and Over-Squashing in GNNs: Bridging Recurrent and Graph Learningcited by 43
  26. 2023Path Neural Networks: Expressive and Accurate Graph Neural Networkscited by 32
  27. 2024On Oversquashing in Graph Neural Networks Through the Lens of Dynamical Systemscited by 28
  28. 2023Adaptive Message Passing: A General Framework to Mitigate Oversmoothing, Oversquashing, and Underreachingcited by 24
  29. 2025Towards Quantifying Long-Range Interactions in Graph Machine Learning: a Large Graph Dataset and a Measurementcited by 20
  30. 2023Deep learning for dynamic graphs: models and benchmarkscited by 19
  31. 2024Spatio-Spectral Graph Neural Networkscited by 17
  32. 2024Port-Hamiltonian Architectural Bias for Long-Range Propagation in Deep Graph Networkscited by 16
  33. 2023CIN++: Enhancing Topological Message Passingcited by 14
  34. 2024Topology-Informed Graph Transformercited by 13
  35. 2025Return of ChebNet: Understanding and Improving an Overlooked GNN on Long Range Taskscited by 12
  36. 2023Recurrent Distance Filtering for Graph Representation Learningcited by 11
  37. 2025On Measuring Long-Range Interactions in Graph Neural Networkscited by 11
  38. 2023Diffusing Graph Attentioncited by 5

50 most cited of 52 All 52 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 10.

10 papers.