Methods › Graphs › Graph Models › PNA
Principal Neighbourhood Aggregation
PNA
Introduced by Gabriele Corso et al. in Principal Neighbourhood Aggregation for Graph Nets
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Principal Neighbourhood Aggregation (PNA) is a general and flexible architecture for graphs combining multiple aggregators with degree-scalers (which generalize the sum aggregator).
In Syntology repository known, no verified implementation (declared_code; repositories: 5 listed of 8 in the graph, strongest link: official). The lookup matched a different name in Syntology's graph, 'Principal Neighbourhood Aggregation (PNA)' (resolution: alias); this answer is about that name. This answer is about arXiv:2004.05718, the paper the archive credits with this method.
Origin paper of this answer, arXiv:2004.05718 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 33 ran (of which 4 constructed an object rather than computing a result; 11 with no instrument failure: 4 honoured, 0 violated, 7 with no contract checked; 22 where Syntology's instrument failed) · 22 unverified (of 55 harvested samples) · 48 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 5 · with a code link: 3 · where Syntology ran a sample: 1 (1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (1 of 5 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 5 of 5, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Integrated Super-resolution Sensing and Symbiotic Communication with 3D Sparse MIMO for Low-Altitude UAV Swarm 18 Apr 2025 · 0 repositories · arXiv:2504.13570
-
Mixed Delay/Nondelay Embeddings Based Neuromorphic Computing with Patterned Nanomagnet Arrays 5 Dec 2024 · 0 repositories · arXiv:2412.04622
-
Graph Mixer Networks 29 Jan 2023 · 1 repository · arXiv:2301.12493
-
Do We Need Anisotropic Graph Neural Networks? 3 Apr 2021 · 2 repositories · arXiv:2104.01481
-
Principal Neighbourhood Aggregation for Graph Nets 12 Apr 2020 · 8 repositories · arXiv:2004.05718Syntology community repositories only · 33 ran (of which 4 constructed an object rather than computing a result; 11 with no instrument failure: 4 honoured, 0 violated, 7 with no contract checked; 22 where Syntology's instrument failed) · 22 unverified (of 55 harvested samples) · 48 pointer-only (licence)
Tasks archive 2025-07-28
9 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| Benchmarking | 1 |
| Computational Efficiency | 1 |
| Graph Classification | 1 |
| Graph Neural Network | 1 |
| Graph Regression | 1 |
| Molecular Property Prediction | 1 |
| Node Classification | 1 |
| Super-Resolution | 1 |
| Time Series | 1 |
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections