Michael Bronstein, Bastian Rieck, Daniel Cremers, Yuesong Shen, Marvin Eisenberger, Abhishek Saroha, Christian Koke
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We show that contrary to conventional wisdom in the community, graph neural networks (GNNs) are not continuous with respect to all natural modes of graph convergence. As a result, GNNs may generate substantially different latent representations for graphs that are very similar. In particular they assign vastly different latent embeddings to graphs that represent the same underlying object at different resolution scales. We trace this failure of continuity back to a structural obstruction arising from commonly used information-propagation schemes. Building on this insight, we then derive a principled modification to standard GNN architectures which equips models with continuity across scales. The proposed modification enables consistent integration of distinct resolutions and reliable generalization between them. We systematically validate our theoretical findings in a wide range of numerical experiments. Our code is available at https:// github.com/christiankoke/scalecontinuous-gnns.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2605.31315")
get_code_for_paper("2605.31315")
have("2605.31315")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2605.31315.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2605.31315)
Connect an agent — have() is free.