{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/unzip-file","entry":"unzip_file","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":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_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":5,"n_places_pointer_only_link_open":2,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":0,"unverified":1},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b3dded8ccf91020f","code_sha256_prefix":"b3dded8ccf91020f","mcp_get_code":{"code_sha256":"b3dded8ccf91020f"}},{"arxiv_id":"2403.00680","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tim907/irt when it was checked","code_sha256":"78f1872ab2eb722a","code_sha256_prefix":"78f1872ab2eb722a","mcp_get_code":{"code_sha256":"78f1872ab2eb722a"}},{"arxiv_id":"2403.00680","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tim907/irt when it was checked","code_sha256":"68e69499b706d8a5","code_sha256_prefix":"68e69499b706d8a5","mcp_get_code":{"code_sha256":"68e69499b706d8a5"}},{"arxiv_id":"2212.10465","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b3dded8ccf91020f","code_sha256_prefix":"b3dded8ccf91020f","mcp_get_code":{"code_sha256":"b3dded8ccf91020f"}},{"arxiv_id":"2207.00966","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from tim907/irt, and GitHub detected no licence in that repository when it was checked","code_sha256":"78f1872ab2eb722a","code_sha256_prefix":"78f1872ab2eb722a","mcp_get_code":{"code_sha256":"78f1872ab2eb722a"}},{"arxiv_id":"2207.00966","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from tim907/irt, and GitHub detected no licence in that repository when it was checked","code_sha256":"68e69499b706d8a5","code_sha256_prefix":"68e69499b706d8a5","mcp_get_code":{"code_sha256":"68e69499b706d8a5"}},{"arxiv_id":"2003.07082","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, textflint/textflint, is not in the permissive set Syntology serves inline","code_sha256":"21d5beba42458a9a","code_sha256_prefix":"21d5beba42458a9a","mcp_get_code":{"code_sha256":"21d5beba42458a9a"}}],"record_sha256":"47c912aeed8f4b85c6f0ab6daa165ec65611fdd27d3a26a4dd59a9d4c92675b6","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}