{"url":"/dataset/ogb","name":"OGB","full_name":"Open Graph Benchmark","description_markdown":"The **Open Graph Benchmark** (**OGB**) is a collection of realistic, large-scale, and diverse benchmark datasets for machine learning on graphs. OGB datasets are automatically downloaded, processed, and split using the OGB Data Loader. The model performance can be evaluated using the OGB Evaluator in a unified manner.\r\nOGB is a community-driven initiative in active development.\r\n\r\nSource: [https://ogb.stanford.edu/](https://ogb.stanford.edu/)\r\nImage Source: [https://ogb.stanford.edu/](https://ogb.stanford.edu/)","description_withheld":null,"homepage":"https://ogb.stanford.edu/","introduced_date":null,"introduced_date_note":null,"introduced_by":{"paper":"/paper/open-graph-benchmark-datasets-for-machine","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","first_author":"Weihua Hu","url":null},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Graphs","url":"/datasets/modality/graphs"}],"tasks":[{"name":"Node Classification","url":"/task/node-classification","datasets_with_task":"/datasets/task/node-classification"},{"name":"Link Prediction","url":"/task/link-prediction","datasets_with_task":"/datasets/task/link-prediction"},{"name":"Graph Classification","url":"/task/graph-classification","datasets_with_task":"/datasets/task/graph-classification"},{"name":"Graph Property Prediction","url":"/task/graph-property-prediction","datasets_with_task":"/datasets/task/graph-property-prediction"},{"name":"Node Property Prediction","url":"/task/node-property-prediction","datasets_with_task":"/datasets/task/node-property-prediction"},{"name":"Link Property Prediction","url":"/task/link-property-prediction","datasets_with_task":"/datasets/task/link-property-prediction"},{"name":"Abstract generation","url":"/task/abstract-generation","datasets_with_task":"/datasets/task/abstract-generation"}],"languages":[],"variants":["ogbl-wikikg2","ogbl-ppa","ogbl-ddi","ogbl-collab","ogbl-citation2","ogbl-biokg","ogbg-ppa","ogbg-molpcba","ogbg-code2","ogbn-mag","ogbn-papers100M","ogbg-molhiv","ogbn-proteins","ogbn-products","ogbn-arxiv","OGB"],"data_loaders":[{"repo":"https://github.com/snap-stanford/ogb","url":"https://ogb.stanford.edu/docs/home/#dataloader","frameworks":["pytorch"]},{"repo":"https://github.com/pykeen/pykeen","url":"https://github.com/pykeen/pykeen","frameworks":["pytorch"]}],"num_papers_in_archive":1000,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/node-property-prediction-on-ogbn-arxiv","task":"Node Property Prediction","dataset_variant":"ogbn-arxiv","rows":86,"metrics":["Test Accuracy","Ext. data","Validation Accuracy","Number of params"],"first_row_in_archive_order":{"model":"BiGTex","paper":"/paper/integrating-structural-and-semantic-signals","metrics":{"Ext. data":"Yes","Number of params":"5332968","Test Accuracy":"0.8851 ± 0.0027","Validation Accuracy":"0.8934 ± 0.0011"},"code_links":[{"title":"Azadeh297/BiGTex","url":"https://github.com/Azadeh297/BiGTex"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-property-prediction-on-ogbn-products","task":"Node Property Prediction","dataset_variant":"ogbn-products","rows":64,"metrics":["Test Accuracy","Ext. data","Validation Accuracy","Number of params"],"first_row_in_archive_order":{"model":"GLEM+EnGCN","paper":"/paper/learning-on-large-scale-text-attributed","metrics":{"Ext. data":"Yes","Number of params":"139633805","Test Accuracy":"0.9014 ± 0.0012","Validation Accuracy":"0.9370 ± 0.0004"},"code_links":[{"title":"andyjzhao/glem","url":"https://github.com/andyjzhao/glem"},{"title":"AndyJZhao/GLEM","url":"https://github.com/AndyJZhao/GLEM"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/graph-property-prediction-on-ogbg-molhiv","task":"Graph Property Prediction","dataset_variant":"ogbg-molhiv","rows":43,"metrics":["Test ROC-AUC","Ext. data","Validation ROC-AUC","Number of params"],"first_row_in_archive_order":{"model":"HyperFusion","paper":null,"metrics":{"Ext. data":"No","Number of params":"5908027","Test ROC-AUC":"0.8475 ± 0.0003","Validation ROC-AUC":"0.8275 ± 0.0008"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-property-prediction-on-ogbn-mag","task":"Node Property Prediction","dataset_variant":"ogbn-mag","rows":39,"metrics":["Test Accuracy","Ext. data","Validation Accuracy","Number of params"],"first_row_in_archive_order":{"model":"LDHGNN","paper":null,"metrics":{"Ext. data":"No","Number of params":"7720368","Test Accuracy":"0.8789 ± 0.0024","Validation Accuracy":"0.8836 ± 0.0028"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/graph-property-prediction-on-ogbg-molpcba","task":"Graph Property Prediction","dataset_variant":"ogbg-molpcba","rows":36,"metrics":["Test AP","Ext. data","Validation AP","Number of params"],"first_row_in_archive_order":{"model":"HyperFusino","paper":null,"metrics":{"Ext. data":"No","Number of params":"10887085","Test AP":"0.3204 ± 0.0001","Validation AP":"0.3353 ± 0.0002"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-property-prediction-on-ogbl-collab","task":"Link Property Prediction","dataset_variant":"ogbl-collab","rows":34,"metrics":["Test Hits@50","Ext. data","Validation Hits@50","Number of params"],"first_row_in_archive_order":{"model":"E2N","paper":"/paper/edge2node-reducing-edge-prediction-to-node","metrics":{"Ext. data":"No","Number of params":"526851","Test Hits@50":"0.9515 ± 0.1410","Validation Hits@50":"0.9546 ± 0.1270"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-property-prediction-on-ogbl-ddi","task":"Link Property Prediction","dataset_variant":"ogbl-ddi","rows":31,"metrics":["Ext. data","Test Hits@20","Validation Hits@20","Number of params"],"first_row_in_archive_order":{"model":"HyperFusion","paper":null,"metrics":{"Ext. data":"No","Number of params":"976022023","Test Hits@20":"0.9972 ± 0.0004","Validation Hits@20":"0.9956 ± 0.0001"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-property-prediction-on-ogbl-wikikg2","task":"Link Property Prediction","dataset_variant":"ogbl-wikikg2","rows":30,"metrics":["Test MRR","Ext. data","Validation MRR","Number of params"],"first_row_in_archive_order":{"model":"RelEns","paper":"/paper/relation-aware-ensemble-learning-for","metrics":{"Ext. data":"No","Number of params":"2176767622","Test MRR":"0.7392 ± 0.0011","Validation MRR":"0.7509 ± 0.0009"},"code_links":[{"title":"lars-research/relens","url":"https://github.com/lars-research/relens"},{"title":"LARS-research/RelEns","url":"https://github.com/LARS-research/RelEns"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-property-prediction-on-ogbl-ppa","task":"Link Property Prediction","dataset_variant":"ogbl-ppa","rows":26,"metrics":["Ext. data","Test Hits@100","Validation Hits@100","Number of params"],"first_row_in_archive_order":{"model":"** E2N**","paper":"/paper/edge2node-reducing-edge-prediction-to-node","metrics":{"Ext. data":"No","Number of params":"526851","Test Hits@100":"0.8911 ± 0.1266","Validation Hits@100":"0.8857 ± 0.1331"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-property-prediction-on-ogbn-proteins","task":"Node Property Prediction","dataset_variant":"ogbn-proteins","rows":26,"metrics":["Ext. data","Test ROC-AUC","Validation ROC-AUC","Number of params"],"first_row_in_archive_order":{"model":"LD+GAT","paper":"/paper/label-deconvolution-for-node-representation","metrics":{"Ext. data":"Yes","Number of params":"664233700","Test ROC-AUC":"0.8942 ± 0.0007","Validation ROC-AUC":"0.9527 ± 0.0007"},"code_links":[{"title":"MIRALab-USTC/LD","url":"https://github.com/MIRALab-USTC/LD"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-property-prediction-on-ogbl-citation2","task":"Link Property Prediction","dataset_variant":"ogbl-citation2","rows":23,"metrics":["Ext. data","Test MRR","Validation MRR","Number of params"],"first_row_in_archive_order":{"model":"GraphGPT(d1n30)","paper":"/paper/graphgpt-graph-learning-with-generative-pre","metrics":{"Ext. data":"No","Number of params":"133096832","Test MRR":"0.9305 ± 0.0020","Validation MRR":"0.9295 ± 0.0022"},"code_links":[{"title":"alibaba/graph-gpt","url":"https://github.com/alibaba/graph-gpt"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/graph-property-prediction-on-ogbg-code2","task":"Graph Property Prediction","dataset_variant":"ogbg-code2","rows":21,"metrics":["Test F1 score","Ext. data","Validation F1 score","Number of params"],"first_row_in_archive_order":{"model":"SAT++ with Magnetic Laplacian","paper":"/paper/transformers-meet-directed-graphs","metrics":{"Ext. data":"No","Number of params":"14378069","Test F1 score":"0.2222 ± 0.0010","Validation F1 score":"0.2044 ± 0.0020"},"code_links":[{"title":"deepmind/digraph_transformer","url":"https://github.com/deepmind/digraph_transformer"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-property-prediction-on-ogbn-papers100m","task":"Node Property Prediction","dataset_variant":"ogbn-papers100M","rows":20,"metrics":["Test Accuracy","Ext. data","Validation Accuracy","Number of params"],"first_row_in_archive_order":{"model":"GLEM+GIANT+GAMLP","paper":"/paper/learning-on-large-scale-text-attributed","metrics":{"Ext. data":"Yes","Number of params":"154775375","Test Accuracy":"0.7037 ± 0.0002","Validation Accuracy":"0.7354 ± 0.0001"},"code_links":[{"title":"andyjzhao/glem","url":"https://github.com/andyjzhao/glem"},{"title":"AndyJZhao/GLEM","url":"https://github.com/AndyJZhao/GLEM"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/graph-property-prediction-on-ogbg-ppa","task":"Graph Property Prediction","dataset_variant":"ogbg-ppa","rows":18,"metrics":["Ext. data","Test Accuracy","Validation Accuracy","Number of params"],"first_row_in_archive_order":{"model":"GatedGCN+","paper":"/paper/unlocking-the-potential-of-classic-gnns-for","metrics":{"Ext. data":"No","Number of params":"5547557","Test Accuracy":"0.8258 ± 0.0055","Validation Accuracy":"0.7815 ± 0.0043"},"code_links":[{"title":"LUOyk1999/GNNPlus","url":"https://github.com/LUOyk1999/GNNPlus"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-property-prediction-on-ogbl-biokg","task":"Link Property Prediction","dataset_variant":"ogbl-biokg","rows":16,"metrics":["Test MRR","Ext. data","Validation MRR","Number of params"],"first_row_in_archive_order":{"model":"RelEns","paper":"/paper/relation-aware-ensemble-learning-for","metrics":{"Ext. data":"No","Number of params":"849427106","Test MRR":"0.9618 ± 0.0002","Validation MRR":"0.9627 ± 0.0004"},"code_links":[{"title":"lars-research/relens","url":"https://github.com/lars-research/relens"},{"title":"LARS-research/RelEns","url":"https://github.com/LARS-research/RelEns"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-prediction-on-ogbl-collab","task":"Link Prediction","dataset_variant":"ogbl-collab","rows":1,"metrics":["Test Hits@50"],"first_row_in_archive_order":{"model":"Edge2Node","paper":"/paper/edge2node-reducing-edge-prediction-to-node","metrics":{"Test Hits@50":"0.9515"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/node-classification-on-ogbn-products","task":"Node Classification","dataset_variant":"ogbn-products","rows":1,"metrics":["Inference Time (ms)"],"first_row_in_archive_order":{"model":"FIT-GNN","paper":"/paper/faster-inference-time-for-gnns-using","metrics":{"Inference Time (ms)":"0.0016"},"code_links":[{"title":"Roy-Shubhajit/FIT-GNN","url":"https://github.com/Roy-Shubhajit/FIT-GNN"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers_with_a_benchmark_row":[{"paper":"/paper/integrating-structural-and-semantic-signals","title":"Integrating Structural and Semantic Signals in Text-Attributed Graphs with BiGTex","date":"2025-04-16","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/unlocking-the-potential-of-classic-gnns-for","title":"Unlocking the Potential of Classic GNNs for Graph-level Tasks: Simple Architectures Meet Excellence","date":"2025-02-13","rows_on_this_dataset":6,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":12,"samples_ran":4,"samples_unverified":8,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/mixture-of-experts-meets-decoupled-message","title":"Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification","date":"2024-12-11","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/can-gnns-learn-link-heuristics-a-concise","title":"Can GNNs Learn Link Heuristics? A Concise Review and Evaluation of Link Prediction Methods","date":"2024-11-22","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":0,"samples_unverified":3,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/reconsidering-the-performance-of-gae-in-link","title":"Reconsidering the Performance of GAE in Link Prediction","date":"2024-11-06","rows_on_this_dataset":3,"code_links":2,"syntology":null},{"paper":"/paper/faster-inference-time-for-gnns-using","title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","date":"2024-10-19","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/next-level-message-passing-with-hierarchical","title":"Next Level Message-Passing with Hierarchical Support Graphs","date":"2024-06-22","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":10,"samples_ran":4,"samples_unverified":6,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/classic-gnns-are-strong-baselines-reassessing","title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","date":"2024-06-13","rows_on_this_dataset":6,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":9,"samples_ran":2,"samples_unverified":7,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/polynormer-polynomial-expressive-graph","title":"Polynormer: Polynomial-Expressive Graph Transformer in Linear Time","date":"2024-03-02","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":8,"samples_ran":5,"samples_unverified":3,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/loss-aware-curriculum-learning-for","title":"Loss-aware Curriculum Learning for Heterogeneous Graph Neural Networks","date":"2024-02-29","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/triplet-interaction-improves-graph","title":"Triplet Interaction Improves Graph Transformers: Accurate Molecular Graph Learning with Triplet Graph Transformers","date":"2024-02-07","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":13,"samples_ran":10,"samples_unverified":3,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/graphgpt-graph-learning-with-generative-pre","title":"GraphGPT: Graph Learning with Generative Pre-trained Transformers","date":"2023-12-31","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/edge2node-reducing-edge-prediction-to-node","title":"Edge2Node: Reducing Edge Prediction to Node Classification","date":"2023-11-06","rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/efficient-heterogeneous-graph-learning-via","title":"Efficient Heterogeneous Graph Learning via Random Projection","date":"2023-10-23","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":8,"samples_ran":5,"samples_unverified":3,"pointer_only_for_licence":8,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/ensemble-learning-for-graph-neural-networks","title":"Ensemble Learning for Graph Neural Networks","date":"2023-10-22","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/relation-aware-ensemble-learning-for","title":"Relation-aware Ensemble Learning for Knowledge Graph Embedding","date":"2023-10-13","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/label-deconvolution-for-node-representation","title":"Label Deconvolution for Node Representation Learning on Large-scale Attributed Graphs against Learning Bias","date":"2023-09-26","rows_on_this_dataset":4,"code_links":1,"syntology":null},{"paper":"/paper/prior-bilinear-based-models-for-knowledge","title":"Prior Bilinear Based Models for Knowledge Graph Completion","date":"2023-09-25","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/higher-order-graph-convolutional-network-with","title":"Higher-order Graph Convolutional Network with Flower-Petals Laplacians on Simplicial Complexes","date":"2023-09-22","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":1,"samples_ran":1,"samples_unverified":0,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/circle-feature-graphormer-can-circle-features","title":"Circle Feature Graphormer: Can Circle Features Stimulate Graph Transformer?","date":"2023-09-11","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/pure-message-passing-can-estimate-common","title":"Pure Message Passing Can Estimate Common Neighbor for Link Prediction","date":"2023-09-02","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":10,"samples_ran":5,"samples_unverified":5,"pointer_only_for_licence":10,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/generalizing-topological-graph-neural","title":"Weisfeiler and Lehman Go Paths: Learning Topological Features via Path Complexes","date":"2023-08-13","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/simteg-a-frustratingly-simple-approach","title":"SimTeG: A Frustratingly Simple Approach Improves Textual Graph Learning","date":"2023-08-03","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":4,"samples_ran":3,"samples_unverified":1,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/long-range-dependency-based-multi-layer","title":"Long-range Meta-path Search on Large-scale Heterogeneous Graphs","date":"2023-07-17","rows_on_this_dataset":3,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":7,"samples_ran":3,"samples_unverified":4,"pointer_only_for_licence":7,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/transerr-translation-based-knowledge-graph","title":"TransERR: Translation-based Knowledge Graph Embedding via Efficient Relation Rotation","date":"2023-06-26","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/spectral-heterogeneous-graph-convolutions-via","title":"Spectral Heterogeneous Graph Convolutions via Positive Noncommutative Polynomials","date":"2023-05-31","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/explanations-as-features-llm-based-features","title":"Harnessing Explanations: LLM-to-LM Interpreter for Enhanced Text-Attributed Graph Representation Learning","date":"2023-05-31","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":7,"samples_ran":4,"samples_unverified":3,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/how-to-turn-your-knowledge-graph-embeddings-1","title":"How to Turn Your Knowledge Graph Embeddings into Generative Models","date":"2023-05-25","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-propagation-transformer-for-graph","title":"Graph Propagation Transformer for Graph Representation Learning","date":"2023-05-19","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":8,"samples_ran":4,"samples_unverified":4,"pointer_only_for_licence":8,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/towards-better-graph-representation-learning","title":"Towards Better Graph Representation Learning with Parameterized Decomposition & Filtering","date":"2023-05-10","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":4,"samples_ran":0,"samples_unverified":4,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/knowledge-graph-embedding-with-3d-compound","title":"Knowledge Graph Embedding with 3D Compound Geometric Transformations","date":"2023-04-01","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/contranorm-a-contrastive-learning-perspective","title":"ContraNorm: A Contrastive Learning Perspective on Oversmoothing and Beyond","date":"2023-03-12","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":1,"samples_ran":1,"samples_unverified":0,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/surel-moving-from-walks-to-sets-for-scalable","title":"SUREL+: Moving from Walks to Sets for Scalable Subgraph-based Graph Representation Learning","date":"2023-03-06","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/neural-common-neighbor-with-completion-for","title":"Neural Common Neighbor with Completion for Link Prediction","date":"2023-02-02","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/transformers-meet-directed-graphs","title":"Transformers Meet Directed Graphs","date":"2023-01-31","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/simplifying-subgraph-representation-learning","title":"Simplifying Subgraph Representation Learning for Scalable Link Prediction","date":"2023-01-29","rows_on_this_dataset":3,"code_links":3,"syntology":null},{"paper":"/paper/gipa-a-general-information-propagation","title":"GIPA: A General Information Propagation Algorithm for Graph Learning","date":"2023-01-19","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/learning-on-large-scale-text-attributed","title":"Learning on Large-scale Text-attributed Graphs via Variational Inference","date":"2022-10-26","rows_on_this_dataset":4,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":1,"samples_ran":0,"samples_unverified":1,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/transformers-over-directed-acyclic-graphs-1","title":"Transformers over Directed Acyclic Graphs","date":"2022-10-24","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":9,"samples_ran":2,"samples_unverified":7,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/a-comprehensive-study-on-large-scale-graph","title":"A Comprehensive Study on Large-Scale Graph Training: Benchmarking and Rethinking","date":"2022-10-14","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":6,"samples_ran":4,"samples_unverified":2,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/gidn-a-lightweight-graph-inception-diffusion","title":"GIDN: A Lightweight Graph Inception Diffusion Network for High-efficient Link Prediction","date":"2022-10-04","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/path-aware-siamese-graph-neural-network-for","title":"Path-aware Siamese Graph Neural Network for Link Prediction","date":"2022-08-10","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/e2eg-end-to-end-node-classification-using","title":"E2EG: End-to-End Node Classification Using Graph Topology and Text-based Node Attributes","date":"2022-08-09","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":9,"samples_ran":3,"samples_unverified":6,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/autoweird-weird-translational-scoring","title":"AutoWeird: Weird Translational Scoring Function Identified by Random Search","date":"2022-07-24","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/simple-and-efficient-heterogeneous-graph","title":"Simple and Efficient Heterogeneous Graph Neural Network","date":"2022-07-06","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/graph-attention-multi-layer-perceptron-1","title":"Graph Attention Multi-Layer Perceptron","date":"2022-06-09","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/a-net-a-scalable-path-based-reasoning-1","title":"A*Net: A Scalable Path-based Reasoning Approach for Knowledge Graphs","date":"2022-06-07","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":7,"samples_ran":0,"samples_unverified":7,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/label-enhanced-graph-neural-network-for-semi","title":"Label-Enhanced Graph Neural Network for Semi-supervised Node Classification","date":"2022-05-31","rows_on_this_dataset":4,"code_links":1,"syntology":null},{"paper":"/paper/stargraph-a-coarse-to-fine-representation","title":"StarGraph: Knowledge Representation Learning based on Incomplete Two-hop Subgraph","date":"2022-05-27","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":6,"samples_ran":5,"samples_unverified":1,"pointer_only_for_licence":6,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/recipe-for-a-general-powerful-scalable-graph","title":"Recipe for a General, Powerful, Scalable Graph Transformer","date":"2022-05-25","rows_on_this_dataset":4,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":21,"samples_ran":3,"samples_unverified":18,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/gtnet-a-tree-based-deep-graph-learning","title":"GTNet: A Tree-Based Deep Graph Learning Architecture","date":"2022-04-27","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/trans-transition-based-knowledge-graph","title":"TranS: Transition-based Knowledge Graph Embedding with Synthetic Relation Representation","date":"2022-04-18","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/algorithm-and-system-co-design-for-efficient","title":"Algorithm and System Co-design for Efficient Subgraph-based Graph Representation Learning","date":"2022-02-28","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":4,"samples_ran":0,"samples_unverified":4,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/interht-knowledge-graph-embeddings-by","title":"InterHT: Knowledge Graph Embeddings by Interaction between Head and Tail Entities","date":"2022-02-10","rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/structure-aware-transformer-for-graph","title":"Structure-Aware Transformer for Graph Representation Learning","date":"2022-02-07","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":9,"samples_ran":4,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/dimensionality-reduction-meets-message","title":"Dimensionality Reduction Meets Message Passing for Graph Node Embeddings","date":"2022-02-01","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/interpretable-and-generalizable-graph","title":"Interpretable and Generalizable Graph Learning via Stochastic Attention Mechanism","date":"2022-01-31","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":10,"samples_ran":5,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/decoupling-the-depth-and-scope-of-graph-1","title":"Decoupling the Depth and Scope of Graph Neural Networks","date":"2022-01-19","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":2,"samples_ran":0,"samples_unverified":2,"pointer_only_for_licence":2,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/improving-the-training-of-graph-neural","title":"SCR: Training Graph Neural Networks with Consistency Regularization","date":"2021-12-08","rows_on_this_dataset":15,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":1,"samples_unverified":2,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/pairwise-learning-for-neural-link-prediction","title":"Pairwise Learning for Neural Link Prediction","date":"2021-12-06","rows_on_this_dataset":4,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":1,"samples_unverified":2,"pointer_only_for_licence":3,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/network-in-graph-neural-network","title":"Network In Graph Neural Network","date":"2021-11-23","rows_on_this_dataset":9,"code_links":0,"syntology":null},{"paper":"/paper/node-feature-extraction-by-self-supervised-1","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","date":"2021-10-29","rows_on_this_dataset":8,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":20,"samples_ran":6,"samples_unverified":14,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/vq-gnn-a-universal-framework-to-scale-up","title":"VQ-GNN: A Universal Framework to Scale up Graph Neural Networks using Vector Quantization","date":"2021-10-27","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/rot-pro-modeling-transitivity-by-projection","title":"Rot-Pro: Modeling Transitivity by Projection in Knowledge Graph Embedding","date":"2021-10-27","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/nested-graph-neural-networks","title":"Nested Graph Neural Networks","date":"2021-10-25","rows_on_this_dataset":5,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":2,"samples_ran":1,"samples_unverified":1,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/graph-less-neural-networks-teaching-old-mlps-1","title":"Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation","date":"2021-10-17","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":8,"samples_ran":5,"samples_unverified":3,"pointer_only_for_licence":8,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/from-stars-to-subgraphs-uplifting-any-gnn","title":"From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awareness","date":"2021-10-07","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":18,"samples_ran":4,"samples_unverified":14,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/relation-prediction-as-an-auxiliary-training","title":"Relation Prediction as an Auxiliary Training Objective for Improving Multi-Relational Graph Representations","date":"2021-10-06","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/edge-augmented-graph-transformers-global-self","title":"Global Self-Attention as a Replacement for Graph Convolution","date":"2021-08-07","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":4,"samples_ran":0,"samples_unverified":4,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/autosf-towards-automatic-scoring-function","title":"Bilinear Scoring Function Search for Knowledge Graph Learning","date":"2021-07-01","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/edge-proposal-sets-for-link-prediction","title":"Edge Proposal Sets for Link Prediction","date":"2021-06-30","rows_on_this_dataset":3,"code_links":2,"syntology":null},{"paper":"/paper/weisfeiler-and-lehman-go-cellular-cw-networks","title":"Weisfeiler and Lehman Go Cellular: CW Networks","date":"2021-06-23","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/nodepiece-compositional-and-parameter","title":"NodePiece: Compositional and Parameter-Efficient Representations of Large Knowledge Graphs","date":"2021-06-23","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":7,"samples_ran":0,"samples_unverified":7,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/distilling-self-knowledge-from-contrastive","title":"Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages","date":"2021-06-16","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":1,"samples_ran":0,"samples_unverified":1,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/training-graph-neural-networks-with-1000","title":"Training Graph Neural Networks with 1000 Layers","date":"2021-06-14","rows_on_this_dataset":5,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":11,"samples_ran":1,"samples_unverified":10,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/neural-bellman-ford-networks-a-general-graph","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","date":"2021-06-13","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":15,"samples_ran":2,"samples_unverified":13,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/do-transformers-really-perform-bad-for-graph","title":"Do Transformers Really Perform Bad for Graph Representation?","date":"2021-06-09","rows_on_this_dataset":5,"code_links":5,"syntology":null},{"paper":"/paper/counterfactual-graph-learning-for-link","title":"Learning from Counterfactual Links for Link Prediction","date":"2021-06-03","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":3,"samples_unverified":0,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/embedding-knowledge-graphs-attentive-to","title":"Embedding Knowledge Graphs Attentive to Positional and Centrality Qualities","date":"2021-06-01","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/how-attentive-are-graph-attention-networks","title":"How Attentive are Graph Attention Networks?","date":"2021-05-30","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":16,"samples_ran":6,"samples_unverified":10,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/heterogeneous-graph-representation-learning","title":"Heterogeneous Graph Representation Learning with Relation Awareness","date":"2021-05-24","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/distance-enhanced-graph-neural-network-for","title":"Distance-Enhanced Graph Neural Network for Link Prediction","date":"2021-05-20","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/residual-network-and-embedding-usage-new","title":"Residual Network and Embedding Usage: New Tricks of Node Classification with Graph Convolutional Networks","date":"2021-05-18","rows_on_this_dataset":3,"code_links":4,"syntology":null},{"paper":"/paper/improving-graph-neural-networks-with-simple","title":"Improving Graph Neural Networks with Simple Architecture Design","date":"2021-05-17","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/gipa-general-information-propagation","title":"GIPA: General Information Propagation Algorithm for Graph Learning","date":"2021-05-13","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/scalable-and-adaptive-graph-neural-networks","title":"Scalable and Adaptive Graph Neural Networks with Self-Label-Enhanced training","date":"2021-04-19","rows_on_this_dataset":8,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":6,"samples_ran":1,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/adaptive-filters-and-aggregator-fusion-for","title":"Do We Need Anisotropic Graph Neural Networks?","date":"2021-04-03","rows_on_this_dataset":8,"code_links":2,"syntology":null},{"paper":"/paper/parameterized-hypercomplex-graph-neural","title":"Parameterized Hypercomplex Graph Neural Networks for Graph Classification","date":"2021-03-30","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/ran-gnns-breaking-the-capacity-limits-of","title":"RAN-GNNs: breaking the capacity limits of graph neural networks","date":"2021-03-29","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/bag-of-tricks-of-semi-supervised","title":"Bag of Tricks for Node Classification with Graph Neural Networks","date":"2021-03-24","rows_on_this_dataset":6,"code_links":2,"syntology":null},{"paper":"/paper/molecular-representation-learning-by","title":"Molecular Representation Learning by Leveraging Chemical Information","date":"2021-03-15","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-learning-with-1d-convolutions-on-random","title":"Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing","date":"2021-02-17","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/memory-associated-differential-learning","title":"Memory-Associated Differential Learning","date":"2021-02-10","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/directed-acyclic-graph-neural-networks-1","title":"Directed Acyclic Graph Neural Networks","date":"2021-01-20","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/adaptive-graph-diffusion-networks-with-hop","title":"Adaptive Graph Diffusion Networks","date":"2020-12-30","rows_on_this_dataset":12,"code_links":1,"syntology":null},{"paper":"/paper/hybrid-micro-macro-level-convolution-for","title":"Hybrid Micro/Macro Level Convolution for Heterogeneous Graph Learning","date":"2020-12-29","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/breaking-the-expressive-bottlenecks-of-graph-1","title":"Breaking the Expressive Bottlenecks of Graph Neural Networks","date":"2020-12-14","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/robust-deep-auc-maximization-a-new-surrogate","title":"Large-scale Robust Deep AUC Maximization: A New Surrogate Loss and Empirical Studies on Medical Image Classification","date":"2020-12-06","rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/graph-convolutions-that-can-finally-model","title":"Graph convolutions that can finally model local structure","date":"2020-11-30","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/scalable-graph-neural-networks-for-1","title":"Scalable Graph Neural Networks for Heterogeneous Graphs","date":"2020-11-19","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/pairre-knowledge-graph-embeddings-via-paired","title":"PairRE: Knowledge Graph Embeddings via Paired Relation Vectors","date":"2020-11-07","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/revisiting-graph-neural-networks-for-link-1","title":"Labeling Trick: A Theory of Using Graph Neural Networks for Multi-Node Representation Learning","date":"2020-10-30","rows_on_this_dataset":5,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":7,"samples_ran":2,"samples_unverified":5,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/combining-label-propagation-and-simple-models-1","title":"Combining Label Propagation and Simple Models Out-performs Graph Neural Networks","date":"2020-10-27","rows_on_this_dataset":13,"code_links":7,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":5,"samples_ran":2,"samples_unverified":3,"pointer_only_for_licence":2,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/flag-adversarial-data-augmentation-for-graph-1","title":"Robust Optimization as Data Augmentation for Large-scale Graphs","date":"2020-10-19","rows_on_this_dataset":25,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":15,"samples_ran":3,"samples_unverified":12,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/directional-graph-networks-1","title":"Directional Graph Networks","date":"2020-10-06","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":14,"samples_ran":6,"samples_unverified":8,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/masked-label-prediction-unified-massage","title":"Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification","date":"2020-09-08","rows_on_this_dataset":7,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":7,"samples_ran":3,"samples_unverified":4,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/graphnorm-a-principled-approach-to","title":"GraphNorm: A Principled Approach to Accelerating Graph Neural Network Training","date":"2020-09-07","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":1,"samples_ran":1,"samples_unverified":0,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/towards-deeper-graph-neural-networks","title":"Towards Deeper Graph Neural Networks","date":"2020-07-18","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":3,"samples_unverified":0,"pointer_only_for_licence":3,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/simple-and-deep-graph-convolutional-networks-1","title":"Simple and Deep Graph Convolutional Networks","date":"2020-07-04","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":7,"samples_ran":5,"samples_unverified":2,"pointer_only_for_licence":4,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/hierarchical-inter-message-passing-for","title":"Hierarchical Inter-Message Passing for Learning on Molecular Graphs","date":"2020-06-22","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/wasserstein-embedding-for-graph-learning","title":"Wasserstein Embedding for Graph Learning","date":"2020-06-16","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/improving-graph-neural-network-expressivity","title":"Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting","date":"2020-06-16","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":4,"samples_ran":0,"samples_unverified":4,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/from-graph-low-rank-global-attention-to-2-fwl","title":"Global Attention Improves Graph Networks Generalization","date":"2020-06-14","rows_on_this_dataset":3,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":4,"samples_ran":4,"samples_unverified":0,"pointer_only_for_licence":4,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/deepergcn-all-you-need-to-train-deeper-gcns","title":"DeeperGCN: All You Need to Train Deeper GCNs","date":"2020-06-13","rows_on_this_dataset":8,"code_links":3,"syntology":null},{"paper":"/paper/bandit-samplers-for-training-graph-neural","title":"Bandit Samplers for Training Graph Neural Networks","date":"2020-06-10","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":8,"samples_ran":3,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/open-graph-benchmark-datasets-for-machine","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","date":"2020-05-02","rows_on_this_dataset":9,"code_links":21,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":17,"samples_ran":2,"samples_unverified":15,"pointer_only_for_licence":15,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/sign-scalable-inception-graph-neural-networks","title":"SIGN: Scalable Inception Graph Neural Networks","date":"2020-04-23","rows_on_this_dataset":5,"code_links":5,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":7,"samples_ran":2,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/principal-neighbourhood-aggregation-for-graph","title":"Principal Neighbourhood Aggregation for Graph Nets","date":"2020-04-12","rows_on_this_dataset":2,"code_links":8,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":55,"samples_ran":33,"samples_unverified":22,"pointer_only_for_licence":48,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/heterogeneous-graph-transformer","title":"Heterogeneous Graph Transformer","date":"2020-03-03","rows_on_this_dataset":2,"code_links":4,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":6,"samples_ran":1,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/graphsaint-graph-sampling-based-inductive","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","date":"2019-07-10","rows_on_this_dataset":5,"code_links":8,"syntology":null},{"paper":"/paper/a-persistent-weisfeilerlehman-procedure-for","title":"A Persistent Weisfeiler–Lehman Procedure for Graph Classification","date":"2019-06-09","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/cluster-gcn-an-efficient-algorithm-for","title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","date":"2019-05-20","rows_on_this_dataset":5,"code_links":6,"syntology":null},{"paper":"/paper/autokge-searching-scoring-functions-for","title":"AutoSF: Searching Scoring Functions for Knowledge Graph Embedding","date":"2019-04-26","rows_on_this_dataset":2,"code_links":3,"syntology":null},{"paper":"/paper/rotate-knowledge-graph-embedding-by","title":"RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space","date":"2019-02-26","rows_on_this_dataset":3,"code_links":10,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":5,"samples_ran":0,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/simplifying-graph-convolutional-networks","title":"Simplifying Graph Convolutional Networks","date":"2019-02-19","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":8,"samples_ran":3,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/how-powerful-are-graph-neural-networks","title":"How Powerful are Graph Neural Networks?","date":"2018-10-01","rows_on_this_dataset":8,"code_links":19,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":10,"samples_ran":3,"samples_unverified":7,"pointer_only_for_licence":5,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/hierarchical-graph-representation-learning","title":"Hierarchical Graph Representation Learning with Differentiable Pooling","date":"2018-06-22","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":20,"samples_ran":1,"samples_unverified":19,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/representation-learning-on-graphs-with","title":"Representation Learning on Graphs with Jumping Knowledge Networks","date":"2018-06-09","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":1,"samples_ran":0,"samples_unverified":1,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/gaan-gated-attention-networks-for-learning-on","title":"GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphs","date":"2018-03-20","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","rows_on_this_dataset":5,"code_links":93,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":106,"samples_ran":50,"samples_unverified":56,"pointer_only_for_licence":43,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/metapath2vec-scalable-representation-learning","title":"metapath2vec: Scalable Representation Learning for Heterogeneous Networks","date":"2017-08-01","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/inductive-representation-learning-on-large","title":"Inductive Representation Learning on Large Graphs","date":"2017-06-07","rows_on_this_dataset":15,"code_links":20,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":5,"samples_ran":3,"samples_unverified":2,"pointer_only_for_licence":5,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/modeling-relational-data-with-graph","title":"Modeling Relational Data with Graph Convolutional Networks","date":"2017-03-17","rows_on_this_dataset":2,"code_links":27,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":32,"samples_ran":10,"samples_unverified":22,"pointer_only_for_licence":15,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","rows_on_this_dataset":21,"code_links":55,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":58,"samples_ran":31,"samples_unverified":27,"pointer_only_for_licence":22,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/node2vec-scalable-feature-learning-for","title":"node2vec: Scalable Feature Learning for Networks","date":"2016-07-03","rows_on_this_dataset":8,"code_links":20,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":25,"samples_ran":8,"samples_unverified":17,"pointer_only_for_licence":3,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/convolutional-neural-networks-on-graphs-with","title":"Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering","date":"2016-06-30","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":6,"samples_ran":2,"samples_unverified":4,"pointer_only_for_licence":2,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/complex-embeddings-for-simple-link-prediction","title":"Complex Embeddings for Simple Link Prediction","date":"2016-06-20","rows_on_this_dataset":3,"code_links":9,"syntology":null},{"paper":"/paper/embedding-entities-and-relations-for-learning","title":"Embedding Entities and Relations for Learning and Inference in Knowledge Bases","date":"2014-12-20","rows_on_this_dataset":3,"code_links":10,"syntology":null},{"paper":"/paper/deepwalk-online-learning-of-social","title":"DeepWalk: Online Learning of Social Representations","date":"2014-03-26","rows_on_this_dataset":3,"code_links":14,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":2,"samples_unverified":1,"pointer_only_for_licence":1,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/on-the-effect-of-the-average-clustering","title":"On the effect of the average clustering coefficient on topology-based link prediction in featureless graphs","date":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/09010553","title":"Predicting Missing Links via Local Information","date":null,"rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":0,"samples_unverified":3,"pointer_only_for_licence":3,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}}],"syntology_totals":{"read_at":"2026-09-24T18:15:14+00:00","papers_with_samples":68,"samples_harvested":748,"samples_ran":291,"samples_unverified":457,"pointer_only_for_licence":234,"papers_with_no_sample_that_ran":13,"note":"the per-paper counts above, summed; not a rate"},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks."}