{"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/format-axes","entry":"format_axes","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":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":4,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"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":"2311.05610","paper":"/paper/efficient-parallelization-layouts-for-large","title":"Efficient Parallelization Layouts for Large-Scale Distributed Model Training","date":"2023-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aleph-alpha/neurips-want-submission-efficient-parallelization-layouts","path":"latexify.py","file_url":"https://github.com/aleph-alpha/neurips-want-submission-efficient-parallelization-layouts/blob/HEAD/latexify.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"7f664dc394bb3883","mcp_get_code":{"code_sha256":"7f664dc394bb3883"}},{"arxiv_id":"2306.04891","paper":"/paper/in-context-learning-through-the-bayesian","title":"In-Context Learning through the Bayesian Prism","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mdrpanwar/icl-bayesian-prism","path":"src/common_code.py","file_url":"https://github.com/mdrpanwar/icl-bayesian-prism/blob/HEAD/src/common_code.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"21db66ce02f70c6d","mcp_get_code":{"code_sha256":"21db66ce02f70c6d"}},{"arxiv_id":"2302.05833","paper":"/paper/bregman-wasserstein-divergence-geometry-and","title":"Bregman-Wasserstein divergence: geometry and applications","date":null,"month_inferred_from_arxiv_id":"2023-02","title_source":"archive","repo":"amanjitsk/bregman-wasserstein","path":"plot_utils.py","file_url":"https://github.com/amanjitsk/bregman-wasserstein/blob/HEAD/plot_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d9aff414f861e9bd","mcp_get_code":{"code_sha256":"d9aff414f861e9bd"}},{"arxiv_id":"2108.08435","paper":"/paper/fair-and-consistent-federated-learning","title":"Addressing Algorithmic Disparity and Performance Inconsistency in Federated Learning","date":"2021-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cuis15/FCFL","path":"FUEL/synthetic/latex_utils.py","file_url":"https://github.com/cuis15/FCFL/blob/HEAD/FUEL/synthetic/latex_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"19c3adf4dc402137","mcp_get_code":{"code_sha256":"19c3adf4dc402137"}},{"arxiv_id":"1902.00146","paper":"/paper/agnostic-federated-learning","title":"Agnostic Federated Learning","date":"2019-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fairfl/FUEL","path":"FUEL/synthetic/latex_utils.py","file_url":"https://github.com/fairfl/FUEL/blob/HEAD/FUEL/synthetic/latex_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"19c3adf4dc402137","mcp_get_code":{"code_sha256":"19c3adf4dc402137"}}]}