Methods › Graphs › Graph Representation Learning › Graph Neural Network

Graph Neural Network

2,694 papers tagged archive 2025-07-28

Introduced by Jie Zhou et al. in Graph Neural Networks: A Review of Methods and Applications

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

The archive carries no description for this method.

PaperSource

In Syntology about another paper, arXiv:2303.17774: no code under this name (no_code; paper_only). The lookup matched 'graph neural network' ignoring case. About another paper: this answer is about arXiv:2303.17774, while the archive credits arXiv:1812.08434, so it does not say whether this method has code.

Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.

Origin paper of this answer, arXiv:2303.17774 (its page on Syntology).

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.

What each level means, quoted from Syntology's server card: V0 “imports”; V1 “executes against a synthesized fixture and returns a value of the recorded type”; V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” The card adds: “No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.” A level quoted in two parts is one definition the card writes as two clauses joined by a double hyphen, each clause quoted on its own (how these levels are quoted).

Papers archive 2025-07-28

archive papers tagged: 2,694 · with a code link: 1,137 · where Syntology ran a sample: 271 (233 with a run with no instrument failure, 38 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (271 of 2,694 tagged: 233 with a run with no instrument failure, 38 where every run was a failure of Syntology's instrument)

Page 1 of 27: papers 1 to 100 of 2,694, 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.

Tasks archive 2025-07-28

20 shown of 872 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Graph Neural Network2,657
Representation Learning217
Node Classification192
Graph Learning142
Prediction123
Link Prediction116
Graph Attention108
Graph Classification103
Recommendation Systems103
Graph Representation Learning92
Classification83
Contrastive Learning72
Reinforcement Learning (RL)69
Time Series69
reinforcement-learning63
Knowledge Graphs62
Property Prediction55
Decision Making54
Drug Discovery53
Relation53

Usage over time archive 2025-07-28

Papers per year tagged with Graph Neural Network: 2018 to 2025, peak 570 570 0 2018: 1 paper 2018 2019: 156 papers 2019 2020: 292 papers 2020 2021: 427 papers 2021 2022: 474 papers 2022 2023: 537 papers 2023 2024: 570 papers 2024 2025: 237 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (2,694 dated). Bars are counts, not a trend claim.

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

Graph Representation Learning

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