{"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/strip-whitespace","entry":"strip_whitespace","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":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":3,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":2},"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":"2603.00051","paper":"/paper/arxiv-2603-00051","title":"LitBench: A Graph-Centric Large Language Model Benchmarking Tool For Literature Tasks","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"google-research/arxiv-latex-cleaner","path":"arxiv_latex_cleaner/arxiv_latex_cleaner.py","file_url":"https://github.com/google-research/arxiv-latex-cleaner/blob/HEAD/arxiv_latex_cleaner/arxiv_latex_cleaner.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":"2658d9e8d8f85bf0","mcp_get_code":{"code_sha256":"2658d9e8d8f85bf0"}},{"arxiv_id":"2309.05444","paper":"/paper/pushing-mixture-of-experts-to-the-limit","title":"Pushing Mixture of Experts to the Limit: Extremely Parameter Efficient MoE for Instruction Tuning","date":"2023-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"for-ai/parameter-efficient-moe","path":"t0_data/tasks.py","file_url":"https://github.com/for-ai/parameter-efficient-moe/blob/HEAD/t0_data/tasks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"11b64b0a85dfb964","mcp_get_code":{"code_sha256":"11b64b0a85dfb964"}},{"arxiv_id":"2305.16653","paper":"/paper/adaplanner-adaptive-planning-from-feedback-1","title":"AdaPlanner: Adaptive Planning from Feedback with Language Models","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haotiansun14/adaplanner","path":"MiniWOB++/computergym/computergym/miniwob/miniwob_interface/utils.py","file_url":"https://github.com/haotiansun14/adaplanner/blob/HEAD/MiniWOB%2B%2B/computergym/computergym/miniwob/miniwob_interface/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9793a008041e04f6","mcp_get_code":{"code_sha256":"9793a008041e04f6"}},{"arxiv_id":"2303.17491","paper":"/paper/language-models-can-solve-computer-tasks","title":"Language Models can Solve Computer Tasks","date":"2023-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"posgnu/rci-agent","path":"computergym/computergym/miniwob/miniwob_interface/utils.py","file_url":"https://github.com/posgnu/rci-agent/blob/HEAD/computergym/computergym/miniwob/miniwob_interface/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9793a008041e04f6","mcp_get_code":{"code_sha256":"9793a008041e04f6"}},{"arxiv_id":"2110.08207","paper":"/paper/multitask-prompted-training-enables-zero-shot-1","title":"Multitask Prompted Training Enables Zero-Shot Task Generalization","date":"2021-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigscience-workshop/t-zero","path":"t0/seqio_tasks/tasks.py","file_url":"https://github.com/bigscience-workshop/t-zero/blob/HEAD/t0/seqio_tasks/tasks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"11b64b0a85dfb964","mcp_get_code":{"code_sha256":"11b64b0a85dfb964"}}]}