{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/dataset/ppi","name":"PPI","full_name":"Protein-Protein Interactions (PPI)","description_markdown":"protein roles—in terms of their cellular functions from\r\ngene ontology—in various protein-protein interaction (PPI) graphs, with each graph corresponding\r\nto a different human tissue [41]. positional gene sets are used, motif gene sets and immunological\r\nsignatures as features and gene ontology sets as labels (121 in total), collected from the Molecular\r\nSignatures Database [34]. The average graph contains 2373 nodes, with an average degree of 28.8.","description_withheld":null,"homepage":"http://snap.stanford.edu/graphsage/#datasets","introduced_date":"2017-06-07","introduced_date_note":null,"introduced_by":{"paper":"/paper/inductive-representation-learning-on-large","title":"Inductive Representation Learning on Large Graphs","first_author":"William L. Hamilton","url":null},"license":null,"modalities":[],"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"}],"languages":[],"variants":["PPI"],"data_loaders":[{"repo":"https://github.com/rusty1s/pytorch_geometric","url":"https://pytorch-geometric.readthedocs.io/en/latest/modules/datasets.html","frameworks":["pytorch"]},{"repo":"https://github.com/dmlc/dgl","url":"https://docs.dgl.ai/api/python/dgl.data.html#dgl.data.PPIDataset","frameworks":["pytorch","tf","mxnet"]},{"repo":"https://github.com/danielegrattarola/spektral","url":"https://graphneural.network/datasets/#ppi","frameworks":["tf"]}],"num_papers_in_archive":309,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/node-classification-on-ppi","task":"Node Classification","dataset_variant":"PPI","rows":24,"metrics":["F1","Micro-F1","Micro F1","Macro-F1"],"first_row_in_archive_order":{"model":"g2-MLP","paper":"/paper/a-proposal-of-multi-layer-perceptron-with","metrics":{"F1":"99.71"},"code_links":[{"title":"nnaakkaaii/g2-MLP","url":"https://github.com/nnaakkaaii/g2-MLP"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/link-prediction-on-ppi","task":"Link Prediction","dataset_variant":"PPI","rows":2,"metrics":["AP","AUC","Accuracy"],"first_row_in_archive_order":{"model":"PPPNE","paper":"/paper/pppne-personalized-proximity-preserved","metrics":{"AP":"84.1%","AUC":"82.7%"},"code_links":[]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":22,"of":22,"counts":{"papers_with_a_benchmark_row":22,"with_a_code_link":21,"where_syntology_ran_a_sample":12,"not_listed_spam_title":0,"listed":22,"listed_where_code_ran":12,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":11,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":11,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/the-split-matters-flat-minima-methods-for","slug":"the-split-matters-flat-minima-methods-for","title":"The Split Matters: Flat Minima Methods for Improving the Performance of GNNs","date":"2023-06-15","arxiv_id":"2306.09121","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/a-proposal-of-multi-layer-perceptron-with","slug":"a-proposal-of-multi-layer-perceptron-with","title":"A Proposal of Multi-Layer Perceptron with Graph Gating Unit for Graph Representation Learning and its Application to Surrogate Model for FEM","date":"2022-07-11","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-representation-learning-beyond-node-and","slug":"graph-representation-learning-beyond-node-and","title":"Graph Representation Learning Beyond Node and Homophily","date":"2022-03-03","arxiv_id":"2203.01564","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/pppne-personalized-proximity-preserved","slug":"pppne-personalized-proximity-preserved","title":"PPPNE: Personalized proximity preserved network embedding","date":"2022-02-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/vq-gnn-a-universal-framework-to-scale-up","slug":"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","arxiv_id":"2110.14363","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/simple-and-deep-graph-convolutional-networks-1","slug":"simple-and-deep-graph-convolutional-networks-1","title":"Simple and Deep Graph Convolutional Networks","date":"2020-07-04","arxiv_id":"2007.02133","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":5,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":4,"official":{"repos":["chennnM/GCNII"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["found_in_text","listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/simple-and-deep-graph-convolutional-networks-1#ran","syntology_url":"https://syntology.ai/paper/2007.02133","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02133"}}}},{"paper":"/paper/deep-graph-contrastive-representation","slug":"deep-graph-contrastive-representation","title":"Deep Graph Contrastive Representation Learning","date":"2020-06-07","arxiv_id":"2006.04131","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["CRIPAC-DIG/GRACE"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deep-graph-contrastive-representation#ran","syntology_url":"https://syntology.ai/paper/2006.04131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04131"}}}},{"paper":"/paper/sign-scalable-inception-graph-neural-networks","slug":"sign-scalable-inception-graph-neural-networks","title":"SIGN: Scalable Inception Graph Neural Networks","date":"2020-04-23","arxiv_id":"2004.11198","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["twitter-research/sign"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/sign-scalable-inception-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2004.11198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11198"}}}},{"paper":"/paper/bridging-the-gap-between-spectral-and-spatial","slug":"bridging-the-gap-between-spectral-and-spatial","title":"Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks","date":"2020-03-26","arxiv_id":"2003.11702","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/sgas-sequential-greedy-architecture-search","slug":"sgas-sequential-greedy-architecture-search","title":"SGAS: Sequential Greedy Architecture Search","date":"2019-11-30","arxiv_id":"1912.00195","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":4,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/sgas-sequential-greedy-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1912.00195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.00195"}}}},{"paper":"/paper/hyperbolic-graph-convolutional-neural","slug":"hyperbolic-graph-convolutional-neural","title":"Hyperbolic Graph Convolutional Neural Networks","date":"2019-10-28","arxiv_id":"1910.12933","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hyperbolic-graph-convolutional-neural#ran","syntology_url":"https://syntology.ai/paper/1910.12933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.12933"}}}},{"paper":"/paper/deepgcns-making-gcns-go-as-deep-as-cnns","slug":"deepgcns-making-gcns-go-as-deep-as-cnns","title":"DeepGCNs: Making GCNs Go as Deep as CNNs","date":"2019-10-15","arxiv_id":"1910.06849","rows_on_this_dataset":2,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":1,"official":{"repos":["lightaime/deep_gcns_torch","lightaime/deep_gcns"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deepgcns-making-gcns-go-as-deep-as-cnns#ran","syntology_url":"https://syntology.ai/paper/1910.06849","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.06849"}}}},{"paper":"/paper/graphsaint-graph-sampling-based-inductive","slug":"graphsaint-graph-sampling-based-inductive","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","date":"2019-07-10","arxiv_id":"1907.04931","rows_on_this_dataset":1,"code_links":8,"syntology":null},{"paper":"/paper/graph-star-net-for-generalized-multi-task-1","slug":"graph-star-net-for-generalized-multi-task-1","title":"Graph Star Net for Generalized Multi-Task Learning","date":"2019-06-21","arxiv_id":"1906.12330","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-star-net-for-generalized-multi-task-1#ran","syntology_url":"https://syntology.ai/paper/1906.12330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12330"}}}},{"paper":"/paper/cluster-gcn-an-efficient-algorithm-for","slug":"cluster-gcn-an-efficient-algorithm-for","title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","date":"2019-05-20","arxiv_id":"1905.07953","rows_on_this_dataset":2,"code_links":6,"syntology":null},{"paper":"/paper/graphnas-graph-neural-architecture-search","slug":"graphnas-graph-neural-architecture-search","title":"GraphNAS: Graph Neural Architecture Search with Reinforcement Learning","date":"2019-04-22","arxiv_id":"1904.09981","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["GraphNAS/GraphNAS-simple"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graphnas-graph-neural-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1904.09981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09981"}}}},{"paper":"/paper/large-scale-learnable-graph-convolutional","slug":"large-scale-learnable-graph-convolutional","title":"Large-Scale Learnable Graph Convolutional Networks","date":"2018-08-12","arxiv_id":"1808.03965","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/representation-learning-on-graphs-with","slug":"representation-learning-on-graphs-with","title":"Representation Learning on Graphs with Jumping Knowledge Networks","date":"2018-06-09","arxiv_id":"1806.03536","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/representation-learning-on-graphs-with#ran","syntology_url":"https://syntology.ai/paper/1806.03536","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.03536"}}}},{"paper":"/paper/gaan-gated-attention-networks-for-learning-on","slug":"gaan-gated-attention-networks-for-learning-on","title":"GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphs","date":"2018-03-20","arxiv_id":"1803.07294","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","rows_on_this_dataset":1,"code_links":93,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":106,"samples_ran":61,"samples_constructed":28,"samples_ran_checked":52,"samples_ran_instrument_failed":9,"samples_unverified":45,"pointer_only_for_licence":46,"official":{"repos":["PetarV-/GAT"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/1710.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10903"}}}},{"paper":"/paper/inductive-representation-learning-on-large","slug":"inductive-representation-learning-on-large","title":"Inductive Representation Learning on Large Graphs","date":"2017-06-07","arxiv_id":"1706.02216","rows_on_this_dataset":1,"code_links":20,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":2,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":5,"official":{"repos":["williamleif/GraphSAGE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/inductive-representation-learning-on-large#ran","syntology_url":"https://syntology.ai/paper/1706.02216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.02216"}}}},{"paper":"/paper/node2vec-scalable-feature-learning-for","slug":"node2vec-scalable-feature-learning-for","title":"node2vec: Scalable Feature Learning for Networks","date":"2016-07-03","arxiv_id":"1607.00653","rows_on_this_dataset":2,"code_links":20,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":25,"samples_ran":15,"samples_constructed":2,"samples_ran_checked":12,"samples_ran_instrument_failed":3,"samples_unverified":10,"pointer_only_for_licence":3,"official":{"repos":["aditya-grover/node2vec"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/node2vec-scalable-feature-learning-for#ran","syntology_url":"https://syntology.ai/paper/1607.00653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.00653"}}}}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/the-split-matters-flat-minima-methods-for","slug":"the-split-matters-flat-minima-methods-for","title":"The Split Matters: Flat Minima Methods for Improving the Performance of GNNs","date":"2023-06-15","arxiv_id":"2306.09121","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/a-proposal-of-multi-layer-perceptron-with","slug":"a-proposal-of-multi-layer-perceptron-with","title":"A Proposal of Multi-Layer Perceptron with Graph Gating Unit for Graph Representation Learning and its Application to Surrogate Model for FEM","date":"2022-07-11","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-representation-learning-beyond-node-and","slug":"graph-representation-learning-beyond-node-and","title":"Graph Representation Learning Beyond Node and Homophily","date":"2022-03-03","arxiv_id":"2203.01564","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/pppne-personalized-proximity-preserved","slug":"pppne-personalized-proximity-preserved","title":"PPPNE: Personalized proximity preserved network embedding","date":"2022-02-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/vq-gnn-a-universal-framework-to-scale-up","slug":"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","arxiv_id":"2110.14363","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/simple-and-deep-graph-convolutional-networks-1","slug":"simple-and-deep-graph-convolutional-networks-1","title":"Simple and Deep Graph Convolutional Networks","date":"2020-07-04","arxiv_id":"2007.02133","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":5,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":4,"official":{"repos":["chennnM/GCNII"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["found_in_text","listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/simple-and-deep-graph-convolutional-networks-1#ran","syntology_url":"https://syntology.ai/paper/2007.02133","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02133"}}}},{"paper":"/paper/deep-graph-contrastive-representation","slug":"deep-graph-contrastive-representation","title":"Deep Graph Contrastive Representation Learning","date":"2020-06-07","arxiv_id":"2006.04131","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["CRIPAC-DIG/GRACE"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deep-graph-contrastive-representation#ran","syntology_url":"https://syntology.ai/paper/2006.04131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04131"}}}},{"paper":"/paper/sign-scalable-inception-graph-neural-networks","slug":"sign-scalable-inception-graph-neural-networks","title":"SIGN: Scalable Inception Graph Neural Networks","date":"2020-04-23","arxiv_id":"2004.11198","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["twitter-research/sign"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/sign-scalable-inception-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2004.11198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.11198"}}}},{"paper":"/paper/bridging-the-gap-between-spectral-and-spatial","slug":"bridging-the-gap-between-spectral-and-spatial","title":"Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks","date":"2020-03-26","arxiv_id":"2003.11702","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/sgas-sequential-greedy-architecture-search","slug":"sgas-sequential-greedy-architecture-search","title":"SGAS: Sequential Greedy Architecture Search","date":"2019-11-30","arxiv_id":"1912.00195","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":4,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/sgas-sequential-greedy-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1912.00195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.00195"}}}},{"paper":"/paper/hyperbolic-graph-convolutional-neural","slug":"hyperbolic-graph-convolutional-neural","title":"Hyperbolic Graph Convolutional Neural Networks","date":"2019-10-28","arxiv_id":"1910.12933","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hyperbolic-graph-convolutional-neural#ran","syntology_url":"https://syntology.ai/paper/1910.12933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.12933"}}}},{"paper":"/paper/deepgcns-making-gcns-go-as-deep-as-cnns","slug":"deepgcns-making-gcns-go-as-deep-as-cnns","title":"DeepGCNs: Making GCNs Go as Deep as CNNs","date":"2019-10-15","arxiv_id":"1910.06849","rows_on_this_dataset":2,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":1,"official":{"repos":["lightaime/deep_gcns_torch","lightaime/deep_gcns"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deepgcns-making-gcns-go-as-deep-as-cnns#ran","syntology_url":"https://syntology.ai/paper/1910.06849","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.06849"}}}},{"paper":"/paper/graphsaint-graph-sampling-based-inductive","slug":"graphsaint-graph-sampling-based-inductive","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","date":"2019-07-10","arxiv_id":"1907.04931","rows_on_this_dataset":1,"code_links":8,"syntology":null},{"paper":"/paper/graph-star-net-for-generalized-multi-task-1","slug":"graph-star-net-for-generalized-multi-task-1","title":"Graph Star Net for Generalized Multi-Task Learning","date":"2019-06-21","arxiv_id":"1906.12330","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-star-net-for-generalized-multi-task-1#ran","syntology_url":"https://syntology.ai/paper/1906.12330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.12330"}}}},{"paper":"/paper/cluster-gcn-an-efficient-algorithm-for","slug":"cluster-gcn-an-efficient-algorithm-for","title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","date":"2019-05-20","arxiv_id":"1905.07953","rows_on_this_dataset":2,"code_links":6,"syntology":null},{"paper":"/paper/graphnas-graph-neural-architecture-search","slug":"graphnas-graph-neural-architecture-search","title":"GraphNAS: Graph Neural Architecture Search with Reinforcement Learning","date":"2019-04-22","arxiv_id":"1904.09981","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["GraphNAS/GraphNAS-simple"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graphnas-graph-neural-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1904.09981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09981"}}}},{"paper":"/paper/large-scale-learnable-graph-convolutional","slug":"large-scale-learnable-graph-convolutional","title":"Large-Scale Learnable Graph Convolutional Networks","date":"2018-08-12","arxiv_id":"1808.03965","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/representation-learning-on-graphs-with","slug":"representation-learning-on-graphs-with","title":"Representation Learning on Graphs with Jumping Knowledge Networks","date":"2018-06-09","arxiv_id":"1806.03536","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/representation-learning-on-graphs-with#ran","syntology_url":"https://syntology.ai/paper/1806.03536","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.03536"}}}},{"paper":"/paper/gaan-gated-attention-networks-for-learning-on","slug":"gaan-gated-attention-networks-for-learning-on","title":"GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphs","date":"2018-03-20","arxiv_id":"1803.07294","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","rows_on_this_dataset":1,"code_links":93,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":106,"samples_ran":61,"samples_constructed":28,"samples_ran_checked":52,"samples_ran_instrument_failed":9,"samples_unverified":45,"pointer_only_for_licence":46,"official":{"repos":["PetarV-/GAT"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/1710.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10903"}}}},{"paper":"/paper/inductive-representation-learning-on-large","slug":"inductive-representation-learning-on-large","title":"Inductive Representation Learning on Large Graphs","date":"2017-06-07","arxiv_id":"1706.02216","rows_on_this_dataset":1,"code_links":20,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":2,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":5,"official":{"repos":["williamleif/GraphSAGE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/inductive-representation-learning-on-large#ran","syntology_url":"https://syntology.ai/paper/1706.02216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.02216"}}}},{"paper":"/paper/node2vec-scalable-feature-learning-for","slug":"node2vec-scalable-feature-learning-for","title":"node2vec: Scalable Feature Learning for Networks","date":"2016-07-03","arxiv_id":"1607.00653","rows_on_this_dataset":2,"code_links":20,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":25,"samples_ran":15,"samples_constructed":2,"samples_ran_checked":12,"samples_ran_instrument_failed":3,"samples_unverified":10,"pointer_only_for_licence":3,"official":{"repos":["aditya-grover/node2vec"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/node2vec-scalable-feature-learning-for#ran","syntology_url":"https://syntology.ai/paper/1607.00653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.00653"}}}}],"papers_where_code_ran":12,"papers_where_code_ran_first_page":"/dataset/ppi/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/ppi/papers/ran/1","json":"/dataset/ppi/papers/ran/1.json","rows":12}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":12,"samples_harvested":185,"samples_ran":107,"samples_constructed":37,"samples_ran_checked":90,"samples_ran_instrument_failed":17,"samples_unverified":78,"pointer_only_for_licence":68,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":12,"papers_with_a_run_with_no_instrument_failure":11,"papers_where_every_run_was_an_instrument_failure":1,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":1,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/node-classification-on-ppi","since_archive":"/sota/node-classification-on-ppi#since-judged","papers_judged":1,"placed":0}]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"a4d26312d0e169c06124497abc3fa73a69652f451e43613d398cac5761cc626d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}