{"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/zinc/papers/ran/1","list_of":"/dataset/zinc","dataset":"ZINC","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","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)"},"order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","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,"rows":[1,29],"of":29,"counts":{"papers_with_a_benchmark_row":48,"with_a_code_link":45,"where_syntology_ran_a_sample":29,"not_listed_spam_title":0,"listed":48,"listed_where_code_ran":29,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":26,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":26,"listed_every_run_a_failure_of_syntologys_instrument":3,"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"},"first_page":"/dataset/zinc/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/unlocking-the-potential-of-classic-gnns-for","slug":"unlocking-the-potential-of-classic-gnns-for","title":"Unlocking the Potential of Classic GNNs for Graph-level Tasks: Simple Architectures Meet Excellence","date":"2025-02-13","arxiv_id":"2502.09263","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":12,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":3,"official":{"repos":["LUOyk1999/GNNPlus"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unlocking-the-potential-of-classic-gnns-for#ran","syntology_url":"https://syntology.ai/paper/2502.09263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.09263"}}}},{"paper":"/paper/learning-long-range-dependencies-on-graphs","slug":"learning-long-range-dependencies-on-graphs","title":"Learning Long Range Dependencies on Graphs via Random Walks","date":"2024-06-05","arxiv_id":"2406.03386","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":13,"samples_ran":13,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["borgwardtlab/neuralwalker"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-long-range-dependencies-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2406.03386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03386"}}}},{"paper":"/paper/ckgconv-general-graph-convolution-with","slug":"ckgconv-general-graph-convolution-with","title":"CKGConv: General Graph Convolution with Continuous Kernels","date":"2024-04-21","arxiv_id":"2404.13604","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":11,"official":{"repos":["networkslab/ckgconv"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/ckgconv-general-graph-convolution-with#ran","syntology_url":"https://syntology.ai/paper/2404.13604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.13604"}}}},{"paper":"/paper/topology-informed-graph-transformer","slug":"topology-informed-graph-transformer","title":"Topology-Informed Graph Transformer","date":"2024-02-03","arxiv_id":"2402.02005","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":21,"samples_ran":17,"samples_constructed":0,"samples_ran_checked":17,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":21,"official":{"repos":["leemingo/tigt"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/topology-informed-graph-transformer#ran","syntology_url":"https://syntology.ai/paper/2402.02005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02005"}}}},{"paper":"/paper/graph-level-representation-learning-with","slug":"graph-level-representation-learning-with","title":"Graph-level Representation Learning with Joint-Embedding Predictive Architectures","date":"2023-09-27","arxiv_id":"2309.16014","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":4,"official":{"repos":["geriskenderi/graph-jepa"],"state":"official (archive's flag): 10 ran","n_ran":10,"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-level-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/2309.16014","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16014"}}}},{"paper":"/paper/extending-the-design-space-of-graph-neural-1","slug":"extending-the-design-space-of-graph-neural-1","title":"Extending the Design Space of Graph Neural Networks by Rethinking Folklore Weisfeiler-Lehman","date":"2023-06-05","arxiv_id":"2306.03266","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["jiaruifeng/n2gnn"],"state":"official (archive's flag): 6 ran","n_ran":6,"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/extending-the-design-space-of-graph-neural-1#ran","syntology_url":"https://syntology.ai/paper/2306.03266","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.03266"}}}},{"paper":"/paper/graph-inductive-biases-in-transformers","slug":"graph-inductive-biases-in-transformers","title":"Graph Inductive Biases in Transformers without Message Passing","date":"2023-05-27","arxiv_id":"2305.17589","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":12,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":6,"pointer_only_for_licence":1,"official":{"repos":["liamma/grit"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-inductive-biases-in-transformers#ran","syntology_url":"https://syntology.ai/paper/2305.17589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17589"}}}},{"paper":"/paper/graph-propagation-transformer-for-graph","slug":"graph-propagation-transformer-for-graph","title":"Graph Propagation Transformer for Graph Representation Learning","date":"2023-05-19","arxiv_id":"2305.11424","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":8,"samples_ran":4,"samples_constructed":4,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":8,"official":{"repos":["czczup/gptrans"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/graph-propagation-transformer-for-graph#ran","syntology_url":"https://syntology.ai/paper/2305.11424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.11424"}}}},{"paper":"/paper/towards-better-graph-representation-learning","slug":"towards-better-graph-representation-learning","title":"Towards Better Graph Representation Learning with Parameterized Decomposition & Filtering","date":"2023-05-10","arxiv_id":"2305.06102","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["qslim/pdf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/towards-better-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/2305.06102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06102"}}}},{"paper":"/paper/a-generalization-of-vit-mlp-mixer-to-graphs","slug":"a-generalization-of-vit-mlp-mixer-to-graphs","title":"A Generalization of ViT/MLP-Mixer to Graphs","date":"2022-12-27","arxiv_id":"2212.13350","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+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":["XiaoxinHe/Graph-ViT-MLPMixer"],"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/a-generalization-of-vit-mlp-mixer-to-graphs#ran","syntology_url":"https://syntology.ai/paper/2212.13350","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.13350"}}}},{"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-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"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":7,"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/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":4,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+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/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-09-28T10:30:06+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/graph-neural-networks-with-learnable-1","slug":"graph-neural-networks-with-learnable-1","title":"Graph Neural Networks with Learnable Structural and Positional Representations","date":"2021-10-15","arxiv_id":"2110.07875","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":4,"samples_unverified":1,"pointer_only_for_licence":4,"official":{"repos":["vijaydwivedi75/gnn-lspe"],"state":"official (archive's flag): 6 ran","n_ran":6,"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/graph-neural-networks-with-learnable-1#ran","syntology_url":"https://syntology.ai/paper/2110.07875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.07875"}}}},{"paper":"/paper/edge-augmented-graph-transformers-global-self","slug":"edge-augmented-graph-transformers-global-self","title":"Global Self-Attention as a Replacement for Graph Convolution","date":"2021-08-07","arxiv_id":"2108.03348","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["shamim-hussain/egt","shamim-hussain/egt_pytorch","shamim-hussain/egt_triangular"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/edge-augmented-graph-transformers-global-self#ran","syntology_url":"https://syntology.ai/paper/2108.03348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.03348"}}}},{"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-09-28T10:30:06+00:00","samples_harvested":16,"samples_ran":11,"samples_constructed":1,"samples_ran_checked":11,"samples_ran_instrument_failed":0,"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/an-experimental-study-of-the-transferability","slug":"an-experimental-study-of-the-transferability","title":"An Experimental Study of the Transferability of Spectral Graph Networks","date":"2020-12-18","arxiv_id":"2012.10258","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["Axeln78/Transferability-of-spectral-gnns"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/an-experimental-study-of-the-transferability#ran","syntology_url":"https://syntology.ai/paper/2012.10258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.10258"}}}},{"paper":"/paper/factorizable-graph-convolutional-networks","slug":"factorizable-graph-convolutional-networks","title":"Factorizable Graph Convolutional Networks","date":"2020-10-12","arxiv_id":"2010.05421","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["ihollywhy/FactorGCN.PyTorch"],"state":"official (archive's flag): 2 ran","n_ran":2,"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/factorizable-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2010.05421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05421"}}}},{"paper":"/paper/improving-graph-neural-network-expressivity","slug":"improving-graph-neural-network-expressivity","title":"Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting","date":"2020-06-16","arxiv_id":"2006.09252","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["gbouritsas/graph-substructure-networks"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/improving-graph-neural-network-expressivity#ran","syntology_url":"https://syntology.ai/paper/2006.09252","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09252"}}}},{"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":2,"code_links":8,"syntology":{"read_at":"2026-09-28T10:30:06+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/benchmarking-graph-neural-networks","slug":"benchmarking-graph-neural-networks","title":"Benchmarking Graph Neural Networks","date":"2020-03-02","arxiv_id":"2003.00982","rows_on_this_dataset":3,"code_links":15,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":23,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":1,"samples_unverified":13,"pointer_only_for_licence":1,"official":{"repos":["graphdeeplearning/benchmarking-gnns","karl-zhao/benchmarking-gnns-pyg"],"state":"official (archive's flag): 3 ran","n_ran":3,"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/benchmarking-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2003.00982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00982"}}}},{"paper":"/paper/on-the-equivalence-between-graph-isomorphism","slug":"on-the-equivalence-between-graph-isomorphism","title":"On the equivalence between graph isomorphism testing and function approximation with GNNs","date":"2019-05-29","arxiv_id":"1905.12560","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+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":0,"official":{"repos":["leichen2018/Ring-GNN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/on-the-equivalence-between-graph-isomorphism#ran","syntology_url":"https://syntology.ai/paper/1905.12560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.12560"}}}},{"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-09-28T10:30:06+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/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-09-28T10:30:06+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-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","rows_on_this_dataset":2,"code_links":93,"syntology":{"read_at":"2026-09-28T10:30:06+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":2,"code_links":20,"syntology":{"read_at":"2026-09-28T10:30:06+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/neural-message-passing-for-quantum-chemistry","slug":"neural-message-passing-for-quantum-chemistry","title":"Neural Message Passing for Quantum Chemistry","date":"2017-04-04","arxiv_id":"1704.01212","rows_on_this_dataset":3,"code_links":20,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["brain-research/mpnn"],"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/neural-message-passing-for-quantum-chemistry#ran","syntology_url":"https://syntology.ai/paper/1704.01212","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.01212"}}}},{"paper":"/paper/geometric-deep-learning-on-graphs-and","slug":"geometric-deep-learning-on-graphs-and","title":"Geometric deep learning on graphs and manifolds using mixture model CNNs","date":"2016-11-25","arxiv_id":"1611.08402","rows_on_this_dataset":2,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+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":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/geometric-deep-learning-on-graphs-and#ran","syntology_url":"https://syntology.ai/paper/1611.08402","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.08402"}}}},{"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-09-28T10:30:06+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"}}}}],"record_sha256":"42f26f416c203419808fd6600b92b1c3573a7320783cc8172ef9ef59017c1877","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}