Grothendieck Graph Neural Networks Framework: An Algebraic Platform for Crafting Topology-Aware GNNs
Amirreza Shiralinasab Langari, Leila Yeganeh, Kim Khoa Nguyen

TL;DR
The paper introduces GkGNN, an algebraic framework that replaces neighborhood primitives in GNNs with covers, enabling topology-aware message passing and improving expressivity on graph isomorphism tasks.
Contribution
It proposes a novel algebraic extension using covers, formalizes them into matrices, and designs Sieve Neural Networks that outperform traditional neighborhood-based GNNs.
Findings
SNN achieves zero failures on challenging graph isomorphism benchmarks.
GkGNN provides a principled foundation for topology-aware GNNs.
Experiments demonstrate improved evaluation via label propagation.
Abstract
Graph Neural Networks (GNNs) are almost universally built on a single primitive: the neighborhood. Regardless of architectural variations, message passing ultimately aggregates over neighborhoods, which intrinsically limits expressivity and often yields power no stronger than the Weisfeiler-Lehman (WL) test. In this work, we challenge this primitive. We introduce the Grothendieck Graph Neural Networks (GkGNN) framework, which provides a strict algebraic extension of neighborhoods to covers, and in doing so replaces neighborhoods as the fundamental objects of message passing. Neighborhoods and adjacency matrices are recovered as special cases, while covers enable a principled and flexible foundation for defining topology-aware propagation schemes. GkGNN formalizes covers and systematically translates them into matrices, analogously to how adjacency matrices encode neighborhoods, enabling…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
