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.
ORIGINAL PAPER
Unifying Graph Neural Networks Through a Common Layer Equation
WHAT WE KNOW
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.
WATCH NEXT
Review the primary source, validate the main result, and establish whether any listed-company transmission is direct.
EVIDENCE
What the evidence supports so far
Research signals
interpretability
training-method
What remains unverified
The full methodology, effect size, and limitations still require analyst review.
Company impact remains unverified until a direct economic transmission is established.