{"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/pascalvoc-sp/papers/ran/1","list_of":"/dataset/pascalvoc-sp","dataset":"Long Range Graph Benchmark (LRGB)","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,21],"of":21,"counts":{"papers_with_a_benchmark_row":32,"with_a_code_link":29,"where_syntology_ran_a_sample":21,"not_listed_spam_title":0,"listed":32,"listed_where_code_ran":21,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":19,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":19,"listed_every_run_a_failure_of_syntologys_instrument":2,"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/pascalvoc-sp/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/improving-the-effective-receptive-field-of","slug":"improving-the-effective-receptive-field-of","title":"Improving the Effective Receptive Field of Message-Passing Neural Networks","date":"2025-05-29","arxiv_id":"2505.23185","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+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":["bgu-cs-vil/im-mpnn"],"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-the-effective-receptive-field-of#ran","syntology_url":"https://syntology.ai/paper/2505.23185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.23185"}}}},{"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":3,"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/next-level-message-passing-with-hierarchical","slug":"next-level-message-passing-with-hierarchical","title":"Next Level Message-Passing with Hierarchical Support Graphs","date":"2024-06-22","arxiv_id":"2406.15852","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":10,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":6,"official":{"repos":["carlosinator/support-graphs"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/next-level-message-passing-with-hierarchical#ran","syntology_url":"https://syntology.ai/paper/2406.15852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15852"}}}},{"paper":"/paper/panda-expanded-width-aware-message-passing","slug":"panda-expanded-width-aware-message-passing","title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","date":"2024-06-06","arxiv_id":"2406.03671","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":9,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["jeongwhanchoi/panda"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/panda-expanded-width-aware-message-passing#ran","syntology_url":"https://syntology.ai/paper/2406.03671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03671"}}}},{"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":4,"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/spatio-spectral-graph-neural-networks","slug":"spatio-spectral-graph-neural-networks","title":"Spatio-Spectral Graph Neural Networks","date":"2024-05-29","arxiv_id":"2405.19121","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":9,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["sigeisler/s2gnn"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/spatio-spectral-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2405.19121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19121"}}}},{"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/recurrent-distance-encoding-neural-networks","slug":"recurrent-distance-encoding-neural-networks","title":"Recurrent Distance Filtering for Graph Representation Learning","date":"2023-12-03","arxiv_id":"2312.01538","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":21,"samples_ran":12,"samples_constructed":2,"samples_ran_checked":9,"samples_ran_instrument_failed":3,"samples_unverified":9,"pointer_only_for_licence":21,"official":{"repos":["skeletondyh/gred"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":2,"n_ran_no_instrument_failure":9,"n_unverified":9,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/recurrent-distance-encoding-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2312.01538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.01538"}}}},{"paper":"/paper/where-did-the-gap-go-reassessing-the-long","slug":"where-did-the-gap-go-reassessing-the-long","title":"Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark","date":"2023-09-01","arxiv_id":"2309.00367","rows_on_this_dataset":16,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":12,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":6,"official":{"repos":["toenshoff/lrgb"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/where-did-the-gap-go-reassessing-the-long#ran","syntology_url":"https://syntology.ai/paper/2309.00367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.00367"}}}},{"paper":"/paper/path-neural-networks-expressive-and-accurate","slug":"path-neural-networks-expressive-and-accurate","title":"Path Neural Networks: Expressive and Accurate Graph Neural Networks","date":"2023-06-09","arxiv_id":"2306.05955","rows_on_this_dataset":2,"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":["gasmichel/pathnns_expressive"],"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/path-neural-networks-expressive-and-accurate#ran","syntology_url":"https://syntology.ai/paper/2306.05955","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.05955"}}}},{"paper":"/paper/learning-probabilistic-symmetrization-for-1","slug":"learning-probabilistic-symmetrization-for-1","title":"Learning Probabilistic Symmetrization for Architecture Agnostic Equivariance","date":"2023-06-05","arxiv_id":"2306.02866","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":13,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":0,"official":{"repos":["jw9730/lps"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-probabilistic-symmetrization-for-1#ran","syntology_url":"https://syntology.ai/paper/2306.02866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02866"}}}},{"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":2,"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/drew-dynamically-rewired-message-passing-with","slug":"drew-dynamically-rewired-message-passing-with","title":"DRew: Dynamically Rewired Message Passing with Delay","date":"2023-05-13","arxiv_id":"2305.08018","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":9,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["bengutteridge/drew"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/drew-dynamically-rewired-message-passing-with#ran","syntology_url":"https://syntology.ai/paper/2305.08018","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.08018"}}}},{"paper":"/paper/exphormer-sparse-transformers-for-graphs","slug":"exphormer-sparse-transformers-for-graphs","title":"Exphormer: Sparse Transformers for Graphs","date":"2023-03-10","arxiv_id":"2303.06147","rows_on_this_dataset":4,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["hamed1375/exphormer"],"state":"official (archive's flag): 1 ran","n_ran":1,"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/exphormer-sparse-transformers-for-graphs#ran","syntology_url":"https://syntology.ai/paper/2303.06147","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.06147"}}}},{"paper":"/paper/multiresolution-graph-transformers-and","slug":"multiresolution-graph-transformers-and","title":"Multiresolution Graph Transformers and Wavelet Positional Encoding for Learning Hierarchical Structures","date":"2023-02-17","arxiv_id":"2302.08647","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":2,"official":{"repos":["hysonlab/multires-graph-transformer","vijaydwivedi75/lrgb"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/multiresolution-graph-transformers-and#ran","syntology_url":"https://syntology.ai/paper/2302.08647","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08647"}}}},{"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":4,"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/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":4,"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/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":1,"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"}}}}],"record_sha256":"0261843ba4624c1f9b31ae887de894eac297e823a703de2125e228009137abc2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}