{"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-time","entry":"clean_time","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":8,"n_places_pointer_only":0,"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":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":"2305.02468","arxiv_id_is_arxiv":true,"paper":"/paper/task-optimized-adapters-for-an-end-to-end","title":"Task-Optimized Adapters for an End-to-End Task-Oriented Dialogue System","date":"2023-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sogang-isds/TOATOD","path":"E2E_TOD/clean_dataset.py","file_url":"https://github.com/sogang-isds/TOATOD/blob/HEAD/E2E_TOD/clean_dataset.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":"4c62f23ce8135bda","code_sha256_prefix":"4c62f23ce8135bda","mcp_get_code":{"code_sha256":"4c62f23ce8135bda"}},{"arxiv_id":"2302.11520","arxiv_id_is_arxiv":true,"paper":"/paper/guiding-large-language-models-via-directional-1","title":"Guiding Large Language Models via Directional Stimulus Prompting","date":"2023-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leezekun/directional-stimulus-prompting","path":"sft4lms/MultiWOZ/clean_dataset.py","file_url":"https://github.com/leezekun/directional-stimulus-prompting/blob/HEAD/sft4lms/MultiWOZ/clean_dataset.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":"4c62f23ce8135bda","code_sha256_prefix":"4c62f23ce8135bda","mcp_get_code":{"code_sha256":"4c62f23ce8135bda"}},{"arxiv_id":"2302.10342","arxiv_id_is_arxiv":true,"paper":"/paper/fantastic-rewards-and-how-to-tame-them-a-case","title":"Fantastic Rewards and How to Tame Them: A Case Study on Reward Learning for Task-oriented Dialogue Systems","date":"2023-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shentao-yang/fantastic_reward_iclr2023","path":"damd_multiwoz/clean_dataset.py","file_url":"https://github.com/shentao-yang/fantastic_reward_iclr2023/blob/HEAD/damd_multiwoz/clean_dataset.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":"4c62f23ce8135bda","code_sha256_prefix":"4c62f23ce8135bda","mcp_get_code":{"code_sha256":"4c62f23ce8135bda"}},{"arxiv_id":"2210.08692","arxiv_id_is_arxiv":true,"paper":"/paper/a-generative-user-simulator-with-gpt-based","title":"A Generative User Simulator with GPT-based Architecture and Goal State Tracking for Reinforced Multi-Domain Dialog Systems","date":"2022-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-spmi/gus","path":"clean_dataset.py","file_url":"https://github.com/thu-spmi/gus/blob/HEAD/clean_dataset.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":"4c62f23ce8135bda","code_sha256_prefix":"4c62f23ce8135bda","mcp_get_code":{"code_sha256":"4c62f23ce8135bda"}},{"arxiv_id":"2204.00763","arxiv_id_is_arxiv":true,"paper":"/paper/metaphorical-user-simulators-for-evaluating","title":"Metaphorical User Simulators for Evaluating Task-oriented Dialogue Systems","date":"2022-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"superbooming/simtester","path":"simtester/agent/damd/clean_dataset.py","file_url":"https://github.com/superbooming/simtester/blob/HEAD/simtester/agent/damd/clean_dataset.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":"4b48138f6d5166a1","code_sha256_prefix":"4b48138f6d5166a1","mcp_get_code":{"code_sha256":"4b48138f6d5166a1"}},{"arxiv_id":"2109.14739","arxiv_id_is_arxiv":true,"paper":"/paper/multi-task-pre-training-for-plug-and-play","title":"Multi-Task Pre-Training for Plug-and-Play Task-Oriented Dialogue System","date":"2021-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awslabs/pptod","path":"E2E_TOD/clean_dataset.py","file_url":"https://github.com/awslabs/pptod/blob/HEAD/E2E_TOD/clean_dataset.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":"4c62f23ce8135bda","code_sha256_prefix":"4c62f23ce8135bda","mcp_get_code":{"code_sha256":"4c62f23ce8135bda"}},{"arxiv_id":"2009.12005","arxiv_id_is_arxiv":true,"paper":"/paper/mintl-minimalist-transfer-learning-for-task","title":"MinTL: Minimalist Transfer Learning for Task-Oriented Dialogue Systems","date":"2020-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zlinao/MinTL","path":"damd_multiwoz/clean_dataset.py","file_url":"https://github.com/zlinao/MinTL/blob/HEAD/damd_multiwoz/clean_dataset.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":"4c62f23ce8135bda","code_sha256_prefix":"4c62f23ce8135bda","mcp_get_code":{"code_sha256":"4c62f23ce8135bda"}},{"arxiv_id":"2021.findings-emnlp.112","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.findings-emnlp.112","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"bepoetree/MTTOD","path":"utils/clean_dataset.py","file_url":"https://github.com/bepoetree/MTTOD/blob/HEAD/utils/clean_dataset.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":"4c62f23ce8135bda","code_sha256_prefix":"4c62f23ce8135bda","mcp_get_code":{"code_sha256":"4c62f23ce8135bda"}}],"record_sha256":"b6e7e724678e413c09b8c2e2fc679f7bda03ae95c13c4b4f347093485298161f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}