{"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/read-problems","entry":"read_problems","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":17,"n_papers_ran":16,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":14,"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":12,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":9,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":18,"n_places_pointer_only":6,"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":9,"ran_fixture":0,"ran":2,"unverified":1},"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":"2606.05859","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-05859","title":"TARPO: Token-Wise Latent-Explicit Reasoning via Action-Routing Policy Optimization","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"NKU-LITI/TARPO-master","path":"humanevaleval.py","file_url":"https://github.com/NKU-LITI/TARPO-master/blob/HEAD/humanevaleval.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, NKU-LITI/TARPO-master when it was checked","code_sha256":"e289de48f4ad6a1e","code_sha256_prefix":"e289de48f4ad6a1e","mcp_get_code":{"code_sha256":"e289de48f4ad6a1e"}},{"arxiv_id":"2604.23626","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-23626","title":"GraphPlanner: Graph Memory-Augmented Agentic Routing for Multi-Agent LLMs","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"ulab-uiuc/GraphPlanner","path":"router_planner/shared/evaluation/human_eval/data.py","file_url":"https://github.com/ulab-uiuc/GraphPlanner/blob/HEAD/router_planner/shared/evaluation/human_eval/data.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, ulab-uiuc/GraphPlanner when it was checked","code_sha256":"16c6b5cd0ca7e8e3","code_sha256_prefix":"16c6b5cd0ca7e8e3","mcp_get_code":{"code_sha256":"16c6b5cd0ca7e8e3"}},{"arxiv_id":"2604.12268","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-12268","title":"CODESPECBENCH: Benchmarking LLMs for Executable Behavioral Specification Generation","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"SparksofAGI/CodeSpecBench","path":"CodeSpecBench-Func/spec-verifier/evaluation.py","file_url":"https://github.com/SparksofAGI/CodeSpecBench/blob/HEAD/CodeSpecBench-Func/spec-verifier/evaluation.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, SparksofAGI/CodeSpecBench when it was checked","code_sha256":"1e2d6367f1b86235","code_sha256_prefix":"1e2d6367f1b86235","mcp_get_code":{"code_sha256":"1e2d6367f1b86235"}},{"arxiv_id":"2602.13773","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-13773","title":"On Representation Redundancy in Large-Scale Instruction Tuning Data Selection","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"tdano1/CRDS","path":"main/eval/codex_humaneval/data.py","file_url":"https://github.com/tdano1/CRDS/blob/HEAD/main/eval/codex_humaneval/data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"776a712a353130e7","code_sha256_prefix":"776a712a353130e7","mcp_get_code":{"code_sha256":"776a712a353130e7"}},{"arxiv_id":"2602.02979","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-02979","title":"CPMöbius: Iterative Coach-Player Reasoning for Data-Free Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"thunlp/CPMobius","path":"evaluation/utils/data.py","file_url":"https://github.com/thunlp/CPMobius/blob/HEAD/evaluation/utils/data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"562c0ef13357b53b","code_sha256_prefix":"562c0ef13357b53b","mcp_get_code":{"code_sha256":"562c0ef13357b53b"}},{"arxiv_id":"2502.01456","arxiv_id_is_arxiv":true,"paper":"/paper/process-reinforcement-through-implicit","title":"Process Reinforcement through Implicit Rewards","date":"2025-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prime-rl/prime","path":"eval/utils/data.py","file_url":"https://github.com/prime-rl/prime/blob/HEAD/eval/utils/data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"562c0ef13357b53b","code_sha256_prefix":"562c0ef13357b53b","mcp_get_code":{"code_sha256":"562c0ef13357b53b"}},{"arxiv_id":"2407.01910","arxiv_id_is_arxiv":true,"paper":"/paper/mg-verilog-multi-grained-dataset-towards","title":"MG-Verilog: Multi-grained Dataset Towards Enhanced LLM-assisted Verilog Generation","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luke-avionics/mg-verilog","path":"verilog_eval/verilog_eval/data.py","file_url":"https://github.com/luke-avionics/mg-verilog/blob/HEAD/verilog_eval/verilog_eval/data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c06721d357c61091","code_sha256_prefix":"c06721d357c61091","mcp_get_code":{"code_sha256":"c06721d357c61091"}},{"arxiv_id":"2404.02078","arxiv_id_is_arxiv":true,"paper":"/paper/advancing-llm-reasoning-generalists-with","title":"Advancing LLM Reasoning Generalists with Preference Trees","date":"2024-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openbmb/eurus","path":"eval/Coding/leetcode/data.py","file_url":"https://github.com/openbmb/eurus/blob/HEAD/eval/Coding/leetcode/data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"776a712a353130e7","code_sha256_prefix":"776a712a353130e7","mcp_get_code":{"code_sha256":"776a712a353130e7"}},{"arxiv_id":"2404.02078","arxiv_id_is_arxiv":true,"paper":"/paper/advancing-llm-reasoning-generalists-with","title":"Advancing LLM Reasoning Generalists with Preference Trees","date":"2024-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openbmb/eurus","path":"eval/utils/data.py","file_url":"https://github.com/openbmb/eurus/blob/HEAD/eval/utils/data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2a1cf35aaf759bca","code_sha256_prefix":"2a1cf35aaf759bca","mcp_get_code":{"code_sha256":"2a1cf35aaf759bca"}},{"arxiv_id":"2402.14852","arxiv_id_is_arxiv":true,"paper":"/paper/humaneval-on-latest-gpt-models-2024","title":"HumanEval on Latest GPT Models -- 2024","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daniel442li/gpt-human-eval","path":"human_eval/data.py","file_url":"https://github.com/daniel442li/gpt-human-eval/blob/HEAD/human_eval/data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"776a712a353130e7","code_sha256_prefix":"776a712a353130e7","mcp_get_code":{"code_sha256":"776a712a353130e7"}},{"arxiv_id":"2401.16405","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-sparse-fine-tuning-to-large-language","title":"Scaling Sparse Fine-Tuning to Large Language Models","date":"2024-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ducdauge/sft-llm","path":"eval/codex_humaneval/data.py","file_url":"https://github.com/ducdauge/sft-llm/blob/HEAD/eval/codex_humaneval/data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"776a712a353130e7","code_sha256_prefix":"776a712a353130e7","mcp_get_code":{"code_sha256":"776a712a353130e7"}},{"arxiv_id":"2401.14196","arxiv_id_is_arxiv":true,"paper":"/paper/deepseek-coder-when-the-large-language-model","title":"DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligence","date":"2024-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepseek-ai/DeepSeek-Coder","path":"Evaluation/HumanEval/human_eval/data.py","file_url":"https://github.com/deepseek-ai/DeepSeek-Coder/blob/HEAD/Evaluation/HumanEval/human_eval/data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"21359df82e68e215","code_sha256_prefix":"21359df82e68e215","mcp_get_code":{"code_sha256":"21359df82e68e215"}},{"arxiv_id":"2401.08565","arxiv_id_is_arxiv":true,"paper":"/paper/tuning-language-models-by-proxy","title":"Tuning Language Models by Proxy","date":"2024-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alisawuffles/proxy-tuning","path":"eval/codex_humaneval/data.py","file_url":"https://github.com/alisawuffles/proxy-tuning/blob/HEAD/eval/codex_humaneval/data.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, alisawuffles/proxy-tuning when it was checked","code_sha256":"776a712a353130e7","code_sha256_prefix":"776a712a353130e7","mcp_get_code":{"code_sha256":"776a712a353130e7"}},{"arxiv_id":"2401.06628","arxiv_id_is_arxiv":true,"paper":"/paper/oop-object-oriented-programming-evaluation","title":"OOP: Object-Oriented Programming Evaluation Benchmark for Large Language Models","date":"2024-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alphadl/oop-eval","path":"oop_evaluate/data.py","file_url":"https://github.com/alphadl/oop-eval/blob/HEAD/oop_evaluate/data.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, alphadl/oop-eval when it was checked","code_sha256":"16310fe23c55a895","code_sha256_prefix":"16310fe23c55a895","mcp_get_code":{"code_sha256":"16310fe23c55a895"}},{"arxiv_id":"2310.20329","arxiv_id_is_arxiv":true,"paper":"/paper/instructcoder-empowering-language-models-for","title":"InstructCoder: Instruction Tuning Large Language Models for Code Editing","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qishenghu/CodeInstruct","path":"edit_eval/data.py","file_url":"https://github.com/qishenghu/CodeInstruct/blob/HEAD/edit_eval/data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"776a712a353130e7","code_sha256_prefix":"776a712a353130e7","mcp_get_code":{"code_sha256":"776a712a353130e7"}},{"arxiv_id":"2310.06830","arxiv_id_is_arxiv":true,"paper":"/paper/lemur-harmonizing-natural-language-and-code","title":"Lemur: Harmonizing Natural Language and Code for Language Agents","date":"2023-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenLemur/Lemur","path":"xchat/eval/mbpp/data.py","file_url":"https://github.com/OpenLemur/Lemur/blob/HEAD/xchat/eval/mbpp/data.py","status":"ran","verification_level":1,"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":"1cf1721a0bcb876e","code_sha256_prefix":"1cf1721a0bcb876e","mcp_get_code":{"code_sha256":"1cf1721a0bcb876e"}},{"arxiv_id":"2207.14255","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-training-of-language-models-to-fill","title":"Efficient Training of Language Models to Fill in the Middle","date":"2022-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openai/human-eval-infilling","path":"human_eval_infilling/data.py","file_url":"https://github.com/openai/human-eval-infilling/blob/HEAD/human_eval_infilling/data.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":"c3e6a38615ffe825","code_sha256_prefix":"c3e6a38615ffe825","mcp_get_code":{"code_sha256":"c3e6a38615ffe825"}},{"arxiv_id":"2107.03374","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-large-language-models-trained-on","title":"Evaluating Large Language Models Trained on Code","date":"2021-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"2796gaurav/human-eval","path":"human_eval/data.py","file_url":"https://github.com/2796gaurav/human-eval/blob/HEAD/human_eval/data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, 2796gaurav/human-eval, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"d3d6eed5a7c21746","code_sha256_prefix":"d3d6eed5a7c21746","mcp_get_code":{"code_sha256":"d3d6eed5a7c21746"}}],"record_sha256":"4362e4843403a4d795a5361a2053f1f7f1198027601b744eac8237916e8cc37a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}