{"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/unzip-file","entry":"unzip_file","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":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":4,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":1},"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":"2406.11911","paper":"/paper/a-notion-of-complexity-for-theory-of-mind-via","title":"A Notion of Complexity for Theory of Mind via Discrete World Models","date":"2024-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flecart/complexity-tom-dwm","path":"loader.py","file_url":"https://github.com/flecart/complexity-tom-dwm/blob/HEAD/loader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b3dded8ccf91020f","mcp_get_code":{"code_sha256":"b3dded8ccf91020f"}},{"arxiv_id":"2403.00680","paper":"/paper/scalable-learning-of-item-response-theory","title":"Scalable Learning of Item Response Theory Models","date":"2024-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tim907/irt","path":"IRT/eval_k_means_coresets_main/xrun/calc_costs.py","file_url":"https://github.com/tim907/irt/blob/HEAD/IRT/eval_k_means_coresets_main/xrun/calc_costs.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"78f1872ab2eb722a","mcp_get_code":{"code_sha256":"78f1872ab2eb722a"}},{"arxiv_id":"2403.00680","paper":"/paper/scalable-learning-of-item-response-theory","title":"Scalable Learning of Item Response Theory Models","date":"2024-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tim907/irt","path":"IRT/eval_k_means_coresets_main/xrun/eval_benchmark.py","file_url":"https://github.com/tim907/irt/blob/HEAD/IRT/eval_k_means_coresets_main/xrun/eval_benchmark.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"68e69499b706d8a5","mcp_get_code":{"code_sha256":"68e69499b706d8a5"}},{"arxiv_id":"2212.10465","paper":"/paper/soda-million-scale-dialogue-distillation-with","title":"SODA: Million-scale Dialogue Distillation with Social Commonsense Contextualization","date":"2022-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skywalker023/sodaverse","path":"tasks/dataset_loaders.py","file_url":"https://github.com/skywalker023/sodaverse/blob/HEAD/tasks/dataset_loaders.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b3dded8ccf91020f","mcp_get_code":{"code_sha256":"b3dded8ccf91020f"}},{"arxiv_id":"2207.00966","paper":"/paper/an-empirical-evaluation-of-k-means-coresets","title":"An Empirical Evaluation of $k$-Means Coresets","date":"2022-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sheikhomar/eval-k-means-coresets","path":"xrun/calc_costs.py","file_url":"https://github.com/sheikhomar/eval-k-means-coresets/blob/HEAD/xrun/calc_costs.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"78f1872ab2eb722a","mcp_get_code":{"code_sha256":"78f1872ab2eb722a"}},{"arxiv_id":"2207.00966","paper":"/paper/an-empirical-evaluation-of-k-means-coresets","title":"An Empirical Evaluation of $k$-Means Coresets","date":"2022-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sheikhomar/eval-k-means-coresets","path":"xrun/eval_benchmark.py","file_url":"https://github.com/sheikhomar/eval-k-means-coresets/blob/HEAD/xrun/eval_benchmark.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"68e69499b706d8a5","mcp_get_code":{"code_sha256":"68e69499b706d8a5"}},{"arxiv_id":"2003.07082","paper":"/paper/stanza-a-python-natural-language-processing","title":"Stanza: A Python Natural Language Processing Toolkit for Many Human Languages","date":"2020-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"textflint/textflint","path":"textflint/common/preprocess/cn_processor.py","file_url":"https://github.com/textflint/textflint/blob/HEAD/textflint/common/preprocess/cn_processor.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"21d5beba42458a9a","mcp_get_code":{"code_sha256":"21d5beba42458a9a"}}]}