{"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/clean-dataset","entry":"clean_dataset","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":1,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":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":6,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":1,"n_places_pointer_only_link_open":0,"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":0,"ran_fixture":0,"ran":1,"unverified":5},"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":"2310.07579","arxiv_id_is_arxiv":true,"paper":"/paper/in-context-unlearning-language-models-as-few","title":"In-Context Unlearning: Language Models as Few Shot Unlearners","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MartinPawel/In-Context-Unlearning","path":"local_dataset_utilities.py","file_url":"https://github.com/MartinPawel/In-Context-Unlearning/blob/HEAD/local_dataset_utilities.py","status":"unverified","verification_level":0,"contract_check":null,"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, MartinPawel/In-Context-Unlearning when it was checked","code_sha256":"b8a02b31356a1521","code_sha256_prefix":"b8a02b31356a1521","mcp_get_code":{"code_sha256":"b8a02b31356a1521"}},{"arxiv_id":"2305.07759","arxiv_id_is_arxiv":true,"paper":"/paper/tinystories-how-small-can-language-models-be","title":"TinyStories: How Small Can Language Models Be and Still Speak Coherent English?","date":"2023-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danbraunai/simple_stories_train","path":"simple_stories_train/tokenizer.py","file_url":"https://github.com/danbraunai/simple_stories_train/blob/HEAD/simple_stories_train/tokenizer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"69981ccab3e11aa0","code_sha256_prefix":"69981ccab3e11aa0","mcp_get_code":{"code_sha256":"69981ccab3e11aa0"}},{"arxiv_id":"2202.04599","arxiv_id_is_arxiv":true,"paper":"/paper/missing-data-imputation-and-acquisition-with","title":"Missing Data Imputation and Acquisition with Deep Hierarchical Models and Hamiltonian Monte Carlo","date":"2022-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ipeis/HH-VAEM","path":"src/datasets.py","file_url":"https://github.com/ipeis/HH-VAEM/blob/HEAD/src/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"896634a7bacb2c3e","code_sha256_prefix":"896634a7bacb2c3e","mcp_get_code":{"code_sha256":"896634a7bacb2c3e"}},{"arxiv_id":"2003.06222","arxiv_id_is_arxiv":true,"paper":"/paper/an-evaluation-of-change-point-detection","title":"An Evaluation of Change Point Detection Algorithms","date":"2020-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alan-turing-institute/TCPD","path":"build_tcpd.py","file_url":"https://github.com/alan-turing-institute/TCPD/blob/HEAD/build_tcpd.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"720f4672c2ed9380","code_sha256_prefix":"720f4672c2ed9380","mcp_get_code":{"code_sha256":"720f4672c2ed9380"}},{"arxiv_id":"1808.08166","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-study-of-rich-subgroup-fairness","title":"An Empirical Study of Rich Subgroup Fairness for Machine Learning","date":"2018-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"algowatchpenn/GerryFair","path":"gerryfair/clean.py","file_url":"https://github.com/algowatchpenn/GerryFair/blob/HEAD/gerryfair/clean.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cd537de833dfde8f","code_sha256_prefix":"cd537de833dfde8f","mcp_get_code":{"code_sha256":"cd537de833dfde8f"}},{"arxiv_id":"1808.08166","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-study-of-rich-subgroup-fairness","title":"An Empirical Study of Rich Subgroup Fairness for Machine Learning","date":"2018-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sethneel/GerryFair","path":"gerryfair/clean.py","file_url":"https://github.com/sethneel/GerryFair/blob/HEAD/gerryfair/clean.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8adf5d639ebb5df1","code_sha256_prefix":"8adf5d639ebb5df1","mcp_get_code":{"code_sha256":"8adf5d639ebb5df1"}}],"record_sha256":"d17cf0412e3afea2eaf0c3204f055551bbd1e432f9a9c1650f2a68c088d6bbf2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}