{"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/get-log-deg","entry":"get_log_deg","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":0,"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":2,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"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":2,"ran_violates":0,"ran_draft_wrong":0,"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":"2606.14259","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-14259","title":"Beyond a Single Explanation of the Adam-SGD Gap","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"LiamMa/GRIT","path":"grit/layer/grit_layer.py","file_url":"https://github.com/LiamMa/GRIT/blob/HEAD/grit/layer/grit_layer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b5c9e7acf599a98a","code_sha256_prefix":"b5c9e7acf599a98a","mcp_get_code":{"code_sha256":"b5c9e7acf599a98a"}},{"arxiv_id":"2512.17762","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-17762","title":"Can You Hear Me Now? A Benchmark for Long-Range Graph Propagation","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"Graph-ECHO-Benchmark/ECHO","path":"models/grit_layer.py","file_url":"https://github.com/Graph-ECHO-Benchmark/ECHO/blob/HEAD/models/grit_layer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b5c9e7acf599a98a","code_sha256_prefix":"b5c9e7acf599a98a","mcp_get_code":{"code_sha256":"b5c9e7acf599a98a"}},{"arxiv_id":"2404.13604","arxiv_id_is_arxiv":true,"paper":"/paper/ckgconv-general-graph-convolution-with","title":"CKGConv: General Graph Convolution with Continuous Kernels","date":"2024-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"networkslab/CKGConv","path":"ckgconv/layer/ckgconv_layer.py","file_url":"https://github.com/networkslab/CKGConv/blob/HEAD/ckgconv/layer/ckgconv_layer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, networkslab/CKGConv when it was checked","code_sha256":"b5c9e7acf599a98a","code_sha256_prefix":"b5c9e7acf599a98a","mcp_get_code":{"code_sha256":"b5c9e7acf599a98a"}},{"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/layer/tensorized_transformer_layer.py","file_url":"https://github.com/zhouc20/k-transformer/blob/HEAD/graphgps/layer/tensorized_transformer_layer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b5c9e7acf599a98a","code_sha256_prefix":"b5c9e7acf599a98a","mcp_get_code":{"code_sha256":"b5c9e7acf599a98a"}},{"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/network/tigt.py","file_url":"https://github.com/leemingo/tigt/blob/HEAD/graphgps/network/tigt.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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":"a1c29ec4fe872b3b","code_sha256_prefix":"a1c29ec4fe872b3b","mcp_get_code":{"code_sha256":"a1c29ec4fe872b3b"}},{"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/layer/grit_layer.py","file_url":"https://github.com/zhouc20/HodgeRandomWalk/blob/HEAD/graphgps/layer/grit_layer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b5c9e7acf599a98a","code_sha256_prefix":"b5c9e7acf599a98a","mcp_get_code":{"code_sha256":"b5c9e7acf599a98a"}},{"arxiv_id":"2305.17589","arxiv_id_is_arxiv":true,"paper":"/paper/graph-inductive-biases-in-transformers","title":"Graph Inductive Biases in Transformers without Message Passing","date":"2023-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liamma/grit","path":"grit/layer/grit_layer.py","file_url":"https://github.com/liamma/grit/blob/HEAD/grit/layer/grit_layer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b5c9e7acf599a98a","code_sha256_prefix":"b5c9e7acf599a98a","mcp_get_code":{"code_sha256":"b5c9e7acf599a98a"}}],"record_sha256":"df24b155949d1f871bb4d9d06b0551210d270d7d0f8b2018d2641e550cf6a66d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}