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

Luca Miglior, Matteo Tolloso, Alessio Gravina, Davide Bacciu
12/19/2025
cs.LG

No official code found. Best implementation: Graph-ECHO-Benchmark/ECHO (9 stars, MIT, last commit 2026-03-19).

Abstract

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.

View on arXivView PDF

Code Implementations(1)

MIT

Official reference implementation of our paper "Can You Hear Me Now? A Benchmark for Long-Range Graph Propagation".

93Shell, PythonDec 19, 20257 months agoMIT

Similar Papers

Cite this paper

@article{miglior2025hear,
  title  = {Can You Hear Me Now? A Benchmark for Long-Range Graph Propagation},
  author = {Luca Miglior and Matteo Tolloso and Alessio Gravina and Davide Bacciu},
  year   = {2025},
  eprint = {2512.17762},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.17762v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.17762.svg)](https://codeofpaper.com/paper/2512.17762)

Discussion