{"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/is-split","entry":"is_split","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":17,"n_papers_ran":17,"n_papers_ran_no_instrument_failure":16,"n_papers_ran_instrument_only":1,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":17,"n_places_pointer_only":16,"n_places_pointer_only_link_open":10,"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":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"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":"2510.21267","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-21267","title":"Relieving the Over-Aggregating Effect in Graph Transformers","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"sunjss/over-aggregating","path":"graphgps/agg_runs.py","file_url":"https://github.com/sunjss/over-aggregating/blob/HEAD/graphgps/agg_runs.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, sunjss/over-aggregating when it was checked","code_sha256":"438635c08adfe2aa","code_sha256_prefix":"438635c08adfe2aa","mcp_get_code":{"code_sha256":"438635c08adfe2aa"}},{"arxiv_id":"2502.09263","arxiv_id_is_arxiv":true,"paper":"/paper/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","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LUOyk1999/GNNPlus","path":"GNNPlus/agg_runs.py","file_url":"https://github.com/LUOyk1999/GNNPlus/blob/HEAD/GNNPlus/agg_runs.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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 sunjss/over-aggregating, and GitHub detected no licence in that repository when it was checked","code_sha256":"438635c08adfe2aa","code_sha256_prefix":"438635c08adfe2aa","mcp_get_code":{"code_sha256":"438635c08adfe2aa"}},{"arxiv_id":"2411.02059","arxiv_id_is_arxiv":true,"paper":"/paper/tablegpt2-a-large-multimodal-model-with","title":"TableGPT2: A Large Multimodal Model with Tabular Data Integration","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tablegpt/tablegpt-agent","path":"src/tablegpt/agent/file_reading/data_normalizer.py","file_url":"https://github.com/tablegpt/tablegpt-agent/blob/HEAD/src/tablegpt/agent/file_reading/data_normalizer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9b024751e4c0cdbe","code_sha256_prefix":"9b024751e4c0cdbe","mcp_get_code":{"code_sha256":"9b024751e4c0cdbe"}},{"arxiv_id":"2406.15852","arxiv_id_is_arxiv":true,"paper":"/paper/next-level-message-passing-with-hierarchical","title":"Next Level Message-Passing with Hierarchical Support Graphs","date":"2024-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"carlosinator/support-graphs","path":"graphgps/agg_runs.py","file_url":"https://github.com/carlosinator/support-graphs/blob/HEAD/graphgps/agg_runs.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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 sunjss/over-aggregating, and GitHub detected no licence in that repository when it was checked","code_sha256":"438635c08adfe2aa","code_sha256_prefix":"438635c08adfe2aa","mcp_get_code":{"code_sha256":"438635c08adfe2aa"}},{"arxiv_id":"2406.05815","arxiv_id_is_arxiv":true,"paper":"/paper/what-can-we-learn-from-state-space-models-for","title":"What Can We Learn from State Space Models for Machine Learning on Graphs?","date":"2024-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graph-com/gssc","path":"gssc/agg_runs.py","file_url":"https://github.com/graph-com/gssc/blob/HEAD/gssc/agg_runs.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, graph-com/gssc when it was checked","code_sha256":"438635c08adfe2aa","code_sha256_prefix":"438635c08adfe2aa","mcp_get_code":{"code_sha256":"438635c08adfe2aa"}},{"arxiv_id":"2405.21061","arxiv_id_is_arxiv":true,"paper":"/paper/graph-external-attention-enhanced-transformer","title":"Graph External Attention Enhanced Transformer","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"icm1018/GEAET","path":"GEAET/agg_runs.py","file_url":"https://github.com/icm1018/GEAET/blob/HEAD/GEAET/agg_runs.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, icm1018/GEAET when it was checked","code_sha256":"438635c08adfe2aa","code_sha256_prefix":"438635c08adfe2aa","mcp_get_code":{"code_sha256":"438635c08adfe2aa"}},{"arxiv_id":"2405.20543","arxiv_id_is_arxiv":true,"paper":"/paper/towards-a-general-gnn-framework-for","title":"Towards a General Recipe for Combinatorial Optimization with Multi-Filter GNNs","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenkelf/copt","path":"graphgym/agg_runs.py","file_url":"https://github.com/wenkelf/copt/blob/HEAD/graphgym/agg_runs.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, wenkelf/copt when it was checked","code_sha256":"438635c08adfe2aa","code_sha256_prefix":"438635c08adfe2aa","mcp_get_code":{"code_sha256":"438635c08adfe2aa"}},{"arxiv_id":"2405.13806","arxiv_id_is_arxiv":true,"paper":"/paper/advancing-graph-convolutional-networks-via","title":"A General Graph Spectral Wavelet Convolution via Chebyshev Order Decomposition","date":"2024-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liun-online/WaveGC","path":"WaveGC_graph/graphgps/agg_runs.py","file_url":"https://github.com/liun-online/WaveGC/blob/HEAD/WaveGC_graph/graphgps/agg_runs.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, liun-online/WaveGC when it was checked","code_sha256":"438635c08adfe2aa","code_sha256_prefix":"438635c08adfe2aa","mcp_get_code":{"code_sha256":"438635c08adfe2aa"}},{"arxiv_id":"2405.11951","arxiv_id_is_arxiv":true,"paper":"/paper/distinguished-in-uniform-self-attention-vs","title":"Distinguished In Uniform: Self Attention Vs. Virtual Nodes","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"toenshoff/vn-vs-gt","path":"graphgps/agg_runs.py","file_url":"https://github.com/toenshoff/vn-vs-gt/blob/HEAD/graphgps/agg_runs.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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 sunjss/over-aggregating, and GitHub detected no licence in that repository when it was checked","code_sha256":"438635c08adfe2aa","code_sha256_prefix":"438635c08adfe2aa","mcp_get_code":{"code_sha256":"438635c08adfe2aa"}},{"arxiv_id":"2404.03380","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-theoretical-expressive-power-and-the","title":"On the Theoretical Expressive Power and the Design Space of Higher-Order Graph Transformers","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhouc20/k-transformer","path":"graphgps/agg_runs.py","file_url":"https://github.com/zhouc20/k-transformer/blob/HEAD/graphgps/agg_runs.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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 sunjss/over-aggregating, and GitHub detected no licence in that repository when it was checked","code_sha256":"438635c08adfe2aa","code_sha256_prefix":"438635c08adfe2aa","mcp_get_code":{"code_sha256":"438635c08adfe2aa"}},{"arxiv_id":"2402.14202","arxiv_id_is_arxiv":true,"paper":"/paper/comparing-graph-transformers-via-positional","title":"Comparing Graph Transformers via Positional Encodings","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"blackmit/comparing_graph_transformers_via_positional_encodings","path":"graphgps/agg_runs.py","file_url":"https://github.com/blackmit/comparing_graph_transformers_via_positional_encodings/blob/HEAD/graphgps/agg_runs.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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 sunjss/over-aggregating, and GitHub detected no licence in that repository when it was checked","code_sha256":"438635c08adfe2aa","code_sha256_prefix":"438635c08adfe2aa","mcp_get_code":{"code_sha256":"438635c08adfe2aa"}},{"arxiv_id":"2402.02518","arxiv_id_is_arxiv":true,"paper":"/paper/latent-graph-diffusion-a-unified-framework","title":"Unifying Generation and Prediction on Graphs with Latent Graph Diffusion","date":"2024-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhouc20/latentgraphdiffusion","path":"lgd/agg_runs.py","file_url":"https://github.com/zhouc20/latentgraphdiffusion/blob/HEAD/lgd/agg_runs.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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 sunjss/over-aggregating, and GitHub detected no licence in that repository when it was checked","code_sha256":"438635c08adfe2aa","code_sha256_prefix":"438635c08adfe2aa","mcp_get_code":{"code_sha256":"438635c08adfe2aa"}},{"arxiv_id":"2402.02005","arxiv_id_is_arxiv":true,"paper":"/paper/topology-informed-graph-transformer","title":"Topology-Informed Graph Transformer","date":"2024-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leemingo/tigt","path":"graphgps/agg_runs.py","file_url":"https://github.com/leemingo/tigt/blob/HEAD/graphgps/agg_runs.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, leemingo/tigt when it was checked","code_sha256":"438635c08adfe2aa","code_sha256_prefix":"438635c08adfe2aa","mcp_get_code":{"code_sha256":"438635c08adfe2aa"}},{"arxiv_id":"2312.04234","arxiv_id_is_arxiv":true,"paper":"/paper/graph-convolutions-enrich-the-self-attention","title":"Graph Convolutions Enrich the Self-Attention in Transformers!","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rampasek/GraphGPS","path":"graphgps/agg_runs.py","file_url":"https://github.com/rampasek/GraphGPS/blob/HEAD/graphgps/agg_runs.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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 sunjss/over-aggregating, and GitHub detected no licence in that repository when it was checked","code_sha256":"438635c08adfe2aa","code_sha256_prefix":"438635c08adfe2aa","mcp_get_code":{"code_sha256":"438635c08adfe2aa"}},{"arxiv_id":"2310.19285","arxiv_id_is_arxiv":true,"paper":"/paper/facilitating-graph-neural-networks-with","title":"Facilitating Graph Neural Networks with Random Walk on Simplicial Complexes","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhouc20/HodgeRandomWalk","path":"graphgps/agg_runs.py","file_url":"https://github.com/zhouc20/HodgeRandomWalk/blob/HEAD/graphgps/agg_runs.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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 sunjss/over-aggregating, and GitHub detected no licence in that repository when it was checked","code_sha256":"438635c08adfe2aa","code_sha256_prefix":"438635c08adfe2aa","mcp_get_code":{"code_sha256":"438635c08adfe2aa"}},{"arxiv_id":"2309.00367","arxiv_id_is_arxiv":true,"paper":"/paper/where-did-the-gap-go-reassessing-the-long","title":"Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark","date":"2023-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"toenshoff/lrgb","path":"graphgps/agg_runs.py","file_url":"https://github.com/toenshoff/lrgb/blob/HEAD/graphgps/agg_runs.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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 sunjss/over-aggregating, and GitHub detected no licence in that repository when it was checked","code_sha256":"438635c08adfe2aa","code_sha256_prefix":"438635c08adfe2aa","mcp_get_code":{"code_sha256":"438635c08adfe2aa"}},{"arxiv_id":"2302.04181","arxiv_id_is_arxiv":true,"paper":"/paper/attending-to-graph-transformers","title":"Attending to Graph Transformers","date":"2023-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luis-mueller/probing-graph-transformers","path":"graphgps/agg_runs.py","file_url":"https://github.com/luis-mueller/probing-graph-transformers/blob/HEAD/graphgps/agg_runs.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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 sunjss/over-aggregating, and GitHub detected no licence in that repository when it was checked","code_sha256":"438635c08adfe2aa","code_sha256_prefix":"438635c08adfe2aa","mcp_get_code":{"code_sha256":"438635c08adfe2aa"}}],"record_sha256":"8cde75f4d0d5fc04f6ebf9d878b18eefae8e31585e7ab3635f29381f28676f02","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}