Unifying Graph Neural Networks Through a Common Layer Equation

Sai Karthik Navuluru, Siddhartha Shankar Das, Bo Ni, Hongjie Chen, Yu Wang, Baris Coskunuzer, Nesreen K. Ahmed, Franck Dernoncourt, Mahantesh Halappanavar, Tyler Derr, Ryan A. Rossi, Lakshman TamilarXiv 2026 · arXiv

TL;DR

This paper introduces a "Rosetta Stone" for Graph Neural Networks (GNNs) by distilling hundreds of fragmented architectures into a single, unified layer equation. By breaking a GNN layer into seven modular "slots," the framework allows researchers to compare models apples-to-apples, identify why certain designs fail, and even generate entirely new architectures by mixing and matching components.

What Problem Does This Paper Address?

The GNN field has exploded with hundreds of different architectures—Spatial, Spectral, Attention-based, Graph Transformers, and more. However, each sub-field uses its own notation and family-specific equations. This fragmentation makes it incredibly difficult to determine if a new model is a genuine innovation or just a known mathematical operation with a new name.

The authors tackle this "comparability problem." Without a common language, it is hard to understand the trade-offs between models or to systematically diagnose issues like oversmoothing (where node features become indistinguishable) or oversquashing (where information is lost through graph bottlenecks).

Methods

The authors develop a Unified Layer Equation that represents a GNN layer through seven modular components:

  1. Update Domain ($\mathcal{X}$): What objects are being updated (e.g., nodes, edges, or subgraphs).
  2. Channel Set ($\mathcal{K}$): The parallel streams of information flow.
  3. Propagation Bank ($\{P_k\}$): Encodes where information moves (e.g., adjacency matrices or attention weights).
  4. Message Maps ($\{\Psi_k\}$): Encodes what information moves (e.g., linear transformations).
  5. Mixing Operator ($\boxplus$): How channel contributions are combined (e.g., summation or concatenation).
  6. Ego/Residual Map ($B_\ell$): How the node’s own prior state is carried forward.
  7. Update Map ($\phi_\ell$): The function that produces the new state (e.g., a nonlinearity or MLP).

The key insight is the factorization of propagation and messages. By separating the "where" from the "what," the authors can map over 200 existing architectures into this single schema. They also enforce a "slot discipline"—a set of rules to ensure that mathematical operations are assigned to the correct component consistently.

Figure 1: Our unified GNN design space. We organize seven previously fragmented architectural families around one common layer. Read the figure from left to right: family-specific formulations are translated into seven shared components: the update domain X, channel set K, propagation bank {Pk}, message maps {Ψk}, mixing operator ⊞, ego/residual map Bℓ, and update map ϕℓ. They then become directly comparable and recombinable. The key split is intuitive: Pk specifies where information moves, while Ψk specifies what moves.

Datasets

As a theoretical and unifying framework, the paper does not introduce a new training dataset. Instead, it re-evaluates findings from major existing benchmarks through the lens of its seven components. These include:

  • Citation Networks: Cora, Citeseer, Pubmed.
  • Open Graph Benchmark (OGB): Large-scale realistic datasets for node and link prediction.
  • Long Range Graph Benchmark (LRGB): Datasets designed to test long-distance dependencies.
  • Heterophily Suites: Datasets where connected nodes often have different labels.

Key Insights and Ideas

  • The "Where vs. What" Factorization: This is the paper's "aha moment." It reveals that many models appearing different in literature are actually identical in their "message" component and only differ in their "propagation" component (or vice versa).
  • Channel Rank as an Invariant: The authors prove that in linear models, the raw number of channels isn't a fixed property of the model's function—you can split or merge channels without changing the math. The true invariant is the "Kronecker separation rank" of the layer.
  • Global Mixing Requirements: The framework provides a formal proof for why a single layer needs a "full row" in its propagation operator to achieve global communication. This explains why virtual nodes or global attention are necessary for certain tasks.
  • Architecture Generation: Because the design space is now structured, the authors could use a language-model controller to "propose" new architectures that are structurally sound but haven't been invented yet, such as "Spectrally-Gated Propagation."

Key Results

The framework successfully organizes over 200 architectures into seven non-exclusive families.

Comparison of Spatial GNNs.

Quantitatively, the authors demonstrate the framework's utility by:

  • Worked Reductions: Showing step-by-step how canonical models like GCN, GraphSAGE, GAT, and GIN are just specific "fillings" of the unified equation.
  • Identifying Identifiability: Proving that two models cannot be declared functionally different just because they use different numbers of heads or relations if their underlying Kronecker rank is the same.
  • Diagnostic Mapping: Creating a "remedy map" that links specific GNN pathologies (like oversquashing) to specific slots in the equation that need to be modified.

Limitations and Future Work

The authors acknowledge that while they have unified the layer math, they haven't yet unified the entire pipeline (e.g., specific loss functions or complex training schedules).

A major open challenge they identify is the "inverse problem": we now have a vocabulary to describe any GNN, but we don't yet have a definitive "lookup table" that tells us which component fillings are optimal for a specific dataset's properties (like its degree distribution or homophily). Future work will focus on automating this mapping to move from descriptive unification to prescriptive design.

Summary updated

Abstract

Graph neural networks are commonly described through family-specific equations whose notation obscures shared computations and structural differences. We introduce a common layer equation that represents covered architectures through seven components: an update domain, channel set, propagation bank, per-channel message maps, channel-fusion operator, ego/residual map, and update map. The central factorization separates where information moves, encoded by the propagation bank, from what moves, encoded by the message maps. Function-valued fillings extend the same equation across local message passing, attention, spectral filtering, global communication, relation-specific channels, higher-order domains, and geometric messages. We make this unification explicit and checkable through worked reductions of canonical layers and component assignments spanning seven nonexclusive architectural families. A fixed slot discipline assigns operations by computational role and defines the framework's coverage boundary. The decomposition also yields component-level theoretical insights: under endpoint-local messages and node-local updates, operator support bounds one-layer dependencies, and one-layer global mixing requires a full effective operator row under the stated hypotheses. The resulting framework organizes more than 200 architectures in a common design space, enables component-wise comparison and generation of structurally consistent architectures, and connects propagation choices to oversmoothing, oversquashing, heterophily, and expressivity. It further exposes the empirical inverse problem of mapping measurable graph and task properties to validated component choices.
BibTeX
@misc{navuluru2026unifying,
  author = {Sai Karthik Navuluru and Siddhartha Shankar Das and Bo Ni and Hongjie Chen and Yu Wang and Baris Coskunuzer and Nesreen K. Ahmed and Franck Dernoncourt and Mahantesh Halappanavar and Tyler Derr and Ryan A. Rossi and Lakshman Tamil},
  title = {{Unifying Graph Neural Networks Through a Common Layer Equation}},
  year = {2026},
  eprint = {2608.16097},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.16097},
}
Figure