{"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/aggregate-mean","entry":"aggregate_mean","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":9,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":4,"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":9,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":4,"n_places":11,"n_places_pointer_only":7,"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":2,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":2,"unverified":2},"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":"2605.08587","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-08587","title":"Kaczmarz Linear Attention","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"anonymous-kla-review/kla-anonymous","path":"efficiency_experiment_analysis.py","file_url":"https://github.com/anonymous-kla-review/kla-anonymous/blob/HEAD/efficiency_experiment_analysis.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, anonymous-kla-review/kla-anonymous (NOASSERTION)","code_sha256":"736d87b0159dfa9a","code_sha256_prefix":"736d87b0159dfa9a","mcp_get_code":{"code_sha256":"736d87b0159dfa9a"}},{"arxiv_id":"2605.08587","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-08587","title":"Kaczmarz Linear Attention","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"anonymous-kla-review/kla-anonymous","path":"long_context_extrapolation_analysis.py","file_url":"https://github.com/anonymous-kla-review/kla-anonymous/blob/HEAD/long_context_extrapolation_analysis.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, anonymous-kla-review/kla-anonymous (NOASSERTION)","code_sha256":"973027b79dad3324","code_sha256_prefix":"973027b79dad3324","mcp_get_code":{"code_sha256":"973027b79dad3324"}},{"arxiv_id":"2504.11239","arxiv_id_is_arxiv":true,"paper":"/paper/nondeterministic-polynomial-time-problem","title":"Nondeterministic Polynomial-time Problem Challenge: An Ever-Scaling Reasoning Benchmark for LLMs","date":"2025-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smu-diga/nppc","path":"npeval/metrics.py","file_url":"https://github.com/smu-diga/nppc/blob/HEAD/npeval/metrics.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":"461b981a90fb531b","code_sha256_prefix":"461b981a90fb531b","mcp_get_code":{"code_sha256":"461b981a90fb531b"}},{"arxiv_id":"2310.18716","arxiv_id_is_arxiv":true,"paper":"/paper/laplacian-canonization-a-minimalist-approach-1","title":"Laplacian Canonization: A Minimalist Approach to Sign and Basis Invariant Spectral Embedding","date":"2023-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"georgemlp/laplacian-canonization","path":"layers/pna_utils.py","file_url":"https://github.com/georgemlp/laplacian-canonization/blob/HEAD/layers/pna_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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 changminwu/expandergnn, and GitHub detected no licence in that repository when it was checked","code_sha256":"b19d1fdc25bad3bd","code_sha256_prefix":"b19d1fdc25bad3bd","mcp_get_code":{"code_sha256":"b19d1fdc25bad3bd"}},{"arxiv_id":"2303.13971","arxiv_id_is_arxiv":true,"paper":"/paper/optimal-transport-for-offline-imitation","title":"Optimal Transport for Offline Imitation Learning","date":"2023-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ethanluoyc/optimal_transport_reward","path":"otr/agents/otil/rewarder.py","file_url":"https://github.com/ethanluoyc/optimal_transport_reward/blob/HEAD/otr/agents/otil/rewarder.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"486770c9e1d0c8e0","code_sha256_prefix":"486770c9e1d0c8e0","mcp_get_code":{"code_sha256":"486770c9e1d0c8e0"}},{"arxiv_id":"2205.00354","arxiv_id_is_arxiv":true,"paper":"/paper/graph-anisotropic-diffusion","title":"Graph Anisotropic Diffusion","date":"2022-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahmed-a-a-elhag/gad","path":"src/gad_layer.py","file_url":"https://github.com/ahmed-a-a-elhag/gad/blob/HEAD/src/gad_layer.py","status":"unverified","verification_level":0,"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, ahmed-a-a-elhag/gad when it was checked","code_sha256":"9f4630576b75f76d","code_sha256_prefix":"9f4630576b75f76d","mcp_get_code":{"code_sha256":"9f4630576b75f76d"}},{"arxiv_id":"2110.07875","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-networks-with-learnable-1","title":"Graph Neural Networks with Learnable Structural and Positional Representations","date":"2021-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vijaydwivedi75/gnn-lspe","path":"layers/pna_utils.py","file_url":"https://github.com/vijaydwivedi75/gnn-lspe/blob/HEAD/layers/pna_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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 changminwu/expandergnn, and GitHub detected no licence in that repository when it was checked","code_sha256":"b19d1fdc25bad3bd","code_sha256_prefix":"b19d1fdc25bad3bd","mcp_get_code":{"code_sha256":"b19d1fdc25bad3bd"}},{"arxiv_id":"2108.13264","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-at-the-edge-of","title":"Deep Reinforcement Learning at the Edge of the Statistical Precipice","date":"2021-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/rliable","path":"rliable/metrics.py","file_url":"https://github.com/google-research/rliable/blob/HEAD/rliable/metrics.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"789e3d365ed83d4d","code_sha256_prefix":"789e3d365ed83d4d","mcp_get_code":{"code_sha256":"789e3d365ed83d4d"}},{"arxiv_id":"2010.02863","arxiv_id_is_arxiv":true,"paper":"/paper/directional-graph-networks-1","title":"Directional Graph Networks","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gbouritsas/gsn","path":"directional_gsn/nets/aggregators.py","file_url":"https://github.com/gbouritsas/gsn/blob/HEAD/directional_gsn/nets/aggregators.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"24fa352e05630952","code_sha256_prefix":"24fa352e05630952","mcp_get_code":{"code_sha256":"24fa352e05630952"}},{"arxiv_id":"2004.05718","arxiv_id_is_arxiv":true,"paper":"/paper/principal-neighbourhood-aggregation-for-graph","title":"Principal Neighbourhood Aggregation for Graph Nets","date":"2020-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"changminwu/expandergnn","path":"layers/pna_layer.py","file_url":"https://github.com/changminwu/expandergnn/blob/HEAD/layers/pna_layer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, changminwu/expandergnn when it was checked","code_sha256":"b19d1fdc25bad3bd","code_sha256_prefix":"b19d1fdc25bad3bd","mcp_get_code":{"code_sha256":"b19d1fdc25bad3bd"}},{"arxiv_id":"2004.05718","arxiv_id_is_arxiv":true,"paper":"/paper/principal-neighbourhood-aggregation-for-graph","title":"Principal Neighbourhood Aggregation for Graph Nets","date":"2020-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Saro00/DGN","path":"models/pytorch/dgn_layer.py","file_url":"https://github.com/Saro00/DGN/blob/HEAD/models/pytorch/dgn_layer.py","status":"unverified","verification_level":0,"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, Saro00/DGN when it was checked","code_sha256":"d7ead85a1d37c169","code_sha256_prefix":"d7ead85a1d37c169","mcp_get_code":{"code_sha256":"d7ead85a1d37c169"}}],"record_sha256":"e1ff1b40b7f877c8f42dde963092e2cc0a3952b17c653e12e6a0edbee4a36c8c","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}