{"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/shuffledict","entry":"shuffleDict","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":0,"n_papers_ran_instrument_only":6,"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":1,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":6,"n_places_pointer_only_link_open":3,"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":0,"ran":0,"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":"2409.04057","arxiv_id_is_arxiv":true,"paper":"/paper/self-harmonized-chain-of-thought","title":"Self-Harmonized Chain of Thought","date":"2024-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Xalp/ECHO","path":"utils.py","file_url":"https://github.com/Xalp/ECHO/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Xalp/ECHO when it was checked","code_sha256":"ae2495a11361cc1d","code_sha256_prefix":"ae2495a11361cc1d","mcp_get_code":{"code_sha256":"ae2495a11361cc1d"}},{"arxiv_id":"2407.07099","arxiv_id_is_arxiv":true,"paper":"/paper/nash-cot-multi-path-inference-with-preference","title":"Nash CoT: Multi-Path Inference with Preference Equilibrium","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-science/auto-cot","path":"utils.py","file_url":"https://github.com/amazon-science/auto-cot/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 nku-hlt/role-play-prompting, and GitHub detected no licence in that repository when it was checked","code_sha256":"ae2495a11361cc1d","code_sha256_prefix":"ae2495a11361cc1d","mcp_get_code":{"code_sha256":"ae2495a11361cc1d"}},{"arxiv_id":"2401.04925","arxiv_id_is_arxiv":true,"paper":"/paper/the-impact-of-reasoning-step-length-on-large","title":"The Impact of Reasoning Step Length on Large Language Models","date":"2024-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jmyissb/The-Impact-of-Reasoning-Step-Length-on-Large-Language-Models","path":"utils.py","file_url":"https://github.com/jmyissb/The-Impact-of-Reasoning-Step-Length-on-Large-Language-Models/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jmyissb/The-Impact-of-Reasoning-Step-Length-on-Large-Language-Models when it was checked","code_sha256":"ae2495a11361cc1d","code_sha256_prefix":"ae2495a11361cc1d","mcp_get_code":{"code_sha256":"ae2495a11361cc1d"}},{"arxiv_id":"2308.07702","arxiv_id_is_arxiv":true,"paper":"/paper/better-zero-shot-reasoning-with-role-play","title":"Better Zero-Shot Reasoning with Role-Play Prompting","date":"2023-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nku-hlt/role-play-prompting","path":"utils.py","file_url":"https://github.com/nku-hlt/role-play-prompting/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nku-hlt/role-play-prompting when it was checked","code_sha256":"ae2495a11361cc1d","code_sha256_prefix":"ae2495a11361cc1d","mcp_get_code":{"code_sha256":"ae2495a11361cc1d"}},{"arxiv_id":"2210.03493","arxiv_id_is_arxiv":true,"paper":"/paper/automatic-chain-of-thought-prompting-in-large","title":"Automatic Chain of Thought Prompting in Large Language Models","date":"2022-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-research/auto-cot","path":"utils.py","file_url":"https://github.com/amazon-research/auto-cot/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 nku-hlt/role-play-prompting, and GitHub detected no licence in that repository when it was checked","code_sha256":"ae2495a11361cc1d","code_sha256_prefix":"ae2495a11361cc1d","mcp_get_code":{"code_sha256":"ae2495a11361cc1d"}},{"arxiv_id":"2024.emnlp-main.758","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.emnlp-main.758","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HuangOwen/CoT-Influx","path":"utils.py","file_url":"https://github.com/HuangOwen/CoT-Influx/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from nku-hlt/role-play-prompting, and GitHub detected no licence in that repository when it was checked","code_sha256":"ae2495a11361cc1d","code_sha256_prefix":"ae2495a11361cc1d","mcp_get_code":{"code_sha256":"ae2495a11361cc1d"}}],"record_sha256":"47a7c93cbe338d4705356c2615391010eecb5fee0f9d3fdc87c9d73a4ddf4354","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}