{"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/sanitize-text","entry":"sanitize_text","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":6,"n_places_pointer_only":2,"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":2,"ran_fixture":0,"ran":2,"unverified":0},"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":"2604.06854","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-06854","title":"To Adapt or not to Adapt, Rethinking the Value of Medical Knowledge-Aware Large Language Models To Adapt or not to Adapt, Rethinking the Value of Medical Knowledge-Aware Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Maits27/Deduplication","path":"limpieza/limpiar.py","file_url":"https://github.com/Maits27/Deduplication/blob/HEAD/limpieza/limpiar.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Maits27/Deduplication when it was checked","code_sha256":"f20265615e665fbb","code_sha256_prefix":"f20265615e665fbb","mcp_get_code":{"code_sha256":"f20265615e665fbb"}},{"arxiv_id":"2604.06559","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-06559","title":"ExplainFuzz: Explainable and Constraint-Conditioned Test Generation with Probabilistic Circuits","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"niMgnoeSeeL/ExplainFuzz","path":"xml_concretizer/extract_pools.py","file_url":"https://github.com/niMgnoeSeeL/ExplainFuzz/blob/HEAD/xml_concretizer/extract_pools.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, niMgnoeSeeL/ExplainFuzz when it was checked","code_sha256":"c01d8001e909f052","code_sha256_prefix":"c01d8001e909f052","mcp_get_code":{"code_sha256":"c01d8001e909f052"}},{"arxiv_id":"2305.15387","arxiv_id_is_arxiv":true,"paper":"/paper/peek-across-improving-multi-document-modeling","title":"Peek Across: Improving Multi-Document Modeling via Cross-Document Question-Answering","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aviclu/peekacross","path":"pretrain_qamden.py","file_url":"https://github.com/aviclu/peekacross/blob/HEAD/pretrain_qamden.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":"31e3adacd2841d84","code_sha256_prefix":"31e3adacd2841d84","mcp_get_code":{"code_sha256":"31e3adacd2841d84"}},{"arxiv_id":"2305.10722","arxiv_id_is_arxiv":true,"paper":"/paper/discriminative-diffusion-models-as-few-shot","title":"Discffusion: Discriminative Diffusion Models as Few-shot Vision and Language Learners","date":"2023-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eric-ai-lab/dsd","path":"dsd_infer.py","file_url":"https://github.com/eric-ai-lab/dsd/blob/HEAD/dsd_infer.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":"fc89a1b3e420c811","code_sha256_prefix":"fc89a1b3e420c811","mcp_get_code":{"code_sha256":"fc89a1b3e420c811"}},{"arxiv_id":"2110.08499","arxiv_id_is_arxiv":true,"paper":"/paper/primer-pyramid-based-masked-sentence-pre","title":"PRIMERA: Pyramid-based Masked Sentence Pre-training for Multi-document Summarization","date":"2021-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/open-mds","path":"src/open_mds/common/util.py","file_url":"https://github.com/allenai/open-mds/blob/HEAD/src/open_mds/common/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31e3adacd2841d84","code_sha256_prefix":"31e3adacd2841d84","mcp_get_code":{"code_sha256":"31e3adacd2841d84"}},{"arxiv_id":"2006.03659","arxiv_id_is_arxiv":true,"paper":"/paper/declutr-deep-contrastive-learning-for","title":"DeCLUTR: Deep Contrastive Learning for Unsupervised Textual Representations","date":"2020-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JohnGiorgi/DeCLUTR","path":"declutr/common/util.py","file_url":"https://github.com/JohnGiorgi/DeCLUTR/blob/HEAD/declutr/common/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31e3adacd2841d84","code_sha256_prefix":"31e3adacd2841d84","mcp_get_code":{"code_sha256":"31e3adacd2841d84"}}],"record_sha256":"ee1261e138ba5c92db1e34faf09ddbebd8a432fe6b3fd60bfedcd34465d6a2e4","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}