{"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/get-dataset-stats","entry":"get_dataset_stats","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":1,"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":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"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":"2503.01838","paper":"/paper/grain-exact-graph-reconstruction-from","title":"GRAIN: Exact Graph Reconstruction from Gradients","date":"2025-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"insait-institute/grain","path":"src/data_loading/data_utils.py","file_url":"https://github.com/insait-institute/grain/blob/HEAD/src/data_loading/data_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":"be3c8c258cbff27b","mcp_get_code":{"code_sha256":"be3c8c258cbff27b"}},{"arxiv_id":"2502.18968","paper":"/paper/know-you-first-and-be-you-better-modeling","title":"Know You First and Be You Better: Modeling Human-Like User Simulators via Implicit Profiles","date":"2025-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangkevin02/USP","path":"src/auxiliary_models/ai_detect_model/my_dataset.py","file_url":"https://github.com/wangkevin02/USP/blob/HEAD/src/auxiliary_models/ai_detect_model/my_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fa2081602bac8f30","mcp_get_code":{"code_sha256":"fa2081602bac8f30"}},{"arxiv_id":"2312.16414","paper":"/paper/bellman-optimal-step-size-straightening-of","title":"Bellman Optimal Stepsize Straightening of Flow-Matching Models","date":"2023-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nguyenngocbaocmt02/boss","path":"ImageGeneration/evaluation.py","file_url":"https://github.com/nguyenngocbaocmt02/boss/blob/HEAD/ImageGeneration/evaluation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e65d7c2e1dad4e1e","mcp_get_code":{"code_sha256":"e65d7c2e1dad4e1e"}},{"arxiv_id":"2307.03306","paper":"/paper/when-fair-classification-meets-noisy","title":"When Fair Classification Meets Noisy Protected Attributes","date":"2023-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"evijit/awareness_vs_unawareness","path":"arl/dataloader.py","file_url":"https://github.com/evijit/awareness_vs_unawareness/blob/HEAD/arl/dataloader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"644ac6bce810b422","mcp_get_code":{"code_sha256":"644ac6bce810b422"}},{"arxiv_id":"1912.04977","paper":"/paper/advances-and-open-problems-in-federated","title":"Advances and Open Problems in Federated Learning","date":"2019-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nseyedtalebi/tff_bench","path":"tasks/gld23k_mobilenet/dataset.py","file_url":"https://github.com/nseyedtalebi/tff_bench/blob/HEAD/tasks/gld23k_mobilenet/dataset.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":"499e2f9cdc92cba4","mcp_get_code":{"code_sha256":"499e2f9cdc92cba4"}}]}