{"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":"/code/load-fixed-splits","entry":"load_fixed_splits","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":12,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":2,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":8,"n_places_pointer_only_link_open":2,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":4,"unverified":0},"key_notes":{"n_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'","n_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)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2606.10284","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-10284","title":"Revisiting Positive Samples in Graph Contrastive Learning: From the Perspective of Message Passing","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"tengxiao1/GraphACL","path":"hete/dataset.py","file_url":"https://github.com/tengxiao1/GraphACL/blob/HEAD/hete/dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tengxiao1/GraphACL when it was checked","code_sha256":"ee2bc565d6f81f12","code_sha256_prefix":"ee2bc565d6f81f12","mcp_get_code":{"code_sha256":"ee2bc565d6f81f12"}},{"arxiv_id":"2601.19449","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-19449","title":"Fixed Aggregation Features Can Rival GNNs","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"celrm/fixed-aggregation-features","path":"data_utils.py","file_url":"https://github.com/celrm/fixed-aggregation-features/blob/HEAD/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, celrm/fixed-aggregation-features when it was checked","code_sha256":"025e94d610e74ffd","code_sha256_prefix":"025e94d610e74ffd","mcp_get_code":{"code_sha256":"025e94d610e74ffd"}},{"arxiv_id":"2504.13429","arxiv_id_is_arxiv":true,"paper":"/paper/bounded-and-uniform-energy-based-out-of","title":"Bounded and Uniform Energy-based Out-of-distribution Detection for Graphs","date":"2025-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShenzhiYang2000/NODESAFE-Bounded-and-Uniform-Energy-based-Out-of-distribution-Detection-for-Graphs","path":"NODESAFE_main/data_utils.py","file_url":"https://github.com/ShenzhiYang2000/NODESAFE-Bounded-and-Uniform-Energy-based-Out-of-distribution-Detection-for-Graphs/blob/HEAD/NODESAFE_main/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from fannie1208/GLIND, and GitHub detected no licence in that repository when it was checked","code_sha256":"8af7081a7caceae1","code_sha256_prefix":"8af7081a7caceae1","mcp_get_code":{"code_sha256":"8af7081a7caceae1"}},{"arxiv_id":"2407.01290","arxiv_id_is_arxiv":true,"paper":"/paper/hypformer-exploring-efficient-hyperbolic","title":"Hypformer: Exploring Efficient Hyperbolic Transformer Fully in Hyperbolic Space","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Graph-and-Geometric-Learning/hyperbolic-transformer","path":"large/data_utils.py","file_url":"https://github.com/Graph-and-Geometric-Learning/hyperbolic-transformer/blob/HEAD/large/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef6b5e211f3c0418","code_sha256_prefix":"ef6b5e211f3c0418","mcp_get_code":{"code_sha256":"ef6b5e211f3c0418"}},{"arxiv_id":"2406.08993","arxiv_id_is_arxiv":true,"paper":"/paper/classic-gnns-are-strong-baselines-reassessing","title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LUOyk1999/tunedGNN","path":"medium_graph/data_utils.py","file_url":"https://github.com/LUOyk1999/tunedGNN/blob/HEAD/medium_graph/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from celrm/fixed-aggregation-features, and GitHub detected no licence in that repository when it was checked","code_sha256":"025e94d610e74ffd","code_sha256_prefix":"025e94d610e74ffd","mcp_get_code":{"code_sha256":"025e94d610e74ffd"}},{"arxiv_id":"2406.08993","arxiv_id_is_arxiv":true,"paper":"/paper/classic-gnns-are-strong-baselines-reassessing","title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LUOyk1999/tunedGNN","path":"large_graph/data_utils.py","file_url":"https://github.com/LUOyk1999/tunedGNN/blob/HEAD/large_graph/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5b7702a29f6dafaf","code_sha256_prefix":"5b7702a29f6dafaf","mcp_get_code":{"code_sha256":"5b7702a29f6dafaf"}},{"arxiv_id":"2406.04963","arxiv_id_is_arxiv":true,"paper":"/paper/learning-divergence-fields-for-shift-robust","title":"Learning Divergence Fields for Shift-Robust Graph Representations","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fannie1208/GLIND","path":"observed/data_utils.py","file_url":"https://github.com/fannie1208/GLIND/blob/HEAD/observed/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fannie1208/GLIND when it was checked","code_sha256":"8af7081a7caceae1","code_sha256_prefix":"8af7081a7caceae1","mcp_get_code":{"code_sha256":"8af7081a7caceae1"}},{"arxiv_id":"2403.15480","arxiv_id_is_arxiv":true,"paper":"/paper/spikegraphormer-a-high-performance-graph","title":"SpikeGraphormer: A High-Performance Graph Transformer with Spiking Graph Attention","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"phd-lanyu/spikegraphormer","path":"large/data_utils.py","file_url":"https://github.com/phd-lanyu/spikegraphormer/blob/HEAD/large/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef6b5e211f3c0418","code_sha256_prefix":"ef6b5e211f3c0418","mcp_get_code":{"code_sha256":"ef6b5e211f3c0418"}},{"arxiv_id":"2403.01232","arxiv_id_is_arxiv":true,"paper":"/paper/polynormer-polynomial-expressive-graph","title":"Polynormer: Polynomial-Expressive Graph Transformer in Linear Time","date":"2024-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cornell-zhang/Polynormer","path":"data_utils.py","file_url":"https://github.com/cornell-zhang/Polynormer/blob/HEAD/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5b7702a29f6dafaf","code_sha256_prefix":"5b7702a29f6dafaf","mcp_get_code":{"code_sha256":"5b7702a29f6dafaf"}},{"arxiv_id":"2402.11494","arxiv_id_is_arxiv":true,"paper":"/paper/graph-out-of-distribution-generalization-via","title":"Graph Out-of-Distribution Generalization via Causal Intervention","date":"2024-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fannie1208/canet","path":"data_utils.py","file_url":"https://github.com/fannie1208/canet/blob/HEAD/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fannie1208/canet when it was checked","code_sha256":"8af7081a7caceae1","code_sha256_prefix":"8af7081a7caceae1","mcp_get_code":{"code_sha256":"8af7081a7caceae1"}},{"arxiv_id":"2310.10362","arxiv_id_is_arxiv":true,"paper":"/paper/prompt-tuning-for-multi-view-graph","title":"Self-Pro: A Self-Prompt and Tuning Framework for Graph Neural Networks","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gongchenghua/self-pro","path":"Self-Pro/hete/dataset.py","file_url":"https://github.com/gongchenghua/self-pro/blob/HEAD/Self-Pro/hete/dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gongchenghua/self-pro when it was checked","code_sha256":"ee2bc565d6f81f12","code_sha256_prefix":"ee2bc565d6f81f12","mcp_get_code":{"code_sha256":"ee2bc565d6f81f12"}},{"arxiv_id":"2310.05296","arxiv_id_is_arxiv":true,"paper":"/paper/tailoring-self-attention-for-graph-via-rooted-1","title":"Tailoring Self-Attention for Graph via Rooted Subtrees","date":"2023-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LUMIA-Group/SubTree-Attention","path":"data_utils.py","file_url":"https://github.com/LUMIA-Group/SubTree-Attention/blob/HEAD/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, LUMIA-Group/SubTree-Attention when it was checked","code_sha256":"ef6b5e211f3c0418","code_sha256_prefix":"ef6b5e211f3c0418","mcp_get_code":{"code_sha256":"ef6b5e211f3c0418"}},{"arxiv_id":"2306.10759","arxiv_id_is_arxiv":true,"paper":"/paper/simplifying-and-empowering-transformers-for-1","title":"SGFormer: Simplifying and Empowering Transformers for Large-Graph Representations","date":"2023-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qitianwu/SGFormer","path":"large/data_utils.py","file_url":"https://github.com/qitianwu/SGFormer/blob/HEAD/large/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef6b5e211f3c0418","code_sha256_prefix":"ef6b5e211f3c0418","mcp_get_code":{"code_sha256":"ef6b5e211f3c0418"}}],"record_sha256":"17b3e9feaba447230d54463abc60faa36632119eb224e3c13d0115aaa198f2c3","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}