Methods › Graphs › Graph Models › GIN

Graph Isomorphism Network

GIN

43 papers tagged archive 2025-07-28

Introduced by Keyulu Xu et al. in How Powerful are Graph Neural Networks?

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

Per the authors, Graph Isomorphism Network (GIN) generalizes the WL test and hence achieves maximum discriminative power among GNNs.

PaperSource

In Syntology about another paper, arXiv:2001.04872: repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: mentioned on GitHub). The lookup matched a different name in Syntology's graph, 'General Incompressible-flow Network (GIN)' (resolution: alias); this answer is about that name. About another paper: this answer is about arXiv:2001.04872, while the archive credits arXiv:1810.00826.

Origin paper of this answer, arXiv:2001.04872 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 5 harvested samples). 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: 43 · with a code link: 25 · where Syntology ran a sample: 5 (4 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (5 of 43 tagged: 4 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 43 of 43, 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 59 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 Classification10
Graph Neural Network9
Node Classification7
Graph Learning4
Classification3
General Classification3
Molecular Property Prediction3
Property Prediction3
Adversarial Attack2
Contrastive Learning2
Data Augmentation2
Domain Adaptation2
Feature Engineering2
Graph Property Prediction2
Graph Regression2
Graph Representation Learning2
Link Prediction2
Prediction2
Representation Learning2
Transfer Learning2

Usage over time archive 2025-07-28

Papers per year tagged with GIN: 2018 to 2025, peak 8 8 0 2018: 1 paper 2018 2019: 2 papers 2019 2020: 5 papers 2020 2021: 7 papers 2021 2022: 7 papers 2022 2023: 7 papers 2023 2024: 8 papers 2024 2025: 6 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (43 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 ModelsGraph Embeddings

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