{"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/aggregate-mean","entry":"aggregate_mean","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":9,"n_papers_ran":6,"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":5,"n_samples_fingerprinted":3,"n_places":11,"n_places_pointer_only":5,"by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":4},"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","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"736d87b0159dfa9a","mcp_get_code":{"code_sha256":"736d87b0159dfa9a"}},{"arxiv_id":"2605.08587","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"973027b79dad3324","mcp_get_code":{"code_sha256":"973027b79dad3324"}},{"arxiv_id":"2504.11239","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"461b981a90fb531b","mcp_get_code":{"code_sha256":"461b981a90fb531b"}},{"arxiv_id":"2310.18716","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":true,"code_sha256_prefix":"b19d1fdc25bad3bd","mcp_get_code":{"code_sha256":"b19d1fdc25bad3bd"}},{"arxiv_id":"2303.13971","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,"code_sha256_prefix":"486770c9e1d0c8e0","mcp_get_code":{"code_sha256":"486770c9e1d0c8e0"}},{"arxiv_id":"2205.00354","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,"code_sha256_prefix":"9f4630576b75f76d","mcp_get_code":{"code_sha256":"9f4630576b75f76d"}},{"arxiv_id":"2110.07875","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":true,"code_sha256_prefix":"b19d1fdc25bad3bd","mcp_get_code":{"code_sha256":"b19d1fdc25bad3bd"}},{"arxiv_id":"2108.13264","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,"code_sha256_prefix":"789e3d365ed83d4d","mcp_get_code":{"code_sha256":"789e3d365ed83d4d"}},{"arxiv_id":"2010.02863","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"24fa352e05630952","mcp_get_code":{"code_sha256":"24fa352e05630952"}},{"arxiv_id":"2004.05718","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,"code_sha256_prefix":"b19d1fdc25bad3bd","mcp_get_code":{"code_sha256":"b19d1fdc25bad3bd"}},{"arxiv_id":"2004.05718","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,"code_sha256_prefix":"d7ead85a1d37c169","mcp_get_code":{"code_sha256":"d7ead85a1d37c169"}}]}