{"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/gini","entry":"gini","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":2,"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":5,"n_samples_ran":2,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":3},"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":"2602.08389","paper":"/paper/arxiv-2602-08389","title":"Altruism and Fair Objective in Mixed-Motive Markov games","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"AkuBrains/altruistic-fair-MARL","path":"src/algorithms/utils.py","file_url":"https://github.com/AkuBrains/altruistic-fair-MARL/blob/HEAD/src/algorithms/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"405bf9ab133e601a","mcp_get_code":{"code_sha256":"405bf9ab133e601a"}},{"arxiv_id":"2410.04139","paper":"/paper/from-reading-to-compressing-exploring-the","title":"From Reading to Compressing: Exploring the Multi-document Reader for Prompt Compression","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eunseongc/r2c","path":"src_comp/compress_utils.py","file_url":"https://github.com/eunseongc/r2c/blob/HEAD/src_comp/compress_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"858eb20414dce303","mcp_get_code":{"code_sha256":"858eb20414dce303"}},{"arxiv_id":"2407.02112","paper":"/paper/a-data-centric-perspective-on-evaluating","title":"A Data-Centric Perspective on Evaluating Machine Learning Models for Tabular Data","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"atschalz/dc_tabeval","path":"utils.py","file_url":"https://github.com/atschalz/dc_tabeval/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d494ce11c4822d74","mcp_get_code":{"code_sha256":"d494ce11c4822d74"}},{"arxiv_id":"2306.08419","paper":"/paper/mediated-multi-agent-reinforcement-learning","title":"Mediated Multi-Agent Reinforcement Learning","date":"2023-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dimonenka/mediatedmarl","path":"pgg-iter/utils/utils.py","file_url":"https://github.com/dimonenka/mediatedmarl/blob/HEAD/pgg-iter/utils/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a03a48883c66fa38","mcp_get_code":{"code_sha256":"a03a48883c66fa38"}},{"arxiv_id":"2007.05721","paper":"/paper/towards-robust-classification-with-deep","title":"Towards Robust Classification with Deep Generative Forests","date":"2020-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlCorreia/GeFs","path":"gefs/split.py","file_url":"https://github.com/AlCorreia/GeFs/blob/HEAD/gefs/split.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"22dfc10f1898c675","mcp_get_code":{"code_sha256":"22dfc10f1898c675"}}]}