Methods › Graphs › Graph Models › GCN

Graph Convolutional Network

GCN

968 papers tagged archive 2025-07-28

Introduced by Thomas N. Kipf et al. in Semi-Supervised Classification with Graph Convolutional Networks

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

A Graph Convolutional Network, or GCN, is an approach for semi-supervised learning on graph-structured data. It is based on an efficient variant of convolutional neural networks which operate directly on graphs. The choice of convolutional architecture is motivated via a localized first-order approximation of spectral graph convolutions. The model scales linearly in the number of graph edges and learns hidden layer representations that encode both local graph structure and features of nodes.

PaperSource

In Syntology about another paper, arXiv:2105.11776: repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: official). The lookup matched a different name in Syntology's graph, 'fact-level relation modeling leveraging graph convolution network (GCN)' (resolution: alias); this answer is about that name. About another paper: this answer is about arXiv:2105.11776, while the archive credits arXiv:1609.02907.

Origin paper of this answer, arXiv:2105.11776 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result (of 2 harvested samples) · 2 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: 968 · with a code link: 443 · where Syntology ran a sample: 94 (76 with a run with no instrument failure, 18 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (94 of 968 tagged: 76 with a run with no instrument failure, 18 where every run was a failure of Syntology's instrument)

Page 1 of 10: papers 1 to 100 of 968, 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 490 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
Node Classification157
Graph Neural Network81
Representation Learning71
Graph Learning68
Classification67
General Classification60
Action Recognition48
Graph Classification47
Link Prediction44
Skeleton Based Action Recognition43
Recommendation Systems39
Graph Embedding32
Graph Attention31
Prediction31
Clustering29
Knowledge Graphs27
Collaborative Filtering25
Graph Representation Learning25
Pose Estimation25
Relation24

Usage over time archive 2025-07-28

Papers per year tagged with GCN: 2016 to 2025, peak 203 203 0 2016: 1 paper 2016 2017: 5 papers 2017 2018: 28 papers 2018 2019: 114 papers 2019 2020: 159 papers 2020 2021: 203 papers 2021 2022: 155 papers 2022 2023: 125 papers 2023 2024: 139 papers 2024 2025: 39 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (968 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 Models

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