{"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/rand-train-test-idx","entry":"rand_train_test_idx","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":18,"n_papers_ran":18,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":15,"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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":20,"n_places_pointer_only":15,"n_places_pointer_only_link_open":7,"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":0,"ran_fixture":5,"ran":3,"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":"2603.00599","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-00599","title":"Heterophily-Agnostic Hypergraph Neural Networks with Riemannian Local Exchanger","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"Mingzhang21/HealHGNN","path":"HealHGNN/utils/utils.py","file_url":"https://github.com/Mingzhang21/HealHGNN/blob/HEAD/HealHGNN/utils/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":"5e264c272c383c0c","code_sha256_prefix":"5e264c272c383c0c","mcp_get_code":{"code_sha256":"5e264c272c383c0c"}},{"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_fixture","verification_level":1,"contract_check":"RAISES","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":"f54bada0dd9396ba","code_sha256_prefix":"f54bada0dd9396ba","mcp_get_code":{"code_sha256":"f54bada0dd9396ba"}},{"arxiv_id":"2510.10849","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-10849","title":"Glance for Context: Learning When to Leverage LLMs for Node-Aware GNN-LLM Fusion","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"CUAI/Non-Homophily-Large-Scale","path":"data_utils.py","file_url":"https://github.com/CUAI/Non-Homophily-Large-Scale/blob/HEAD/data_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, CUAI/Non-Homophily-Large-Scale when it was checked","code_sha256":"13234652741e2264","code_sha256_prefix":"13234652741e2264","mcp_get_code":{"code_sha256":"13234652741e2264"}},{"arxiv_id":"2412.09902","arxiv_id_is_arxiv":true,"paper":"/paper/one-node-one-model-featuring-the-missing-half","title":"One Node One Model: Featuring the Missing-Half for Graph Clustering","date":"2024-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiexuanting/fpgc","path":"FPGC-main/data_utils.py","file_url":"https://github.com/xiexuanting/fpgc/blob/HEAD/FPGC-main/data_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, xiexuanting/fpgc when it was checked","code_sha256":"13234652741e2264","code_sha256_prefix":"13234652741e2264","mcp_get_code":{"code_sha256":"13234652741e2264"}},{"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_fixture","verification_level":1,"contract_check":"RAISES","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 CUAI/Non-Homophily-Large-Scale, and GitHub detected no licence in that repository when it was checked","code_sha256":"13234652741e2264","code_sha256_prefix":"13234652741e2264","mcp_get_code":{"code_sha256":"13234652741e2264"}},{"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_fixture","verification_level":1,"contract_check":"RAISES","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":"f54bada0dd9396ba","code_sha256_prefix":"f54bada0dd9396ba","mcp_get_code":{"code_sha256":"f54bada0dd9396ba"}},{"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from CUAI/Non-Homophily-Large-Scale, and GitHub detected no licence in that repository when it was checked","code_sha256":"13234652741e2264","code_sha256_prefix":"13234652741e2264","mcp_get_code":{"code_sha256":"13234652741e2264"}},{"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":"medium/data_utils.py","file_url":"https://github.com/phd-lanyu/spikegraphormer/blob/HEAD/medium/data_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cf34dc0377c08698","code_sha256_prefix":"cf34dc0377c08698","mcp_get_code":{"code_sha256":"cf34dc0377c08698"}},{"arxiv_id":"2403.07954","arxiv_id_is_arxiv":true,"paper":"/paper/optimizing-polynomial-graph-filters-a-novel","title":"Optimizing Polynomial Graph Filters: A Novel Adaptive Krylov Subspace Approach","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kkhuang81/AdaptKry","path":"non-homo/data_utils.py","file_url":"https://github.com/kkhuang81/AdaptKry/blob/HEAD/non-homo/data_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4e2abb5fb81ad073","code_sha256_prefix":"4e2abb5fb81ad073","mcp_get_code":{"code_sha256":"4e2abb5fb81ad073"}},{"arxiv_id":"2402.08907","arxiv_id_is_arxiv":true,"paper":"/paper/tackling-negative-transfer-on-graphs","title":"Subgraph Pooling: Tackling Negative Transfer on Graphs","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zehong-wang/subgraph-pooling","path":"data_utils.py","file_url":"https://github.com/zehong-wang/subgraph-pooling/blob/HEAD/data_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, zehong-wang/subgraph-pooling when it was checked","code_sha256":"13234652741e2264","code_sha256_prefix":"13234652741e2264","mcp_get_code":{"code_sha256":"13234652741e2264"}},{"arxiv_id":"2312.14438","arxiv_id_is_arxiv":true,"paper":"/paper/pc-conv-unifying-homophily-and-heterophily","title":"PC-Conv: Unifying Homophily and Heterophily with Two-fold Filtering","date":"2023-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uestclbh/pc-conv","path":"data_utils.py","file_url":"https://github.com/uestclbh/pc-conv/blob/HEAD/data_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, uestclbh/pc-conv when it was checked","code_sha256":"13234652741e2264","code_sha256_prefix":"13234652741e2264","mcp_get_code":{"code_sha256":"13234652741e2264"}},{"arxiv_id":"2312.11109","arxiv_id_is_arxiv":true,"paper":"/paper/graph-transformers-for-large-graphs","title":"Graph Transformers for Large Graphs","date":"2023-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-research/largegt","path":"data.py","file_url":"https://github.com/snap-research/largegt/blob/HEAD/data.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, snap-research/largegt when it was checked","code_sha256":"f54bada0dd9396ba","code_sha256_prefix":"f54bada0dd9396ba","mcp_get_code":{"code_sha256":"f54bada0dd9396ba"}},{"arxiv_id":"2310.00800","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2310.00800","date":null,"month_inferred_from_arxiv_id":"2023-10","title_source":null,"repo":"qitianwu/GraphOOD-EERM","path":"multigraph/data_utils.py","file_url":"https://github.com/qitianwu/GraphOOD-EERM/blob/HEAD/multigraph/data_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, qitianwu/GraphOOD-EERM when it was checked","code_sha256":"13234652741e2264","code_sha256_prefix":"13234652741e2264","mcp_get_code":{"code_sha256":"13234652741e2264"}},{"arxiv_id":"2306.11264","arxiv_id_is_arxiv":true,"paper":"/paper/graphglow-universal-and-generalizable","title":"GraphGLOW: Universal and Generalizable Structure Learning for Graph Neural Networks","date":"2023-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wtaozhao/graphglow","path":"data/prep_fb100.py","file_url":"https://github.com/wtaozhao/graphglow/blob/HEAD/data/prep_fb100.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wtaozhao/graphglow when it was checked","code_sha256":"31a5d29dd4ec41de","code_sha256_prefix":"31a5d29dd4ec41de","mcp_get_code":{"code_sha256":"31a5d29dd4ec41de"}},{"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_fixture","verification_level":1,"contract_check":"RAISES","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 CUAI/Non-Homophily-Large-Scale, and GitHub detected no licence in that repository when it was checked","code_sha256":"13234652741e2264","code_sha256_prefix":"13234652741e2264","mcp_get_code":{"code_sha256":"13234652741e2264"}},{"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":"100M/data_utils.py","file_url":"https://github.com/qitianwu/SGFormer/blob/HEAD/100M/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":"eea43aafe5795815","code_sha256_prefix":"eea43aafe5795815","mcp_get_code":{"code_sha256":"eea43aafe5795815"}},{"arxiv_id":"2306.08274","arxiv_id_is_arxiv":true,"paper":"/paper/why-using-either-aggregated-features-or","title":"A Simple and Scalable Graph Neural Network for Large Directed Graphs","date":"2023-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seijimaekawa/a2dug","path":"src/data_utils.py","file_url":"https://github.com/seijimaekawa/a2dug/blob/HEAD/src/data_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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 CUAI/Non-Homophily-Large-Scale, and GitHub detected no licence in that repository when it was checked","code_sha256":"13234652741e2264","code_sha256_prefix":"13234652741e2264","mcp_get_code":{"code_sha256":"13234652741e2264"}},{"arxiv_id":"2302.01524","arxiv_id_is_arxiv":true,"paper":"/paper/ordered-gnn-ordering-message-passing-to-deal","title":"Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing","date":"2023-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lumia-group/orderedgnn","path":"datasets/datasets_linkx/data_utils.py","file_url":"https://github.com/lumia-group/orderedgnn/blob/HEAD/datasets/datasets_linkx/data_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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 CUAI/Non-Homophily-Large-Scale, and GitHub detected no licence in that repository when it was checked","code_sha256":"13234652741e2264","code_sha256_prefix":"13234652741e2264","mcp_get_code":{"code_sha256":"13234652741e2264"}},{"arxiv_id":"2210.07606","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-heterophily-for-graph-neural","title":"Revisiting Heterophily For Graph Neural Networks","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SitaoLuan/ACM-GNN","path":"ACM-Geometric/data_utils.py","file_url":"https://github.com/SitaoLuan/ACM-GNN/blob/HEAD/ACM-Geometric/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":"e8000a86d21ce0e0","code_sha256_prefix":"e8000a86d21ce0e0","mcp_get_code":{"code_sha256":"e8000a86d21ce0e0"}},{"arxiv_id":"2110.14446","arxiv_id_is_arxiv":true,"paper":"/paper/large-scale-learning-on-non-homophilous","title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CUAI/Non-Homophily-Benchmarks","path":"data_utils.py","file_url":"https://github.com/CUAI/Non-Homophily-Benchmarks/blob/HEAD/data_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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 CUAI/Non-Homophily-Large-Scale, and GitHub detected no licence in that repository when it was checked","code_sha256":"13234652741e2264","code_sha256_prefix":"13234652741e2264","mcp_get_code":{"code_sha256":"13234652741e2264"}}],"record_sha256":"201325482607ac9a1fa90c3d3a4855d788818aab8a7d49e5391df36240d6dd3b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}