{"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/dispatch-model","entry":"dispatch_model","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":3,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":3,"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":5,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":4,"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":1,"ran_fixture":1,"ran":0,"unverified":3},"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":"2502.19805","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-search-via-discrete-diffusion-a","title":"Implicit Search via Discrete Diffusion: A Study on Chess","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUNLP/DiffuSearch","path":"src/llmtuner/extras/misc.py","file_url":"https://github.com/HKUNLP/DiffuSearch/blob/HEAD/src/llmtuner/extras/misc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from wujwyi/CMC, and GitHub detected no licence in that repository when it was checked","code_sha256":"7aba54878bdf4a47","code_sha256_prefix":"7aba54878bdf4a47","mcp_get_code":{"code_sha256":"7aba54878bdf4a47"}},{"arxiv_id":"2410.17599","arxiv_id_is_arxiv":true,"paper":"/paper/cross-model-control-improving-multiple-large","title":"Cross-model Control: Improving Multiple Large Language Models in One-time Training","date":"2024-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wujwyi/CMC","path":"eval/chat_model.py","file_url":"https://github.com/wujwyi/CMC/blob/HEAD/eval/chat_model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, wujwyi/CMC when it was checked","code_sha256":"ec441092c93ad116","code_sha256_prefix":"ec441092c93ad116","mcp_get_code":{"code_sha256":"ec441092c93ad116"}},{"arxiv_id":"2410.17599","arxiv_id_is_arxiv":true,"paper":"/paper/cross-model-control-improving-multiple-large","title":"Cross-model Control: Improving Multiple Large Language Models in One-time Training","date":"2024-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wujwyi/CMC","path":"full_finetune/train_base_model.py","file_url":"https://github.com/wujwyi/CMC/blob/HEAD/full_finetune/train_base_model.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, wujwyi/CMC when it was checked","code_sha256":"7aba54878bdf4a47","code_sha256_prefix":"7aba54878bdf4a47","mcp_get_code":{"code_sha256":"7aba54878bdf4a47"}},{"arxiv_id":"2410.14157","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-autoregression-discrete-diffusion-for","title":"Beyond Autoregression: Discrete Diffusion for Complex Reasoning and Planning","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUNLP/diffusion-vs-ar","path":"src/llmtuner/extras/misc.py","file_url":"https://github.com/HKUNLP/diffusion-vs-ar/blob/HEAD/src/llmtuner/extras/misc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from wujwyi/CMC, and GitHub detected no licence in that repository when it was checked","code_sha256":"7aba54878bdf4a47","code_sha256_prefix":"7aba54878bdf4a47","mcp_get_code":{"code_sha256":"7aba54878bdf4a47"}},{"arxiv_id":"2311.13246","arxiv_id_is_arxiv":true,"paper":"/paper/automatic-instruction-optimization-for-open","title":"CoachLM: Automatic Instruction Revisions Improve the Data Quality in LLM Instruction Tuning","date":"2023-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lunyiliu/coachlm","path":"src/glmtuner/extras/misc.py","file_url":"https://github.com/lunyiliu/coachlm/blob/HEAD/src/glmtuner/extras/misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"543d67c660c2b808","code_sha256_prefix":"543d67c660c2b808","mcp_get_code":{"code_sha256":"543d67c660c2b808"}},{"arxiv_id":"2003.12908","arxiv_id_is_arxiv":true,"paper":"/paper/coping-with-simulators-that-don-t-always","title":"Coping With Simulators That Don't Always Return","date":"2020-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plai-group/stdr","path":"src/maf.py","file_url":"https://github.com/plai-group/stdr/blob/HEAD/src/maf.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":"9ef8997ec69574ae","code_sha256_prefix":"9ef8997ec69574ae","mcp_get_code":{"code_sha256":"9ef8997ec69574ae"}},{"arxiv_id":"1910.09056","arxiv_id_is_arxiv":true,"paper":"/paper/amortized-rejection-sampling-in-universal","title":"Amortized Rejection Sampling in Universal Probabilistic Programming","date":"2019-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plai-group/amortized-rejection-sampling","path":"utils.py","file_url":"https://github.com/plai-group/amortized-rejection-sampling/blob/HEAD/utils.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":"d5c7e8c1c3cbedaa","code_sha256_prefix":"d5c7e8c1c3cbedaa","mcp_get_code":{"code_sha256":"d5c7e8c1c3cbedaa"}}],"record_sha256":"c71bc451e263a287ef6a4b0c54ccaeb83a32aa6dfccb69db97017b977867d283","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}