{"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/squirrel-48-32-20-fixed-splits/papers/ran/1","list_of":"/dataset/squirrel-48-32-20-fixed-splits","dataset":"Squirrel (48%/32%/20% fixed splits)","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,10],"of":10,"counts":{"papers_with_a_benchmark_row":19,"with_a_code_link":19,"where_syntology_ran_a_sample":10,"not_listed_spam_title":0,"listed":19,"listed_where_code_ran":10,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":9,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":9,"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"},"first_page":"/dataset/squirrel-48-32-20-fixed-splits/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/edge-directionality-improves-learning-on","slug":"edge-directionality-improves-learning-on","title":"Edge Directionality Improves Learning on Heterophilic Graphs","date":"2023-05-17","arxiv_id":"2305.10498","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":4,"official":{"repos":["emalgorithm/directed-graph-neural-network"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/edge-directionality-improves-learning-on#ran","syntology_url":"https://syntology.ai/paper/2305.10498","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.10498"}}}},{"paper":"/paper/gread-graph-neural-reaction-diffusion","slug":"gread-graph-neural-reaction-diffusion","title":"GREAD: Graph Neural Reaction-Diffusion Networks","date":"2022-11-25","arxiv_id":"2211.14208","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":10,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":3,"samples_unverified":1,"pointer_only_for_licence":4,"official":{"repos":["jeongwhanchoi/gread"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/gread-graph-neural-reaction-diffusion#ran","syntology_url":"https://syntology.ai/paper/2211.14208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14208"}}}},{"paper":"/paper/revisiting-heterophily-for-graph-neural","slug":"revisiting-heterophily-for-graph-neural","title":"Revisiting Heterophily For Graph Neural Networks","date":"2022-10-14","arxiv_id":"2210.07606","rows_on_this_dataset":8,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":2,"official":{"repos":["SitaoLuan/ACM-GNN"],"state":"official (archive's flag): 4 ran","n_ran":4,"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/revisiting-heterophily-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2210.07606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07606"}}}},{"paper":"/paper/deformable-graph-convolutional-networks","slug":"deformable-graph-convolutional-networks","title":"Deformable Graph Convolutional Networks","date":"2021-12-29","arxiv_id":"2112.14438","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":2,"official":{"repos":["mlvlab/DeformableGCN"],"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/deformable-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2112.14438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.14438"}}}},{"paper":"/paper/large-scale-learning-on-non-homophilous","slug":"large-scale-learning-on-non-homophilous","title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","date":"2021-10-27","arxiv_id":"2110.14446","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":21,"samples_ran":15,"samples_constructed":5,"samples_ran_checked":15,"samples_ran_instrument_failed":0,"samples_unverified":6,"pointer_only_for_licence":11,"official":{"repos":["cuai/non-homophily-large-scale"],"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/large-scale-learning-on-non-homophilous#ran","syntology_url":"https://syntology.ai/paper/2110.14446","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14446"}}}},{"paper":"/paper/breaking-the-limit-of-graph-neural-networks","slug":"breaking-the-limit-of-graph-neural-networks","title":"Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing Patterns","date":"2021-06-11","arxiv_id":"2106.06586","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":12,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":1,"samples_unverified":6,"pointer_only_for_licence":0,"official":{"repos":["susheels/gnns-and-local-assortativity"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/breaking-the-limit-of-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2106.06586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06586"}}}},{"paper":"/paper/simple-and-deep-graph-convolutional-networks-1","slug":"simple-and-deep-graph-convolutional-networks-1","title":"Simple and Deep Graph Convolutional Networks","date":"2020-07-04","arxiv_id":"2007.02133","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":5,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":4,"official":{"repos":["chennnM/GCNII"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["found_in_text","listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/simple-and-deep-graph-convolutional-networks-1#ran","syntology_url":"https://syntology.ai/paper/2007.02133","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02133"}}}},{"paper":"/paper/generalizing-graph-neural-networks-beyond","slug":"generalizing-graph-neural-networks-beyond","title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs","date":"2020-06-20","arxiv_id":"2006.11468","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":21,"samples_ran":16,"samples_constructed":2,"samples_ran_checked":13,"samples_ran_instrument_failed":3,"samples_unverified":5,"pointer_only_for_licence":13,"official":{"repos":["GemsLab/H2GCN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["found_in_text","listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/generalizing-graph-neural-networks-beyond#ran","syntology_url":"https://syntology.ai/paper/2006.11468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11468"}}}},{"paper":"/paper/non-local-graph-neural-networks","slug":"non-local-graph-neural-networks","title":"Non-Local Graph Neural Networks","date":"2020-05-29","arxiv_id":"2005.14612","rows_on_this_dataset":3,"code_links":1,"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":3,"official":{"repos":["divelab/Non-Local-GNN"],"state":"official (archive's flag): 3 ran","n_ran":3,"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/non-local-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2005.14612","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14612"}}}},{"paper":"/paper/geom-gcn-geometric-graph-convolutional-1","slug":"geom-gcn-geometric-graph-convolutional-1","title":"Geom-GCN: Geometric Graph Convolutional Networks","date":"2020-02-13","arxiv_id":"2002.05287","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":7,"samples_constructed":2,"samples_ran_checked":3,"samples_ran_instrument_failed":4,"samples_unverified":0,"pointer_only_for_licence":7,"official":{"repos":["graphdml-uiuc-jlu/geom-gcn"],"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/geom-gcn-geometric-graph-convolutional-1#ran","syntology_url":"https://syntology.ai/paper/2002.05287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05287"}}}}],"record_sha256":"b7d86c94e8ae09b321e5267ac1fbdfab5877d461d85ec9fd2cc2b5ef1ecd6d57","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}