{"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/nci1","name":"NCI1","full_name":null,"description_markdown":"The **NCI1** dataset comes from the cheminformatics domain, where each input graph is used as representation of a chemical compound: each vertex stands for an atom of the molecule, and edges between vertices represent bonds between atoms. This dataset is relative to anti-cancer screens where the chemicals are assessed as positive or negative to cell lung cancer. Each vertex has an input label representing the corresponding atom type, encoded by a one-hot-encoding scheme into a vector of 0/1 elements.\r\n\r\nSource: [Ring Reservoir Neural Networks for Graphs](https://arxiv.org/abs/2005.05294)","description_withheld":null,"homepage":"https://ls11-www.cs.tu-dortmund.de/staff/morris/graphkerneldatasets","introduced_date":"2006-01-01","introduced_date_note":null,"introduced_by":{"paper":null,"title":"Comparison of descriptor spaces for chemical compound retrieval and classification","first_author":null,"url":"https://doi.org/10.1109/ICDM.2006.39"},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Graphs","url":"/datasets/modality/graphs"}],"tasks":[{"name":"Graph Classification","url":"/task/graph-classification","datasets_with_task":"/datasets/task/graph-classification"}],"languages":[{"name":"Chinese","url":"/datasets/language/chinese"}],"variants":["NCI1","NCI-123"],"data_loaders":[{"repo":"https://github.com/dmlc/dgl","url":"https://docs.dgl.ai/api/python/dgl.data.html#dgl.data.TUDataset","frameworks":["pytorch","tf","mxnet"]},{"repo":"https://github.com/danielegrattarola/spektral","url":"https://graphneural.network/datasets/#tudataset","frameworks":["tf"]}],"num_papers_in_archive":260,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/graph-classification-on-nci1","task":"Graph Classification","dataset_variant":"NCI1","rows":69,"metrics":["Accuracy","Accuracy (10-fold)"],"first_row_in_archive_order":{"model":"TFGW ADJ (L=2)","paper":"/paper/template-based-graph-neural-network-with","metrics":{"Accuracy":"88.1%"},"code_links":[{"title":"cedricvincentcuaz/TFGW","url":"https://github.com/cedricvincentcuaz/TFGW"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/graph-classification-on-nci-123","task":"Graph Classification","dataset_variant":"NCI-123","rows":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"GAM","paper":"/paper/graph-classification-using-structural","metrics":{"Accuracy":"64.79%"},"code_links":[{"title":"benedekrozemberczki/GAM","url":"https://github.com/benedekrozemberczki/GAM"}]},"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":62,"of":62,"counts":{"papers_with_a_benchmark_row":62,"with_a_code_link":53,"where_syntology_ran_a_sample":18,"not_listed_spam_title":0,"listed":62,"listed_where_code_ran":18,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":17,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":17,"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/pre-training-graph-neural-networks-on","slug":"pre-training-graph-neural-networks-on","title":"Pre-training Graph Neural Networks on Molecules by Using Subgraph-Conditioned Graph Information Bottleneck","date":"2025-02-20","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/multi-hop-attention-based-graph-pooling-a","slug":"multi-hop-attention-based-graph-pooling-a","title":"Multi-hop Attention-based Graph Pooling: A Personalized PageRank Perspective","date":"2024-03-04","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/masked-attention-is-all-you-need-for-graphs","slug":"masked-attention-is-all-you-need-for-graphs","title":"An end-to-end attention-based approach for learning on graphs","date":"2024-02-16","arxiv_id":"2402.10793","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-isomorphism-unet","slug":"graph-isomorphism-unet","title":"Graph isomorphism UNet","date":"2023-08-23","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/transitivity-preserving-graph-representation","slug":"transitivity-preserving-graph-representation","title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","date":"2023-08-18","arxiv_id":"2308.09517","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":26,"samples_ran":19,"samples_constructed":0,"samples_ran_checked":13,"samples_ran_instrument_failed":6,"samples_unverified":7,"pointer_only_for_licence":0,"official":{"repos":["nslab-cuk/unified-graph-transformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/transitivity-preserving-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2308.09517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09517"}}}},{"paper":"/paper/generalizing-topological-graph-neural","slug":"generalizing-topological-graph-neural","title":"Weisfeiler and Lehman Go Paths: Learning Topological Features via Path Complexes","date":"2023-08-13","arxiv_id":"2308.06838","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/cin-enhancing-topological-message-passing","slug":"cin-enhancing-topological-message-passing","title":"CIN++: Enhancing Topological Message Passing","date":"2023-06-06","arxiv_id":"2306.03561","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/strengthening-structural-baselines-for-graph","slug":"strengthening-structural-baselines-for-graph","title":"Strengthening structural baselines for graph classification using Local Topological Profile","date":"2023-05-01","arxiv_id":"2305.00724","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/cell-attention-networks","slug":"cell-attention-networks","title":"Cell Attention Networks","date":"2022-09-16","arxiv_id":"2209.08179","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["lrnzgiusti/can"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/cell-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2209.08179","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.08179"}}}},{"paper":"/paper/graph-trees-with-attention","slug":"graph-trees-with-attention","title":"TREE-G: Decision Trees Contesting Graph Neural Networks","date":"2022-07-06","arxiv_id":"2207.02760","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["mayabechlerspeicher/tree-g"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-trees-with-attention#ran","syntology_url":"https://syntology.ai/paper/2207.02760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02760"}}}},{"paper":"/paper/pure-transformers-are-powerful-graph-learners","slug":"pure-transformers-are-powerful-graph-learners","title":"Pure Transformers are Powerful Graph Learners","date":"2022-07-06","arxiv_id":"2207.02505","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":7,"official":{"repos":["jw9730/tokengt"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/pure-transformers-are-powerful-graph-learners#ran","syntology_url":"https://syntology.ai/paper/2207.02505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02505"}}}},{"paper":"/paper/template-based-graph-neural-network-with","slug":"template-based-graph-neural-network-with","title":"Template based Graph Neural Network with Optimal Transport Distances","date":"2022-05-31","arxiv_id":"2205.15733","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/recipe-for-a-general-powerful-scalable-graph","slug":"recipe-for-a-general-powerful-scalable-graph","title":"Recipe for a General, Powerful, Scalable Graph Transformer","date":"2022-05-25","arxiv_id":"2205.12454","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":21,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":18,"pointer_only_for_licence":0,"official":{"repos":["rampasek/GraphGPS"],"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/recipe-for-a-general-powerful-scalable-graph#ran","syntology_url":"https://syntology.ai/paper/2205.12454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12454"}}}},{"paper":"/paper/relational-reasoning-over-spatial-temporal","slug":"relational-reasoning-over-spatial-temporal","title":"Relational Reasoning Over Spatial-Temporal Graphs for Video Summarization","date":"2022-04-06","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/improving-spectral-graph-convolution-for","slug":"improving-spectral-graph-convolution-for","title":"A New Perspective on the Effects of Spectrum in Graph Neural Networks","date":"2021-12-14","arxiv_id":"2112.07160","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["qslim/gnn-spectrum"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/improving-spectral-graph-convolution-for#ran","syntology_url":"https://syntology.ai/paper/2112.07160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.07160"}}}},{"paper":"/paper/dropgnn-random-dropouts-increase-the","slug":"dropgnn-random-dropouts-increase-the","title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","date":"2021-11-11","arxiv_id":"2111.06283","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["karolismart/dropgnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dropgnn-random-dropouts-increase-the#ran","syntology_url":"https://syntology.ai/paper/2111.06283","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06283"}}}},{"paper":"/paper/fea2fea-exploring-structural-feature","slug":"fea2fea-exploring-structural-feature","title":"Fea2Fea: Exploring Structural Feature Correlations via Graph Neural Networks","date":"2021-06-24","arxiv_id":"2106.13061","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/do-transformers-really-perform-bad-for-graph","slug":"do-transformers-really-perform-bad-for-graph","title":"Do Transformers Really Perform Bad for Graph Representation?","date":"2021-06-09","arxiv_id":"2106.05234","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/relation-order-histograms-as-a-network","slug":"relation-order-histograms-as-a-network","title":"Relation order histograms as a network embedding tool","date":"2021-06-09","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/how-attentive-are-graph-attention-networks","slug":"how-attentive-are-graph-attention-networks","title":"How Attentive are Graph Attention Networks?","date":"2021-05-30","arxiv_id":"2105.14491","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":16,"samples_ran":11,"samples_constructed":1,"samples_ran_checked":10,"samples_ran_instrument_failed":1,"samples_unverified":5,"pointer_only_for_licence":1,"official":{"repos":["tech-srl/how_attentive_are_gats"],"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/how-attentive-are-graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2105.14491","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14491"}}}},{"paper":"/paper/a-novel-higher-order-weisfeiler-lehman-graph","slug":"a-novel-higher-order-weisfeiler-lehman-graph","title":"A Novel Higher-order Weisfeiler-Lehman Graph Convolution","date":"2020-07-01","arxiv_id":"2007.00346","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/wasserstein-embedding-for-graph-learning","slug":"wasserstein-embedding-for-graph-learning","title":"Wasserstein Embedding for Graph Learning","date":"2020-06-16","arxiv_id":"2006.09430","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/principal-neighbourhood-aggregation-for-graph","slug":"principal-neighbourhood-aggregation-for-graph","title":"Principal Neighbourhood Aggregation for Graph Nets","date":"2020-04-12","arxiv_id":"2004.05718","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":55,"samples_ran":33,"samples_constructed":4,"samples_ran_checked":11,"samples_ran_instrument_failed":22,"samples_unverified":22,"pointer_only_for_licence":48,"official":{"repos":["lukecavabarrett/pna"],"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/principal-neighbourhood-aggregation-for-graph#ran","syntology_url":"https://syntology.ai/paper/2004.05718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05718"}}}},{"paper":"/paper/a-fair-comparison-of-graph-neural-networks-1","slug":"a-fair-comparison-of-graph-neural-networks-1","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","date":"2019-12-20","arxiv_id":"1912.09893","rows_on_this_dataset":2,"code_links":5,"syntology":null},{"paper":"/paper/asap-adaptive-structure-aware-pooling-for","slug":"asap-adaptive-structure-aware-pooling-for","title":"ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph Representations","date":"2019-11-18","arxiv_id":"1911.07979","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/hierarchical-graph-pooling-with-structure","slug":"hierarchical-graph-pooling-with-structure","title":"Hierarchical Graph Pooling with Structure Learning","date":"2019-11-14","arxiv_id":"1911.05954","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/hierarchical-representation-learning-in-graph","slug":"hierarchical-representation-learning-in-graph","title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","date":"2019-10-24","arxiv_id":"1910.11436","rows_on_this_dataset":1,"code_links":1,"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":1,"official":{"repos":["danielegrattarola/decimation-pooling"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hierarchical-representation-learning-in-graph#ran","syntology_url":"https://syntology.ai/paper/1910.11436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11436"}}}},{"paper":"/paper/a-non-negative-factorization-approach-to-node","slug":"a-non-negative-factorization-approach-to-node","title":"A Non-Negative Factorization approach to node pooling in Graph Convolutional Neural Networks","date":"2019-09-07","arxiv_id":"1909.03287","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/improving-attention-mechanism-in-graph-neural","slug":"improving-attention-mechanism-in-graph-neural","title":"Improving Attention Mechanism in Graph Neural Networks via Cardinality Preservation","date":"2019-07-04","arxiv_id":"1907.02204","rows_on_this_dataset":1,"code_links":1,"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":{"repos":["zetayue/CPA"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/improving-attention-mechanism-in-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1907.02204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.02204"}}}},{"paper":"/paper/wasserstein-weisfeiler-lehman-graph-kernels","slug":"wasserstein-weisfeiler-lehman-graph-kernels","title":"Wasserstein Weisfeiler-Lehman Graph Kernels","date":"2019-06-04","arxiv_id":"1906.01277","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":6,"pointer_only_for_licence":0,"official":{"repos":["BorgwardtLab/WWL"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/wasserstein-weisfeiler-lehman-graph-kernels#ran","syntology_url":"https://syntology.ai/paper/1906.01277","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01277"}}}},{"paper":"/paper/provably-powerful-graph-networks","slug":"provably-powerful-graph-networks","title":"Provably Powerful Graph Networks","date":"2019-05-27","arxiv_id":"1905.11136","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/provably-powerful-graph-networks#ran","syntology_url":"https://syntology.ai/paper/1905.11136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11136"}}}},{"paper":"/paper/neighborhood-enlargement-in-graph-neural","slug":"neighborhood-enlargement-in-graph-neural","title":"Mutual Information Maximization in Graph Neural Networks","date":"2019-05-21","arxiv_id":"1905.08509","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/dissecting-graph-neural-networks-on-graph","slug":"dissecting-graph-neural-networks-on-graph","title":"Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification","date":"2019-05-11","arxiv_id":"1905.04579","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/capsule-graph-neural-network","slug":"capsule-graph-neural-network","title":"Capsule Graph Neural Network","date":"2019-05-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-kernels-a-survey","slug":"graph-kernels-a-survey","title":"Graph Kernels: A Survey","date":"2019-04-27","arxiv_id":"1904.12218","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/ddgk-learning-graph-representations-for-deep","slug":"ddgk-learning-graph-representations-for-deep","title":"DDGK: Learning Graph Representations for Deep Divergence Graph Kernels","date":"2019-04-21","arxiv_id":"1904.09671","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/self-attention-graph-pooling","slug":"self-attention-graph-pooling","title":"Self-Attention Graph Pooling","date":"2019-04-17","arxiv_id":"1904.08082","rows_on_this_dataset":2,"code_links":3,"syntology":null},{"paper":"/paper/spi-gcn-a-simple-permutation-invariant-graph","slug":"spi-gcn-a-simple-permutation-invariant-graph","title":"SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network","date":"2019-04-08","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/dagcn-dual-attention-graph-convolutional","slug":"dagcn-dual-attention-graph-convolutional","title":"DAGCN: Dual Attention Graph Convolutional Networks","date":"2019-04-04","arxiv_id":"1904.02278","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/towards-a-practical-k-dimensional-weisfeiler","slug":"towards-a-practical-k-dimensional-weisfeiler","title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","date":"2019-04-02","arxiv_id":"1904.01543","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["chrsmrrs/sparsewl"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/towards-a-practical-k-dimensional-weisfeiler#ran","syntology_url":"https://syntology.ai/paper/1904.01543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01543"}}}},{"paper":"/paper/subgraph-networks-with-application-to","slug":"subgraph-networks-with-application-to","title":"Subgraph Networks with Application to Structural Feature Space Expansion","date":"2019-03-21","arxiv_id":"1903.09022","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/capsule-neural-networks-for-graph","slug":"capsule-neural-networks-for-graph","title":"Capsule Neural Networks for Graph Classification using Explicit Tensorial Graph Representations","date":"2019-02-22","arxiv_id":"1902.08399","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/graph-classification-with-recurrent","slug":"graph-classification-with-recurrent","title":"Variational Recurrent Neural Networks for Graph Classification","date":"2019-02-07","arxiv_id":"1902.02721","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/propagation-kernels-efficient-graph-kernels","slug":"propagation-kernels-efficient-graph-kernels","title":"Propagation kernels: efficient graph kernels from propagated information","date":"2019-02-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/spectral-multigraph-networks-for-discovering","slug":"spectral-multigraph-networks-for-discovering","title":"Spectral Multigraph Networks for Discovering and Fusing Relationships in Molecules","date":"2018-11-23","arxiv_id":"1811.09595","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/gaussian-induced-convolution-for-graphs","slug":"gaussian-induced-convolution-for-graphs","title":"Gaussian-Induced Convolution for Graphs","date":"2018-11-11","arxiv_id":"1811.04393","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-simple-yet-effective-baseline-for-non","slug":"a-simple-yet-effective-baseline-for-non","title":"A simple yet effective baseline for non-attributed graph classification","date":"2018-11-08","arxiv_id":"1811.03508","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/a-simple-baseline-algorithm-for-graph","slug":"a-simple-baseline-algorithm-for-graph","title":"A Simple Baseline Algorithm for Graph Classification","date":"2018-10-22","arxiv_id":"1810.09155","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/weisfeiler-and-leman-go-neural-higher-order","slug":"weisfeiler-and-leman-go-neural-higher-order","title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","date":"2018-10-04","arxiv_id":"1810.02244","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/how-powerful-are-graph-neural-networks","slug":"how-powerful-are-graph-neural-networks","title":"How Powerful are Graph Neural Networks?","date":"2018-10-01","arxiv_id":"1810.00826","rows_on_this_dataset":2,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":6,"samples_constructed":2,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":5,"official":{"repos":["weihua916/powerful-gnns"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/how-powerful-are-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1810.00826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.00826"}}}},{"paper":"/paper/graph-classification-using-structural","slug":"graph-classification-using-structural","title":"Graph Classification using Structural Attention","date":"2018-07-19","arxiv_id":null,"rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/optimal-transport-for-structured-data-with","slug":"optimal-transport-for-structured-data-with","title":"Optimal Transport for structured data with application on graphs","date":"2018-05-23","arxiv_id":"1805.09114","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/optimal-transport-for-structured-data-with#ran","syntology_url":"https://syntology.ai/paper/1805.09114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09114"}}}},{"paper":"/paper/graph-capsule-convolutional-neural-networks","slug":"graph-capsule-convolutional-neural-networks","title":"Graph Capsule Convolutional Neural Networks","date":"2018-05-21","arxiv_id":"1805.08090","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/an-end-to-end-deep-learning-architecture-for","slug":"an-end-to-end-deep-learning-architecture-for","title":"An End-to-End Deep Learning Architecture for Graph Classification","date":"2018-04-29","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"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/learning-universal-adversarial-perturbations","slug":"learning-universal-adversarial-perturbations","title":"Learning Universal Adversarial Perturbations with Generative Models","date":"2017-08-17","arxiv_id":"1708.05207","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph2vec-learning-distributed","slug":"graph2vec-learning-distributed","title":"graph2vec: Learning Distributed Representations of Graphs","date":"2017-07-17","arxiv_id":"1707.05005","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph2vec-learning-distributed#ran","syntology_url":"https://syntology.ai/paper/1707.05005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.05005"}}}},{"paper":"/paper/dynamic-edge-conditioned-filters-in","slug":"dynamic-edge-conditioned-filters-in","title":"Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs","date":"2017-04-10","arxiv_id":"1704.02901","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["mys007/ecc"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dynamic-edge-conditioned-filters-in#ran","syntology_url":"https://syntology.ai/paper/1704.02901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.02901"}}}},{"paper":"/paper/semi-supervised-classification-with-graph","slug":"semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","arxiv_id":"1609.02907","rows_on_this_dataset":1,"code_links":55,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":58,"samples_ran":39,"samples_constructed":13,"samples_ran_checked":34,"samples_ran_instrument_failed":5,"samples_unverified":19,"pointer_only_for_licence":23,"official":{"repos":["tkipf/pygcn"],"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/semi-supervised-classification-with-graph#ran","syntology_url":"https://syntology.ai/paper/1609.02907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.02907"}}}},{"paper":"/paper/on-valid-optimal-assignment-kernels-and","slug":"on-valid-optimal-assignment-kernels-and","title":"On Valid Optimal Assignment Kernels and Applications to Graph Classification","date":"2016-06-03","arxiv_id":"1606.01141","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/learning-convolutional-neural-networks-for","slug":"learning-convolutional-neural-networks-for","title":"Learning Convolutional Neural Networks for Graphs","date":"2016-05-17","arxiv_id":"1605.05273","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/learning-metrics-for-persistence-based-2","slug":"learning-metrics-for-persistence-based-2","title":"Learning metrics for persistence-based summaries and applications for graph classification","date":null,"arxiv_id":"1904.12189","rows_on_this_dataset":1,"code_links":1,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/pre-training-graph-neural-networks-on","slug":"pre-training-graph-neural-networks-on","title":"Pre-training Graph Neural Networks on Molecules by Using Subgraph-Conditioned Graph Information Bottleneck","date":"2025-02-20","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/multi-hop-attention-based-graph-pooling-a","slug":"multi-hop-attention-based-graph-pooling-a","title":"Multi-hop Attention-based Graph Pooling: A Personalized PageRank Perspective","date":"2024-03-04","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/masked-attention-is-all-you-need-for-graphs","slug":"masked-attention-is-all-you-need-for-graphs","title":"An end-to-end attention-based approach for learning on graphs","date":"2024-02-16","arxiv_id":"2402.10793","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-isomorphism-unet","slug":"graph-isomorphism-unet","title":"Graph isomorphism UNet","date":"2023-08-23","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/transitivity-preserving-graph-representation","slug":"transitivity-preserving-graph-representation","title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","date":"2023-08-18","arxiv_id":"2308.09517","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":26,"samples_ran":19,"samples_constructed":0,"samples_ran_checked":13,"samples_ran_instrument_failed":6,"samples_unverified":7,"pointer_only_for_licence":0,"official":{"repos":["nslab-cuk/unified-graph-transformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/transitivity-preserving-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2308.09517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09517"}}}},{"paper":"/paper/generalizing-topological-graph-neural","slug":"generalizing-topological-graph-neural","title":"Weisfeiler and Lehman Go Paths: Learning Topological Features via Path Complexes","date":"2023-08-13","arxiv_id":"2308.06838","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/cin-enhancing-topological-message-passing","slug":"cin-enhancing-topological-message-passing","title":"CIN++: Enhancing Topological Message Passing","date":"2023-06-06","arxiv_id":"2306.03561","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/strengthening-structural-baselines-for-graph","slug":"strengthening-structural-baselines-for-graph","title":"Strengthening structural baselines for graph classification using Local Topological Profile","date":"2023-05-01","arxiv_id":"2305.00724","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/cell-attention-networks","slug":"cell-attention-networks","title":"Cell Attention Networks","date":"2022-09-16","arxiv_id":"2209.08179","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["lrnzgiusti/can"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/cell-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2209.08179","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.08179"}}}},{"paper":"/paper/graph-trees-with-attention","slug":"graph-trees-with-attention","title":"TREE-G: Decision Trees Contesting Graph Neural Networks","date":"2022-07-06","arxiv_id":"2207.02760","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["mayabechlerspeicher/tree-g"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-trees-with-attention#ran","syntology_url":"https://syntology.ai/paper/2207.02760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02760"}}}},{"paper":"/paper/pure-transformers-are-powerful-graph-learners","slug":"pure-transformers-are-powerful-graph-learners","title":"Pure Transformers are Powerful Graph Learners","date":"2022-07-06","arxiv_id":"2207.02505","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":7,"official":{"repos":["jw9730/tokengt"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/pure-transformers-are-powerful-graph-learners#ran","syntology_url":"https://syntology.ai/paper/2207.02505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02505"}}}},{"paper":"/paper/template-based-graph-neural-network-with","slug":"template-based-graph-neural-network-with","title":"Template based Graph Neural Network with Optimal Transport Distances","date":"2022-05-31","arxiv_id":"2205.15733","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/recipe-for-a-general-powerful-scalable-graph","slug":"recipe-for-a-general-powerful-scalable-graph","title":"Recipe for a General, Powerful, Scalable Graph Transformer","date":"2022-05-25","arxiv_id":"2205.12454","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":21,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":18,"pointer_only_for_licence":0,"official":{"repos":["rampasek/GraphGPS"],"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/recipe-for-a-general-powerful-scalable-graph#ran","syntology_url":"https://syntology.ai/paper/2205.12454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12454"}}}},{"paper":"/paper/relational-reasoning-over-spatial-temporal","slug":"relational-reasoning-over-spatial-temporal","title":"Relational Reasoning Over Spatial-Temporal Graphs for Video Summarization","date":"2022-04-06","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/improving-spectral-graph-convolution-for","slug":"improving-spectral-graph-convolution-for","title":"A New Perspective on the Effects of Spectrum in Graph Neural Networks","date":"2021-12-14","arxiv_id":"2112.07160","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["qslim/gnn-spectrum"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/improving-spectral-graph-convolution-for#ran","syntology_url":"https://syntology.ai/paper/2112.07160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.07160"}}}},{"paper":"/paper/dropgnn-random-dropouts-increase-the","slug":"dropgnn-random-dropouts-increase-the","title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","date":"2021-11-11","arxiv_id":"2111.06283","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["karolismart/dropgnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dropgnn-random-dropouts-increase-the#ran","syntology_url":"https://syntology.ai/paper/2111.06283","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06283"}}}},{"paper":"/paper/fea2fea-exploring-structural-feature","slug":"fea2fea-exploring-structural-feature","title":"Fea2Fea: Exploring Structural Feature Correlations via Graph Neural Networks","date":"2021-06-24","arxiv_id":"2106.13061","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/do-transformers-really-perform-bad-for-graph","slug":"do-transformers-really-perform-bad-for-graph","title":"Do Transformers Really Perform Bad for Graph Representation?","date":"2021-06-09","arxiv_id":"2106.05234","rows_on_this_dataset":1,"code_links":5,"syntology":null},{"paper":"/paper/relation-order-histograms-as-a-network","slug":"relation-order-histograms-as-a-network","title":"Relation order histograms as a network embedding tool","date":"2021-06-09","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/how-attentive-are-graph-attention-networks","slug":"how-attentive-are-graph-attention-networks","title":"How Attentive are Graph Attention Networks?","date":"2021-05-30","arxiv_id":"2105.14491","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":16,"samples_ran":11,"samples_constructed":1,"samples_ran_checked":10,"samples_ran_instrument_failed":1,"samples_unverified":5,"pointer_only_for_licence":1,"official":{"repos":["tech-srl/how_attentive_are_gats"],"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/how-attentive-are-graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2105.14491","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14491"}}}},{"paper":"/paper/a-novel-higher-order-weisfeiler-lehman-graph","slug":"a-novel-higher-order-weisfeiler-lehman-graph","title":"A Novel Higher-order Weisfeiler-Lehman Graph Convolution","date":"2020-07-01","arxiv_id":"2007.00346","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/wasserstein-embedding-for-graph-learning","slug":"wasserstein-embedding-for-graph-learning","title":"Wasserstein Embedding for Graph Learning","date":"2020-06-16","arxiv_id":"2006.09430","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/principal-neighbourhood-aggregation-for-graph","slug":"principal-neighbourhood-aggregation-for-graph","title":"Principal Neighbourhood Aggregation for Graph Nets","date":"2020-04-12","arxiv_id":"2004.05718","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":55,"samples_ran":33,"samples_constructed":4,"samples_ran_checked":11,"samples_ran_instrument_failed":22,"samples_unverified":22,"pointer_only_for_licence":48,"official":{"repos":["lukecavabarrett/pna"],"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/principal-neighbourhood-aggregation-for-graph#ran","syntology_url":"https://syntology.ai/paper/2004.05718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05718"}}}},{"paper":"/paper/a-fair-comparison-of-graph-neural-networks-1","slug":"a-fair-comparison-of-graph-neural-networks-1","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","date":"2019-12-20","arxiv_id":"1912.09893","rows_on_this_dataset":2,"code_links":5,"syntology":null},{"paper":"/paper/asap-adaptive-structure-aware-pooling-for","slug":"asap-adaptive-structure-aware-pooling-for","title":"ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph Representations","date":"2019-11-18","arxiv_id":"1911.07979","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/hierarchical-graph-pooling-with-structure","slug":"hierarchical-graph-pooling-with-structure","title":"Hierarchical Graph Pooling with Structure Learning","date":"2019-11-14","arxiv_id":"1911.05954","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/hierarchical-representation-learning-in-graph","slug":"hierarchical-representation-learning-in-graph","title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","date":"2019-10-24","arxiv_id":"1910.11436","rows_on_this_dataset":1,"code_links":1,"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":1,"official":{"repos":["danielegrattarola/decimation-pooling"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hierarchical-representation-learning-in-graph#ran","syntology_url":"https://syntology.ai/paper/1910.11436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11436"}}}},{"paper":"/paper/a-non-negative-factorization-approach-to-node","slug":"a-non-negative-factorization-approach-to-node","title":"A Non-Negative Factorization approach to node pooling in Graph Convolutional Neural Networks","date":"2019-09-07","arxiv_id":"1909.03287","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/improving-attention-mechanism-in-graph-neural","slug":"improving-attention-mechanism-in-graph-neural","title":"Improving Attention Mechanism in Graph Neural Networks via Cardinality Preservation","date":"2019-07-04","arxiv_id":"1907.02204","rows_on_this_dataset":1,"code_links":1,"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":{"repos":["zetayue/CPA"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/improving-attention-mechanism-in-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1907.02204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.02204"}}}},{"paper":"/paper/wasserstein-weisfeiler-lehman-graph-kernels","slug":"wasserstein-weisfeiler-lehman-graph-kernels","title":"Wasserstein Weisfeiler-Lehman Graph Kernels","date":"2019-06-04","arxiv_id":"1906.01277","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":6,"pointer_only_for_licence":0,"official":{"repos":["BorgwardtLab/WWL"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/wasserstein-weisfeiler-lehman-graph-kernels#ran","syntology_url":"https://syntology.ai/paper/1906.01277","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01277"}}}},{"paper":"/paper/provably-powerful-graph-networks","slug":"provably-powerful-graph-networks","title":"Provably Powerful Graph Networks","date":"2019-05-27","arxiv_id":"1905.11136","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/provably-powerful-graph-networks#ran","syntology_url":"https://syntology.ai/paper/1905.11136","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11136"}}}},{"paper":"/paper/neighborhood-enlargement-in-graph-neural","slug":"neighborhood-enlargement-in-graph-neural","title":"Mutual Information Maximization in Graph Neural Networks","date":"2019-05-21","arxiv_id":"1905.08509","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/dissecting-graph-neural-networks-on-graph","slug":"dissecting-graph-neural-networks-on-graph","title":"Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification","date":"2019-05-11","arxiv_id":"1905.04579","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/capsule-graph-neural-network","slug":"capsule-graph-neural-network","title":"Capsule Graph Neural Network","date":"2019-05-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph-kernels-a-survey","slug":"graph-kernels-a-survey","title":"Graph Kernels: A Survey","date":"2019-04-27","arxiv_id":"1904.12218","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/ddgk-learning-graph-representations-for-deep","slug":"ddgk-learning-graph-representations-for-deep","title":"DDGK: Learning Graph Representations for Deep Divergence Graph Kernels","date":"2019-04-21","arxiv_id":"1904.09671","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/self-attention-graph-pooling","slug":"self-attention-graph-pooling","title":"Self-Attention Graph Pooling","date":"2019-04-17","arxiv_id":"1904.08082","rows_on_this_dataset":2,"code_links":3,"syntology":null},{"paper":"/paper/spi-gcn-a-simple-permutation-invariant-graph","slug":"spi-gcn-a-simple-permutation-invariant-graph","title":"SPI-GCN: A Simple Permutation-Invariant Graph Convolutional Network","date":"2019-04-08","arxiv_id":null,"rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/dagcn-dual-attention-graph-convolutional","slug":"dagcn-dual-attention-graph-convolutional","title":"DAGCN: Dual Attention Graph Convolutional Networks","date":"2019-04-04","arxiv_id":"1904.02278","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/towards-a-practical-k-dimensional-weisfeiler","slug":"towards-a-practical-k-dimensional-weisfeiler","title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","date":"2019-04-02","arxiv_id":"1904.01543","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["chrsmrrs/sparsewl"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/towards-a-practical-k-dimensional-weisfeiler#ran","syntology_url":"https://syntology.ai/paper/1904.01543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01543"}}}},{"paper":"/paper/subgraph-networks-with-application-to","slug":"subgraph-networks-with-application-to","title":"Subgraph Networks with Application to Structural Feature Space Expansion","date":"2019-03-21","arxiv_id":"1903.09022","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/capsule-neural-networks-for-graph","slug":"capsule-neural-networks-for-graph","title":"Capsule Neural Networks for Graph Classification using Explicit Tensorial Graph Representations","date":"2019-02-22","arxiv_id":"1902.08399","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/graph-classification-with-recurrent","slug":"graph-classification-with-recurrent","title":"Variational Recurrent Neural Networks for Graph Classification","date":"2019-02-07","arxiv_id":"1902.02721","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/propagation-kernels-efficient-graph-kernels","slug":"propagation-kernels-efficient-graph-kernels","title":"Propagation kernels: efficient graph kernels from propagated information","date":"2019-02-01","arxiv_id":null,"rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/spectral-multigraph-networks-for-discovering","slug":"spectral-multigraph-networks-for-discovering","title":"Spectral Multigraph Networks for Discovering and Fusing Relationships in Molecules","date":"2018-11-23","arxiv_id":"1811.09595","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/gaussian-induced-convolution-for-graphs","slug":"gaussian-induced-convolution-for-graphs","title":"Gaussian-Induced Convolution for Graphs","date":"2018-11-11","arxiv_id":"1811.04393","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/a-simple-yet-effective-baseline-for-non","slug":"a-simple-yet-effective-baseline-for-non","title":"A simple yet effective baseline for non-attributed graph classification","date":"2018-11-08","arxiv_id":"1811.03508","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/a-simple-baseline-algorithm-for-graph","slug":"a-simple-baseline-algorithm-for-graph","title":"A Simple Baseline Algorithm for Graph Classification","date":"2018-10-22","arxiv_id":"1810.09155","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/weisfeiler-and-leman-go-neural-higher-order","slug":"weisfeiler-and-leman-go-neural-higher-order","title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","date":"2018-10-04","arxiv_id":"1810.02244","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/how-powerful-are-graph-neural-networks","slug":"how-powerful-are-graph-neural-networks","title":"How Powerful are Graph Neural Networks?","date":"2018-10-01","arxiv_id":"1810.00826","rows_on_this_dataset":2,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":6,"samples_constructed":2,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":5,"official":{"repos":["weihua916/powerful-gnns"],"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":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/how-powerful-are-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1810.00826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.00826"}}}},{"paper":"/paper/graph-classification-using-structural","slug":"graph-classification-using-structural","title":"Graph Classification using Structural Attention","date":"2018-07-19","arxiv_id":null,"rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/optimal-transport-for-structured-data-with","slug":"optimal-transport-for-structured-data-with","title":"Optimal Transport for structured data with application on graphs","date":"2018-05-23","arxiv_id":"1805.09114","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/optimal-transport-for-structured-data-with#ran","syntology_url":"https://syntology.ai/paper/1805.09114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09114"}}}},{"paper":"/paper/graph-capsule-convolutional-neural-networks","slug":"graph-capsule-convolutional-neural-networks","title":"Graph Capsule Convolutional Neural Networks","date":"2018-05-21","arxiv_id":"1805.08090","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/an-end-to-end-deep-learning-architecture-for","slug":"an-end-to-end-deep-learning-architecture-for","title":"An End-to-End Deep Learning Architecture for Graph Classification","date":"2018-04-29","arxiv_id":null,"rows_on_this_dataset":1,"code_links":2,"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/learning-universal-adversarial-perturbations","slug":"learning-universal-adversarial-perturbations","title":"Learning Universal Adversarial Perturbations with Generative Models","date":"2017-08-17","arxiv_id":"1708.05207","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/graph2vec-learning-distributed","slug":"graph2vec-learning-distributed","title":"graph2vec: Learning Distributed Representations of Graphs","date":"2017-07-17","arxiv_id":"1707.05005","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph2vec-learning-distributed#ran","syntology_url":"https://syntology.ai/paper/1707.05005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.05005"}}}},{"paper":"/paper/dynamic-edge-conditioned-filters-in","slug":"dynamic-edge-conditioned-filters-in","title":"Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs","date":"2017-04-10","arxiv_id":"1704.02901","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["mys007/ecc"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dynamic-edge-conditioned-filters-in#ran","syntology_url":"https://syntology.ai/paper/1704.02901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.02901"}}}},{"paper":"/paper/semi-supervised-classification-with-graph","slug":"semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","arxiv_id":"1609.02907","rows_on_this_dataset":1,"code_links":55,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":58,"samples_ran":39,"samples_constructed":13,"samples_ran_checked":34,"samples_ran_instrument_failed":5,"samples_unverified":19,"pointer_only_for_licence":23,"official":{"repos":["tkipf/pygcn"],"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/semi-supervised-classification-with-graph#ran","syntology_url":"https://syntology.ai/paper/1609.02907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.02907"}}}},{"paper":"/paper/on-valid-optimal-assignment-kernels-and","slug":"on-valid-optimal-assignment-kernels-and","title":"On Valid Optimal Assignment Kernels and Applications to Graph Classification","date":"2016-06-03","arxiv_id":"1606.01141","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/learning-convolutional-neural-networks-for","slug":"learning-convolutional-neural-networks-for","title":"Learning Convolutional Neural Networks for Graphs","date":"2016-05-17","arxiv_id":"1605.05273","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/learning-metrics-for-persistence-based-2","slug":"learning-metrics-for-persistence-based-2","title":"Learning metrics for persistence-based summaries and applications for graph classification","date":null,"arxiv_id":"1904.12189","rows_on_this_dataset":1,"code_links":1,"syntology":null}],"papers_where_code_ran":18,"papers_where_code_ran_first_page":"/dataset/nci1/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/nci1/papers/ran/1","json":"/dataset/nci1/papers/ran/1.json","rows":18}],"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":20,"samples_harvested":348,"samples_ran":209,"samples_constructed":48,"samples_ran_checked":160,"samples_ran_instrument_failed":49,"samples_unverified":139,"pointer_only_for_licence":137,"papers_with_no_sample_that_ran":2,"papers_with_a_sample_that_ran":18,"papers_with_a_run_with_no_instrument_failure":17,"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":9,"papers_placed":3,"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/graph-classification-on-nci1","since_archive":"/sota/graph-classification-on-nci1#since-judged","papers_judged":9,"placed":3}]},"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":"3bb7d50af8365b2380a2790d2daa44ee72bd2678eed2dc9c0380b97357371673","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}