Browse State-of-the-Art › Graph Property Prediction
Graph Property Prediction
47 papers with code · 5 benchmarks · 3 datasets archive 2025-07-28
Benchmarks archive 2025-07-28
5 leaderboard tables shown for this task, 5 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
Syntology 1 newer paper was judged to report on this task's benchmarks so far (Claude Sonnet 4.5, reading their tables: a model's judgement, not a result; 0 placed): ogbg-molhiv (1 judged, 0 placed), ogbg-molpcba (1 judged, 0 placed). Drawn from 8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read).
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| ogbg-molhiv (43 rows) | HyperFusion | — | — | — | Compare |
| ogbg-molpcba (36 rows) | HyperFusino | — | — | — | Compare |
| ogbg-code2 (21 rows) | SAT++ with Magnetic Laplacian | Transformers Meet Directed Graphs | code | — | Compare |
| ogbg-ppa (18 rows) | GatedGCN+ | Unlocking the Potential of Classic GNNs for Graph-level Tasks:... | code | Syntology official (archive's flag): 7 ran · 7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 2 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified | Compare |
| QM9 (10 rows) | GotenNet (Large) | GotenNet: Rethinking Efficient 3D Equivariant Graph Neural Networks | code | — | Compare |
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. Each line reads “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. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is 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. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
3 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
7 subtasks in the archive's task tree.
Papers archive 2025-07-28
archive papers tagged: 56 · with a code link: 47 · where Syntology ran a sample: 21 (21 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 (21 of 56 tagged: 21 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 56 of 56, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “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 figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. 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); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.
-
10 Jun 2014 189 repositories listed Syntology official: no sample here; runs from other or unrecorded repositories · 46 ran (of which 0 constructed an object rather than computing a result; 28 with no instrument failure: 4 honoured, 1 violated, 23 with no contract checked; 18 where Syntology's instrument failed) · 9 unverified (of 55 harvested samples) · 22 pointer-only (licence)We propose a new framework for estimating generative models via an adversarial process, in which we simultaneously train two models: a generative model G that captures the data distribution, and a discriminative model D…
-
30 May 2021 8 repositories listed Syntology community repositories only · 11 ran (of which 1 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified (of 16 harvested samples) · 1 pointer-only (licence)Because GATs use a static attention mechanism, there are simple graph problems that GAT cannot express: in a controlled problem, we show that static attention hinders GAT from even fitting the training data.
-
9 Jun 2021 5 repositories listedOur key insight to utilizing Transformer in the graph is the necessity of effectively encoding the structural information of a graph into the model.
-
19 Feb 2021 5 repositories listed Syntology official (archive's flag): 1 ran · 15 ran (of which 7 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified (of 15 harvested samples) · 7 pointer-only (licence)This paper introduces a new model to learn graph neural networks equivariant to rotations, translations, reflections and permutations called E(n)-Equivariant Graph Neural Networks (EGNNs).
-
23 Jun 2022 4 repositories listed Syntology official (archive's flag): 1 ran · 3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified (of 4 harvested samples)Despite their widespread success in various domains, Transformer networks have yet to perform well across datasets in the domain of 3D atomistic graphs such as molecules even when 3D-related inductive biases like…
-
25 May 2022 4 repositories listed Syntology community repositories only · 3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 18 unverified (of 21 harvested samples)We propose a recipe on how to build a general, powerful, scalable (GPS) graph Transformer with linear complexity and state-of-the-art results on a diverse set of benchmarks.
-
6 Dec 2020 4 repositories listedOur studies demonstrate that the proposed DAM method improves the performance of optimizing cross-entropy loss by a large margin, and also achieves better performance than optimizing the existing AUC square loss on…
-
7 Feb 2024 3 repositories listed Syntology official (archive's flag): 9 ran · 10 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 8 where Syntology's instrument failed) · 3 unverified (of 13 harvested samples)We also obtain SOTA results on QM9, MOLPCBA, and LIT-PCBA molecular property prediction benchmarks via transfer learning.
-
7 Aug 2021 3 repositories listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 4 harvested samples)The resultant framework - which we call Edge-augmented Graph Transformer (EGT) - can directly accept, process and output structural information of arbitrary form, which is important for effective learning on…
-
13 Jun 2020 3 repositories listedGraph Convolutional Networks (GCNs) have been drawing significant attention with the power of representation learning on graphs.
-
24 Apr 2025 2 repositories listedUnderstanding complex three-dimensional (3D) structures of graphs is essential for accurately modeling various properties, yet many existing approaches struggle with fully capturing the intricate spatial relationships…
-
25 Apr 2024 2 repositories listedOverall, our results show promising capability to extract the underlying structure-property relationships for complex graph property prediction tasks.
-
21 Jun 2023 2 repositories listed Syntology official (archive's flag): 4 ran · 4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified (of 5 harvested samples) · 2 pointer-only (licence)Equivariant Transformers such as Equiformer have demonstrated the efficacy of applying Transformers to the domain of 3D atomistic systems.
-
7 Apr 2023 2 repositories listedGeometric deep learning enables the encoding of physical symmetries in modeling 3D objects.
-
25 Oct 2021 2 repositories listed Syntology official (archive's flag): 1 ran · 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result (of 2 harvested samples)The key is to make each node representation encode a subgraph around it more than a subtree.
-
6 Oct 2021 2 repositories listed Syntology official: harvested, nothing ran · 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified (of 8 harvested samples)Including covariant information, such as position, force, velocity or spin is important in many tasks in computational physics and chemistry.
-
23 Jun 2021 2 repositories listedNevertheless, these models can be severely constrained by the rigid combinatorial structure of Simplicial Complexes (SCs).
-
13 Feb 2025 1 repository listed Syntology official (archive's flag): 7 ran · 7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 2 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified (of 12 harvested samples) · 3 pointer-only (licence)Message-passing Graph Neural Networks (GNNs) are often criticized for their limited expressiveness, issues like over-smoothing and over-squashing, and challenges in capturing long-range dependencies, while Graph…
-
26 Dec 2024 1 repository listedIn the real world, however, the graph data can suffer from significant distribution shifts across clients as the clients may collect their graph data for different purposes.
-
24 Dec 2024 1 repository listedOur approach is general that it can be applied to homogeneous and heterogeneous graphs.
-
22 Jun 2024 1 repository listed Syntology official (archive's flag): 7 ran · 7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 4 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified (of 10 harvested samples) · 6 pointer-only (licence)Message-Passing Neural Networks (MPNNs) are extensively employed in graph learning tasks but suffer from limitations such as the restricted scope of information exchange, by being confined to neighboring nodes during…
-
14 Jun 2024 1 repository listed Syntology official (archive's flag): 4 ran · 4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified (of 5 harvested samples)Next, we evaluate the transferability of Temporal Graph Neural Networks (TGNNs) for the temporal graph property prediction task by pre-training on a collection of up to sixty-four token transaction networks and then…
-
5 Jun 2024 1 repository listed Syntology official (archive's flag): 13 ran · 13 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified (of 13 harvested samples) · 1 pointer-only (licence)Message-passing graph neural networks (GNNs) excel at capturing local relationships but struggle with long-range dependencies in graphs.
-
26 May 2024 1 repository listedWith the recent popularity of neural networks comes the need for efficient serving of inference workloads.
-
19 Mar 2024 1 repository listedIn the paper, a novel perspective on the representational capability of GNNs is investigated across all levels—node-level, neighborhood-level, and graph-level—when the space of node feature representation is uncountable.
-
18 Dec 2023 1 repository listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified (of 5 harvested samples) · 5 pointer-only (licence)As such, a key innovation of this work lies in the creation of a fast neighborhood sampling technique coupled with a local attention mechanism that encompasses a 4-hop reception field, but achieved through just 2-hop…
-
25 Aug 2023 1 repository listed Syntology official (archive's flag): 2 ran · 2 ran (of which 0 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) · 2 unverified (of 4 harvested samples)TpuGraphs provides 25x more graphs than the largest graph property prediction dataset (with comparable graph sizes), and 770x larger graphs on average compared to existing performance prediction datasets on machine…
-
21 May 2023 1 repository listed Syntology official (archive's flag): 7 ran · 7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 2 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified (of 8 harvested samples) · 4 pointer-only (licence)Here we propose Graph Segment Training (GST), a general framework that utilizes a divide-and-conquer approach to allow learning large graph property prediction with a constant memory footprint.
-
19 May 2023 1 repository listed Syntology official (archive's flag): 4 ran · 4 ran (of which 4 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) · 4 unverified; every one of the 4 samples that ran constructed an object rather than computing a result (of 8 harvested samples) · 8 pointer-only (licence)The core insight of our method is to fully consider the information propagation among nodes and edges in a graph when building the attention module in the transformer blocks.
-
17 Mar 2023 1 repository listed Syntology official: harvested, nothing ran · 0 ran · 2 unverified (of 2 harvested samples) · 2 pointer-only (licence)A conventional approach is training a model with the unlabeled graphs on self-supervised tasks and then fine-tuning the model on the prediction tasks.
-
31 Jan 2023 1 repository listed
-
24 Oct 2022 1 repository listed Syntology 6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified (of 9 harvested samples) · 3 pointer-only (licence)
-
13 Jul 2022 1 repository listed
-
2 Jun 2022 1 repository listed
-
1 Jun 2022 1 repository listed
-
30 May 2022 1 repository listed
-
5 Feb 2022 1 repository listed
-
28 Jan 2022 1 repository listed
-
14 Dec 2021 1 repository listed Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 2 harvested samples)
-
15 Jun 2021 1 repository listed Syntology 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result (of 1 harvested sample) · 1 pointer-only (licence)
-
15 Mar 2021 1 repository listed
-
25 Jan 2021 1 repository listed
-
20 Jan 2021 1 repository listed
-
14 Dec 2020 1 repository listed
-
30 Nov 2020 1 repository listed
-
21 Sep 2020 1 repository listed
-
16 Jun 2020 1 repository listed
-
Graph Positional Autoencoders as Self-supervised Learners29 May 2025 0 repositories listed
-
Message-Passing State-Space Models: Improving Graph Learning with Modern Sequence Modeling24 May 2025 0 repositories listed
-
Graph Generative Pre-trained Transformer2 Jan 2025 0 repositories listed
-
Attacking Graph Neural Networks with Bit Flips: Weisfeiler and Lehman Go Indifferent2 Nov 2023 0 repositories listed
-
13 Aug 2023 0 repositories listed
-
Graph Neural Networks Go Forward-Forward10 Feb 2023 0 repositories listed
-
Affinity-Aware Graph Networks23 Jun 2022 0 repositories listed
-
Addressing Over-Smoothing in Graph Neural Networks via Deep Supervision25 Feb 2022 0 repositories listed
-
BGL: GPU-Efficient GNN Training by Optimizing Graph Data I/O and Preprocessing16 Dec 2021 0 repositories listed
Syntology lines on 22 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
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