Characterize the long-rangedness of existing graph benchmarks
Determine whether the LRGB, GLoRa, and ECHO benchmark suites genuinely require long-range interactions, rather than permitting accurate prediction from shorter-range information or other correlations.
References
In conclusion, the long-ranged nature of benchmarks LRGB , GLoRa and ECHO is unknown.
We note that, eccentricity, for instance, is the longest shortest path from a node, which is plausibly correlated with the degrees of the immediate neighbors of that node -- but the achievable accuracy from such correlations alone is not characterized in .
Nevertheless, the example is illustrative rather than a general proof, and we believe there remains a not-yet-fully-understood interplay between homophily and range that merits further investigation.