{"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/clear-output","entry":"clear_output","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":5,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":7,"n_places_pointer_only":1,"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":1,"ran_fixture":0,"ran":4,"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":"2608.06310","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-06310","title":"RRC: Unlocking Generative Reward Models in LLM Reinforcement Learning via Ranking-Based Reward Construction","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"allenai/WildBench","path":"src/unified_utils.py","file_url":"https://github.com/allenai/WildBench/blob/HEAD/src/unified_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bab78e56b3db5391","code_sha256_prefix":"bab78e56b3db5391","mcp_get_code":{"code_sha256":"bab78e56b3db5391"}},{"arxiv_id":"2408.14774","arxiv_id_is_arxiv":true,"paper":"/paper/instruct-skillmix-a-powerful-pipeline-for-llm","title":"Instruct-SkillMix: A Powerful Pipeline for LLM Instruction Tuning","date":"2024-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-pli/Instruct-SkillMix","path":"WildBench/src/unified_utils.py","file_url":"https://github.com/princeton-pli/Instruct-SkillMix/blob/HEAD/WildBench/src/unified_utils.py","status":"ran","verification_level":1,"contract_check":null,"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, princeton-pli/Instruct-SkillMix when it was checked","code_sha256":"5997e26073b93ac2","code_sha256_prefix":"5997e26073b93ac2","mcp_get_code":{"code_sha256":"5997e26073b93ac2"}},{"arxiv_id":"2406.04770","arxiv_id_is_arxiv":true,"paper":"/paper/wildbench-benchmarking-llms-with-challenging","title":"WildBench: Benchmarking LLMs with Challenging Tasks from Real Users in the Wild","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/wildbench","path":"src/unified_utils.py","file_url":"https://github.com/allenai/wildbench/blob/HEAD/src/unified_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bab78e56b3db5391","code_sha256_prefix":"bab78e56b3db5391","mcp_get_code":{"code_sha256":"bab78e56b3db5391"}},{"arxiv_id":"2406.04127","arxiv_id_is_arxiv":true,"paper":"/paper/are-we-done-with-mmlu","title":"Are We Done with MMLU?","date":"2024-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wildeval/zeroeval","path":"src/unified_utils.py","file_url":"https://github.com/wildeval/zeroeval/blob/HEAD/src/unified_utils.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":"27c94753060ee864","code_sha256_prefix":"27c94753060ee864","mcp_get_code":{"code_sha256":"27c94753060ee864"}},{"arxiv_id":"2405.19874","arxiv_id_is_arxiv":true,"paper":"/paper/is-in-context-learning-sufficient-for","title":"Is In-Context Learning Sufficient for Instruction Following in LLMs?","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tml-epfl/icl-alignment","path":"src/unified_utils.py","file_url":"https://github.com/tml-epfl/icl-alignment/blob/HEAD/src/unified_utils.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":"484169aa666774ae","code_sha256_prefix":"484169aa666774ae","mcp_get_code":{"code_sha256":"484169aa666774ae"}},{"arxiv_id":"1911.03705","arxiv_id_is_arxiv":true,"paper":"/paper/commongen-a-constrained-text-generation","title":"CommonGen: A Constrained Text Generation Challenge for Generative Commonsense Reasoning","date":"2019-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/CommonGen-Eval","path":"data_utils.py","file_url":"https://github.com/allenai/CommonGen-Eval/blob/HEAD/data_utils.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":"e00658a45cf979c4","code_sha256_prefix":"e00658a45cf979c4","mcp_get_code":{"code_sha256":"e00658a45cf979c4"}},{"arxiv_id":"2024.findings-emnlp.504","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-emnlp.504","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Re-Align/URIAL","path":"src/unified_utils.py","file_url":"https://github.com/Re-Align/URIAL/blob/HEAD/src/unified_utils.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":"484169aa666774ae","code_sha256_prefix":"484169aa666774ae","mcp_get_code":{"code_sha256":"484169aa666774ae"}}],"record_sha256":"3c44b4f9a8a8639760f97a7a6de89ed2390024bc203ec19968eb2bcf403e8bd7","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}