{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/class-rand-splits","entry":"class_rand_splits","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":3,"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":3,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":1},"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":"2601.19449","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"58baf2e0e8e1755c","mcp_get_code":{"code_sha256":"58baf2e0e8e1755c"}},{"arxiv_id":"2407.01290","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,"code_sha256_prefix":"de5bdf76ff672322","mcp_get_code":{"code_sha256":"de5bdf76ff672322"}},{"arxiv_id":"2406.08993","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"58baf2e0e8e1755c","mcp_get_code":{"code_sha256":"58baf2e0e8e1755c"}},{"arxiv_id":"2403.15480","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,"code_sha256_prefix":"de5bdf76ff672322","mcp_get_code":{"code_sha256":"de5bdf76ff672322"}},{"arxiv_id":"2403.15480","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e0d4c1372efb5382","mcp_get_code":{"code_sha256":"e0d4c1372efb5382"}},{"arxiv_id":"2306.10759","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,"code_sha256_prefix":"de5bdf76ff672322","mcp_get_code":{"code_sha256":"de5bdf76ff672322"}}]}