{"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":"/sota/code-generation-on-mbpp","task":{"name":"Code Generation","url":"/task/code-generation","note":null},"dataset":{"name":"MBPP","url":"/dataset/mbpp"},"category":"Natural Language Processing","categories":["Computer Code","Natural Language Processing","Reasoning"],"category_note":null,"description":"**Code Generation** is an important field to predict explicit code or program structure from multimodal data sources such as incomplete code, programs in another programming language, natural language descriptions or execution examples. Code Generation tools can assist the development of automatic programming tools to improve programming productivity.\r\n\r\n\r\n<span class=\"description-source\">Source: [Deep Learning for Source Code Modeling and Generation ](https://arxiv.org/abs/2002.05442)</span>\r\n\r\nImage source: [Measuring Coding Challenge Competence With APPS](https://paperswithcode.com/paper/measuring-coding-challenge-competence-with)","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Accuracy"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction; the tokens 'score' and 'time' are not used on this page); null = not inferred, chart draws points only","by_metric":{"Accuracy":"higher"}},"counts":{"rows":99,"rows_with_code":88,"rows_with_paper_page":98,"rows_dated":98,"rows_using_additional_data":10},"rows":[{"rank_in_archive_order":1,"model":"EG-CFG (DeepSeek-V3-0324)","metrics":{"Accuracy":"96.6"},"uses_additional_data":false,"paper_date":"2025-06-12","paper":"/paper/execution-guided-line-by-line-code-generation","paper_url":"https://arxiv.org/abs/2506.10948v1","paper_title":"Execution Guided Line-by-Line Code Generation","code":"https://github.com/boazlavon/eg_cfg","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":2,"model":"QualityFlow (Sonnet-3.5)","metrics":{"Accuracy":"94.2"},"uses_additional_data":false,"paper_date":"2025-01-20","paper":"/paper/qualityflow-an-agentic-workflow-for-program","paper_url":"https://arxiv.org/abs/2501.17167v2","paper_title":"QualityFlow: An Agentic Workflow for Program Synthesis Controlled by LLM Quality Checks","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":3,"model":"o1-mini + MapCoder (Hamming.ai)","metrics":{"Accuracy":"93.2"},"uses_additional_data":true,"paper_date":"2024-05-18","paper":"/paper/mapcoder-multi-agent-code-generation-for","paper_url":"https://arxiv.org/abs/2405.11403v1","paper_title":"MapCoder: Multi-Agent Code Generation for Competitive Problem Solving","code":"https://github.com/md-ashraful-pramanik/mapcoder","n_code_links":2,"official":{"repos":["md-ashraful-pramanik/mapcoder"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"syntology":{"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_samples":10,"n_pointer_only_licence":0,"sample_list":"/paper/mapcoder-multi-agent-code-generation-for#ran","syntology_url":"https://syntology.ai/paper/2405.11403","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.11403"}}}},{"rank_in_archive_order":4,"model":"MGDebugger (DeepSeek-V3-0324)","metrics":{"Accuracy":"92.4"},"uses_additional_data":false,"paper_date":"2024-10-02","paper":"/paper/from-code-to-correctness-closing-the-last","paper_url":"https://arxiv.org/abs/2410.01215v2","paper_title":"From Code to Correctness: Closing the Last Mile of Code Generation with Hierarchical Debugging","code":"https://github.com/YerbaPage/MGDebugger","n_code_links":1,"official":{"repos":["YerbaPage/MGDebugger"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":1,"n_samples":9,"n_pointer_only_licence":0,"sample_list":"/paper/from-code-to-correctness-closing-the-last#ran","syntology_url":"https://syntology.ai/paper/2410.01215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.01215"}}}},{"rank_in_archive_order":5,"model":"GPT-4 + AgentCoder","metrics":{"Accuracy":"91.8"},"uses_additional_data":false,"paper_date":"2023-12-20","paper":"/paper/agentcoder-multi-agent-based-code-generation","paper_url":"https://arxiv.org/abs/2312.13010v3","paper_title":"AgentCoder: Multi-Agent-based Code Generation with Iterative Testing and Optimisation","code":"https://github.com/huangd1999/AgentCoder","n_code_links":1,"official":{"repos":["huangd1999/AgentCoder"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1,"sample_list":"/paper/agentcoder-multi-agent-based-code-generation#ran","syntology_url":"https://syntology.ai/paper/2312.13010","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.13010"}}}},{"rank_in_archive_order":6,"model":"CodeSim (GPT4o)","metrics":{"Accuracy":"90.7"},"uses_additional_data":false,"paper_date":"2025-02-08","paper":"/paper/codesim-multi-agent-code-generation-and-1","paper_url":"https://arxiv.org/abs/2502.05664v1","paper_title":"CODESIM: Multi-Agent Code Generation and Problem Solving through Simulation-Driven Planning and Debugging","code":"https://github.com/kagnlp/CodeGenerator","n_code_links":1,"official":null,"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":0,"sample_list":"/paper/codesim-multi-agent-code-generation-and-1#ran","syntology_url":"https://syntology.ai/paper/2502.05664","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.05664"}}}},{"rank_in_archive_order":7,"model":"Jiutian-大模型","metrics":{"Accuracy":"90.0"},"uses_additional_data":false,"paper_date":null,"paper":null,"paper_url":null,"paper_title":"","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":8,"model":"GPT-3.5 Turbo (ChatGPT) + AgentCoder","metrics":{"Accuracy":"89.9"},"uses_additional_data":false,"paper_date":"2023-12-20","paper":"/paper/agentcoder-multi-agent-based-code-generation","paper_url":"https://arxiv.org/abs/2312.13010v3","paper_title":"AgentCoder: Multi-Agent-based Code Generation with Iterative Testing and Optimisation","code":"https://github.com/huangd1999/AgentCoder","n_code_links":1,"official":{"repos":["huangd1999/AgentCoder"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1,"sample_list":"/paper/agentcoder-multi-agent-based-code-generation#ran","syntology_url":"https://syntology.ai/paper/2312.13010","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.13010"}}}},{"rank_in_archive_order":9,"model":"MapCoder (GPT-4o)","metrics":{"Accuracy":"89.7"},"uses_additional_data":false,"paper_date":"2024-05-18","paper":"/paper/mapcoder-multi-agent-code-generation-for","paper_url":"https://arxiv.org/abs/2405.11403v1","paper_title":"MapCoder: Multi-Agent Code Generation for Competitive Problem Solving","code":"https://github.com/md-ashraful-pramanik/mapcoder","n_code_links":2,"official":{"repos":["md-ashraful-pramanik/mapcoder"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"syntology":{"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_samples":10,"n_pointer_only_licence":0,"sample_list":"/paper/mapcoder-multi-agent-code-generation-for#ran","syntology_url":"https://syntology.ai/paper/2405.11403","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.11403"}}}},{"rank_in_archive_order":10,"model":"GPT-4 (ChatGPT Plus)","metrics":{"Accuracy":"87.5"},"uses_additional_data":false,"paper_date":"2023-07-24","paper":"/paper/chatgpt-for-software-security-exploring-the","paper_url":"https://arxiv.org/abs/2307.12488v5","paper_title":"How Does Naming Affect LLMs on Code Analysis Tasks?","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":11,"model":"Claude 3 Opus","metrics":{"Accuracy":"86.4"},"uses_additional_data":false,"paper_date":"2024-03-04","paper":"/paper/the-claude-3-model-family-opus-sonnet-haiku","paper_url":"https://www.anthropic.com/news/claude-3-family","paper_title":"The Claude 3 Model Family: Opus, Sonnet, Haiku","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":12,"model":"LPW (GPT-4o)","metrics":{"Accuracy":"84.8"},"uses_additional_data":false,"paper_date":"2024-11-21","paper":"/paper/planning-driven-programming-a-large-language","paper_url":"https://arxiv.org/abs/2411.14503v3","paper_title":"Planning-Driven Programming: A Large Language Model Programming Workflow","code":"https://github.com/you68681/lpw","n_code_links":1,"official":{"repos":["you68681/lpw"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":4,"n_instrument":5,"n_unverified":0,"n_samples":9,"n_pointer_only_licence":0,"sample_list":"/paper/planning-driven-programming-a-large-language#ran","syntology_url":"https://syntology.ai/paper/2411.14503","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.14503"}}}},{"rank_in_archive_order":13,"model":"GPT-3.5 Turbo + FlowGenScrum + Test","metrics":{"Accuracy":"83.8±0.6"},"uses_additional_data":false,"paper_date":"2024-03-23","paper":"/paper/when-llm-based-code-generation-meets-the","paper_url":"https://arxiv.org/abs/2403.15852v2","paper_title":"SOEN-101: Code Generation by Emulating Software Process Models Using Large Language Model Agents","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":14,"model":"AFlow(GPT-4o-mini)","metrics":{"Accuracy":"83.4"},"uses_additional_data":false,"paper_date":"2024-10-14","paper":"/paper/aflow-automating-agentic-workflow-generation","paper_url":"https://arxiv.org/abs/2410.10762v4","paper_title":"AFlow: Automating Agentic Workflow Generation","code":"https://github.com/geekan/metagpt","n_code_links":4,"official":null,"syntology":null},{"rank_in_archive_order":15,"model":"GPT-3.5 Turbo (ChatGPT)","metrics":{"Accuracy":"83.2"},"uses_additional_data":false,"paper_date":"2023-07-24","paper":"/paper/chatgpt-for-software-security-exploring-the","paper_url":"https://arxiv.org/abs/2307.12488v5","paper_title":"How Does Naming Affect LLMs on Code Analysis Tasks?","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":16,"model":"EG-CFG (DeepSeek Coder 1.3b Instruct)","metrics":{"Accuracy":"83.2"},"uses_additional_data":false,"paper_date":"2025-06-12","paper":"/paper/execution-guided-line-by-line-code-generation","paper_url":"https://arxiv.org/abs/2506.10948v1","paper_title":"Execution Guided Line-by-Line Code Generation","code":"https://github.com/boazlavon/eg_cfg","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":17,"model":"MapCoder (GPT-4)","metrics":{"Accuracy":"83.1"},"uses_additional_data":false,"paper_date":"2024-05-18","paper":"/paper/mapcoder-multi-agent-code-generation-for","paper_url":"https://arxiv.org/abs/2405.11403v1","paper_title":"MapCoder: Multi-Agent Code Generation for Competitive Problem Solving","code":"https://github.com/md-ashraful-pramanik/mapcoder","n_code_links":2,"official":{"repos":["md-ashraful-pramanik/mapcoder"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"syntology":{"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_samples":10,"n_pointer_only_licence":0,"sample_list":"/paper/mapcoder-multi-agent-code-generation-for#ran","syntology_url":"https://syntology.ai/paper/2405.11403","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.11403"}}}},{"rank_in_archive_order":18,"model":"o1-mini + Language Agent Tree Search (Hamming.ai)","metrics":{"Accuracy":"82.3"},"uses_additional_data":false,"paper_date":"2023-10-06","paper":"/paper/language-agent-tree-search-unifies-reasoning","paper_url":"https://arxiv.org/abs/2310.04406v3","paper_title":"Language Agent Tree Search Unifies Reasoning Acting and Planning in Language Models","code":"https://github.com/lapisrocks/languageagenttreesearch","n_code_links":2,"official":{"repos":["lapisrocks/languageagenttreesearch","andyz245/LanguageAgentTreeSearch"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":0,"n_samples":9,"n_pointer_only_licence":2,"sample_list":"/paper/language-agent-tree-search-unifies-reasoning#ran","syntology_url":"https://syntology.ai/paper/2310.04406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.04406"}}}},{"rank_in_archive_order":19,"model":"GPT-4 (Bing Chat)","metrics":{"Accuracy":"82"},"uses_additional_data":false,"paper_date":"2023-07-24","paper":"/paper/chatgpt-for-software-security-exploring-the","paper_url":"https://arxiv.org/abs/2307.12488v5","paper_title":"How Does Naming Affect LLMs on Code Analysis Tasks?","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":20,"model":"GPT-3.5 Turbo + Language Agent Tree Search","metrics":{"Accuracy":"81.1"},"uses_additional_data":false,"paper_date":"2023-10-06","paper":"/paper/language-agent-tree-search-unifies-reasoning","paper_url":"https://arxiv.org/abs/2310.04406v3","paper_title":"Language Agent Tree Search Unifies Reasoning Acting and Planning in Language Models","code":"https://github.com/lapisrocks/languageagenttreesearch","n_code_links":2,"official":{"repos":["lapisrocks/languageagenttreesearch","andyz245/LanguageAgentTreeSearch"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":0,"n_samples":9,"n_pointer_only_licence":2,"sample_list":"/paper/language-agent-tree-search-unifies-reasoning#ran","syntology_url":"https://syntology.ai/paper/2310.04406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.04406"}}}},{"rank_in_archive_order":21,"model":"MGDebugger (CodeQwen1.5)","metrics":{"Accuracy":"80.8"},"uses_additional_data":false,"paper_date":"2024-10-02","paper":"/paper/from-code-to-correctness-closing-the-last","paper_url":"https://arxiv.org/abs/2410.01215v2","paper_title":"From Code to Correctness: Closing the Last Mile of Code Generation with Hierarchical Debugging","code":"https://github.com/YerbaPage/MGDebugger","n_code_links":1,"official":{"repos":["YerbaPage/MGDebugger"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":1,"n_samples":9,"n_pointer_only_licence":0,"sample_list":"/paper/from-code-to-correctness-closing-the-last#ran","syntology_url":"https://syntology.ai/paper/2410.01215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.01215"}}}},{"rank_in_archive_order":22,"model":"Claude 3 Haiku","metrics":{"Accuracy":"80.4"},"uses_additional_data":false,"paper_date":"2024-03-04","paper":"/paper/the-claude-3-model-family-opus-sonnet-haiku","paper_url":"https://www.anthropic.com/news/claude-3-family","paper_title":"The Claude 3 Model Family: Opus, Sonnet, Haiku","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":23,"model":"GPT-4 (Self-Debugging with unit tests + trace)","metrics":{"Accuracy":"80.2"},"uses_additional_data":false,"paper_date":"2023-04-11","paper":"/paper/teaching-large-language-models-to-self-debug","paper_url":"https://arxiv.org/abs/2304.05128v2","paper_title":"Teaching Large Language Models to Self-Debug","code":"https://github.com/amazon-science/SDFeedback","n_code_links":2,"official":null,"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0,"sample_list":"/paper/teaching-large-language-models-to-self-debug#ran","syntology_url":"https://syntology.ai/paper/2304.05128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.05128"}}}},{"rank_in_archive_order":24,"model":"GPT-4 (few-shot)","metrics":{"Accuracy":"80"},"uses_additional_data":true,"paper_date":"2024-01-25","paper":"/paper/deepseek-coder-when-the-large-language-model","paper_url":"https://arxiv.org/abs/2401.14196v2","paper_title":"DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligence","code":"https://github.com/deepseek-ai/DeepSeek-Coder","n_code_links":1,"official":{"repos":["deepseek-ai/DeepSeek-Coder"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":3,"n_instrument":6,"n_unverified":1,"n_samples":10,"n_pointer_only_licence":1,"sample_list":"/paper/deepseek-coder-when-the-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2401.14196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.14196"}}}},{"rank_in_archive_order":25,"model":"Claude 3 Sonnet","metrics":{"Accuracy":"79.4"},"uses_additional_data":false,"paper_date":"2024-03-04","paper":"/paper/the-claude-3-model-family-opus-sonnet-haiku","paper_url":"https://www.anthropic.com/news/claude-3-family","paper_title":"The Claude 3 Model Family: Opus, Sonnet, Haiku","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":26,"model":"Bard (PaLM 2/chat-bison-001)","metrics":{"Accuracy":"76.2"},"uses_additional_data":false,"paper_date":"2023-07-24","paper":"/paper/chatgpt-for-software-security-exploring-the","paper_url":"https://arxiv.org/abs/2307.12488v5","paper_title":"How Does Naming Affect LLMs on Code Analysis Tasks?","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":27,"model":"GPT-3.5 Turbo (Self-Debugging with unit tests + trace)","metrics":{"Accuracy":"72.8"},"uses_additional_data":false,"paper_date":"2023-04-11","paper":"/paper/teaching-large-language-models-to-self-debug","paper_url":"https://arxiv.org/abs/2304.05128v2","paper_title":"Teaching Large Language Models to Self-Debug","code":"https://github.com/amazon-science/SDFeedback","n_code_links":2,"official":null,"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0,"sample_list":"/paper/teaching-large-language-models-to-self-debug#ran","syntology_url":"https://syntology.ai/paper/2304.05128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.05128"}}}},{"rank_in_archive_order":28,"model":"Claude","metrics":{"Accuracy":"71.4"},"uses_additional_data":false,"paper_date":"2023-07-24","paper":"/paper/chatgpt-for-software-security-exploring-the","paper_url":"https://arxiv.org/abs/2307.12488v5","paper_title":"How Does Naming Affect LLMs on Code Analysis Tasks?","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":29,"model":"code-davinci-002 175B (Self-Debugging with unit tests + trace)","metrics":{"Accuracy":"70.8"},"uses_additional_data":false,"paper_date":"2023-04-11","paper":"/paper/teaching-large-language-models-to-self-debug","paper_url":"https://arxiv.org/abs/2304.05128v2","paper_title":"Teaching Large Language Models to Self-Debug","code":"https://github.com/amazon-science/SDFeedback","n_code_links":2,"official":null,"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0,"sample_list":"/paper/teaching-large-language-models-to-self-debug#ran","syntology_url":"https://syntology.ai/paper/2304.05128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.05128"}}}},{"rank_in_archive_order":30,"model":"GPT-3.5 Turbo (few-shot)","metrics":{"Accuracy":"70.8"},"uses_additional_data":true,"paper_date":"2024-01-25","paper":"/paper/deepseek-coder-when-the-large-language-model","paper_url":"https://arxiv.org/abs/2401.14196v2","paper_title":"DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligence","code":"https://github.com/deepseek-ai/DeepSeek-Coder","n_code_links":1,"official":{"repos":["deepseek-ai/DeepSeek-Coder"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":3,"n_instrument":6,"n_unverified":1,"n_samples":10,"n_pointer_only_licence":1,"sample_list":"/paper/deepseek-coder-when-the-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2401.14196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.14196"}}}},{"rank_in_archive_order":31,"model":"DeepSeek-Coder-Instruct 33B (few-shot)","metrics":{"Accuracy":"70"},"uses_additional_data":false,"paper_date":"2024-01-25","paper":"/paper/deepseek-coder-when-the-large-language-model","paper_url":"https://arxiv.org/abs/2401.14196v2","paper_title":"DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligence","code":"https://github.com/deepseek-ai/DeepSeek-Coder","n_code_links":1,"official":{"repos":["deepseek-ai/DeepSeek-Coder"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":3,"n_instrument":6,"n_unverified":1,"n_samples":10,"n_pointer_only_licence":1,"sample_list":"/paper/deepseek-coder-when-the-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2401.14196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.14196"}}}},{"rank_in_archive_order":32,"model":"GPT-3.5 Turbo + INTERVENOR","metrics":{"Accuracy":"69.8"},"uses_additional_data":false,"paper_date":"2023-11-16","paper":"/paper/intervenor-prompt-the-coding-ability-of-large","paper_url":"https://arxiv.org/abs/2311.09868v5","paper_title":"INTERVENOR: Prompting the Coding Ability of Large Language Models with the Interactive Chain of Repair","code":"https://github.com/neuir/intervenor","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":33,"model":"code-davinci-002 175B + LEVER","metrics":{"Accuracy":"68.9"},"uses_additional_data":false,"paper_date":"2023-02-16","paper":"/paper/lever-learning-to-verify-language-to-code","paper_url":"https://arxiv.org/abs/2302.08468v3","paper_title":"LEVER: Learning to Verify Language-to-Code Generation with Execution","code":"https://github.com/niansong1996/lever","n_code_links":1,"official":{"repos":["niansong1996/lever"],"state":"official (archive's flag): 18 ran","n_ran":18,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":4,"ran_from_kinds":["official"]},"syntology":{"n_ran":18,"n_constructed":0,"n_ran_checked":14,"n_instrument":4,"n_unverified":4,"n_samples":22,"n_pointer_only_licence":1,"sample_list":"/paper/lever-learning-to-verify-language-to-code#ran","syntology_url":"https://syntology.ai/paper/2302.08468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08468"}}}},{"rank_in_archive_order":34,"model":"code-davinci-002 175B + CodeT","metrics":{"Accuracy":"67.7"},"uses_additional_data":false,"paper_date":"2022-07-21","paper":"/paper/codet-code-generation-with-generated-tests","paper_url":"https://arxiv.org/abs/2207.10397v2","paper_title":"CodeT: Code Generation with Generated Tests","code":"https://github.com/microsoft/codet","n_code_links":1,"official":{"repos":["microsoft/codet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0,"sample_list":"/paper/codet-code-generation-with-generated-tests#ran","syntology_url":"https://syntology.ai/paper/2207.10397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10397"}}}},{"rank_in_archive_order":35,"model":"GPT-3.5 Turbo (3-shot)","metrics":{"Accuracy":"67.6"},"uses_additional_data":true,"paper_date":"2023-04-11","paper":"/paper/teaching-large-language-models-to-self-debug","paper_url":"https://arxiv.org/abs/2304.05128v2","paper_title":"Teaching Large Language Models to Self-Debug","code":"https://github.com/amazon-science/SDFeedback","n_code_links":2,"official":null,"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0,"sample_list":"/paper/teaching-large-language-models-to-self-debug#ran","syntology_url":"https://syntology.ai/paper/2304.05128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.05128"}}}},{"rank_in_archive_order":36,"model":"code-davinci-002 175B + Reviewer","metrics":{"Accuracy":"66.9"},"uses_additional_data":false,"paper_date":"2022-11-29","paper":"/paper/coder-reviewer-reranking-for-code-generation","paper_url":"https://arxiv.org/abs/2211.16490v1","paper_title":"Coder Reviewer Reranking for Code Generation","code":"https://github.com/facebookresearch/coder_reviewer_reranking","n_code_links":1,"official":{"repos":["facebookresearch/coder_reviewer_reranking"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/coder-reviewer-reranking-for-code-generation#ran","syntology_url":"https://syntology.ai/paper/2211.16490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.16490"}}}},{"rank_in_archive_order":37,"model":"code-davinci-002 175B + Coder-Reviewer","metrics":{"Accuracy":"66.4"},"uses_additional_data":false,"paper_date":"2022-11-29","paper":"/paper/coder-reviewer-reranking-for-code-generation","paper_url":"https://arxiv.org/abs/2211.16490v1","paper_title":"Coder Reviewer Reranking for Code Generation","code":"https://github.com/facebookresearch/coder_reviewer_reranking","n_code_links":1,"official":{"repos":["facebookresearch/coder_reviewer_reranking"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/coder-reviewer-reranking-for-code-generation#ran","syntology_url":"https://syntology.ai/paper/2211.16490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.16490"}}}},{"rank_in_archive_order":38,"model":"StarCoder2-15B","metrics":{"Accuracy":"66.2"},"uses_additional_data":false,"paper_date":"2024-02-29","paper":"/paper/starcoder-2-and-the-stack-v2-the-next","paper_url":"https://arxiv.org/abs/2402.19173v1","paper_title":"StarCoder 2 and The Stack v2: The Next Generation","code":"https://github.com/bigcode-project/starcoder2","n_code_links":4,"official":null,"syntology":null},{"rank_in_archive_order":39,"model":"DeepSeek-Coder-Base 33B (few-shot)","metrics":{"Accuracy":"66"},"uses_additional_data":false,"paper_date":"2024-01-25","paper":"/paper/deepseek-coder-when-the-large-language-model","paper_url":"https://arxiv.org/abs/2401.14196v2","paper_title":"DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligence","code":"https://github.com/deepseek-ai/DeepSeek-Coder","n_code_links":1,"official":{"repos":["deepseek-ai/DeepSeek-Coder"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":3,"n_instrument":6,"n_unverified":1,"n_samples":10,"n_pointer_only_licence":1,"sample_list":"/paper/deepseek-coder-when-the-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2401.14196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.14196"}}}},{"rank_in_archive_order":40,"model":"Code Llama - Python 70B (3-shot)","metrics":{"Accuracy":"65.5"},"uses_additional_data":true,"paper_date":"2023-08-24","paper":"/paper/code-llama-open-foundation-models-for-code","paper_url":"https://arxiv.org/abs/2308.12950v3","paper_title":"Code Llama: Open Foundation Models for Code","code":"https://github.com/facebookresearch/codellama","n_code_links":2,"official":{"repos":["facebookresearch/codellama"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":4,"sample_list":"/paper/code-llama-open-foundation-models-for-code#ran","syntology_url":"https://syntology.ai/paper/2308.12950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12950"}}}},{"rank_in_archive_order":41,"model":"DeepSeek-Coder-Instruct 6.7B (few-shot)","metrics":{"Accuracy":"65.4"},"uses_additional_data":false,"paper_date":"2024-01-25","paper":"/paper/deepseek-coder-when-the-large-language-model","paper_url":"https://arxiv.org/abs/2401.14196v2","paper_title":"DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligence","code":"https://github.com/deepseek-ai/DeepSeek-Coder","n_code_links":1,"official":{"repos":["deepseek-ai/DeepSeek-Coder"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":3,"n_instrument":6,"n_unverified":1,"n_samples":10,"n_pointer_only_licence":1,"sample_list":"/paper/deepseek-coder-when-the-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2401.14196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.14196"}}}},{"rank_in_archive_order":42,"model":"code-davinci-002 175B + MBR-Exec","metrics":{"Accuracy":"63"},"uses_additional_data":false,"paper_date":"2022-11-29","paper":"/paper/coder-reviewer-reranking-for-code-generation","paper_url":"https://arxiv.org/abs/2211.16490v1","paper_title":"Coder Reviewer Reranking for Code Generation","code":"https://github.com/facebookresearch/coder_reviewer_reranking","n_code_links":1,"official":{"repos":["facebookresearch/coder_reviewer_reranking"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/coder-reviewer-reranking-for-code-generation#ran","syntology_url":"https://syntology.ai/paper/2211.16490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.16490"}}}},{"rank_in_archive_order":43,"model":"Code Llama 70B (3-shot)","metrics":{"Accuracy":"62.4"},"uses_additional_data":false,"paper_date":"2023-08-24","paper":"/paper/code-llama-open-foundation-models-for-code","paper_url":"https://arxiv.org/abs/2308.12950v3","paper_title":"Code Llama: Open Foundation Models for Code","code":"https://github.com/facebookresearch/codellama","n_code_links":2,"official":{"repos":["facebookresearch/codellama"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":4,"sample_list":"/paper/code-llama-open-foundation-models-for-code#ran","syntology_url":"https://syntology.ai/paper/2308.12950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12950"}}}},{"rank_in_archive_order":44,"model":"Code Llama - Instruct 70B (3-shot)","metrics":{"Accuracy":"62.2"},"uses_additional_data":false,"paper_date":"2023-08-24","paper":"/paper/code-llama-open-foundation-models-for-code","paper_url":"https://arxiv.org/abs/2308.12950v3","paper_title":"Code Llama: Open Foundation Models for Code","code":"https://github.com/facebookresearch/codellama","n_code_links":2,"official":{"repos":["facebookresearch/codellama"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":4,"sample_list":"/paper/code-llama-open-foundation-models-for-code#ran","syntology_url":"https://syntology.ai/paper/2308.12950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12950"}}}},{"rank_in_archive_order":45,"model":"code-davinci-001 175B + CodeT","metrics":{"Accuracy":"61.9"},"uses_additional_data":false,"paper_date":"2022-07-21","paper":"/paper/codet-code-generation-with-generated-tests","paper_url":"https://arxiv.org/abs/2207.10397v2","paper_title":"CodeT: Code Generation with Generated Tests","code":"https://github.com/microsoft/codet","n_code_links":1,"official":{"repos":["microsoft/codet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0,"sample_list":"/paper/codet-code-generation-with-generated-tests#ran","syntology_url":"https://syntology.ai/paper/2207.10397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10397"}}}},{"rank_in_archive_order":46,"model":"code-davinci-002 175B (3-shot)","metrics":{"Accuracy":"61.4"},"uses_additional_data":true,"paper_date":"2023-04-11","paper":"/paper/teaching-large-language-models-to-self-debug","paper_url":"https://arxiv.org/abs/2304.05128v2","paper_title":"Teaching Large Language Models to Self-Debug","code":"https://github.com/amazon-science/SDFeedback","n_code_links":2,"official":null,"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0,"sample_list":"/paper/teaching-large-language-models-to-self-debug#ran","syntology_url":"https://syntology.ai/paper/2304.05128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.05128"}}}},{"rank_in_archive_order":47,"model":"Unnatural Code Llama 34B (3-shot)","metrics":{"Accuracy":"61.2"},"uses_additional_data":false,"paper_date":"2023-08-24","paper":"/paper/code-llama-open-foundation-models-for-code","paper_url":"https://arxiv.org/abs/2308.12950v3","paper_title":"Code Llama: Open Foundation Models for Code","code":"https://github.com/facebookresearch/codellama","n_code_links":2,"official":{"repos":["facebookresearch/codellama"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":4,"sample_list":"/paper/code-llama-open-foundation-models-for-code#ran","syntology_url":"https://syntology.ai/paper/2308.12950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12950"}}}},{"rank_in_archive_order":48,"model":"Mixtral 8x7B (3-shot)","metrics":{"Accuracy":"60.7"},"uses_additional_data":false,"paper_date":"2024-01-08","paper":"/paper/mixtral-of-experts","paper_url":"https://arxiv.org/abs/2401.04088v1","paper_title":"Mixtral of Experts","code":"https://github.com/jingyaogong/minimind","n_code_links":6,"official":null,"syntology":{"n_ran":5,"n_constructed":5,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_samples":5,"n_pointer_only_licence":0,"sample_list":"/paper/mixtral-of-experts#ran","syntology_url":"https://syntology.ai/paper/2401.04088","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.04088"}}}},{"rank_in_archive_order":49,"model":"DeepSeek-Coder-Base 6.7B (few-shot)","metrics":{"Accuracy":"60.6"},"uses_additional_data":false,"paper_date":"2024-01-25","paper":"/paper/deepseek-coder-when-the-large-language-model","paper_url":"https://arxiv.org/abs/2401.14196v2","paper_title":"DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligence","code":"https://github.com/deepseek-ai/DeepSeek-Coder","n_code_links":1,"official":{"repos":["deepseek-ai/DeepSeek-Coder"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":3,"n_instrument":6,"n_unverified":1,"n_samples":10,"n_pointer_only_licence":1,"sample_list":"/paper/deepseek-coder-when-the-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2401.14196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.14196"}}}},{"rank_in_archive_order":50,"model":"code-davinci-001 175B + MBR-Exec","metrics":{"Accuracy":"58.2"},"uses_additional_data":false,"paper_date":"2022-04-25","paper":"/paper/natural-language-to-code-translation-with","paper_url":"https://arxiv.org/abs/2204.11454v2","paper_title":"Natural Language to Code Translation with Execution","code":"https://github.com/facebookresearch/mbr-exec","n_code_links":1,"official":{"repos":["facebookresearch/mbr-exec"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]},"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":3,"n_samples":12,"n_pointer_only_licence":2,"sample_list":"/paper/natural-language-to-code-translation-with#ran","syntology_url":"https://syntology.ai/paper/2204.11454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.11454"}}}},{"rank_in_archive_order":51,"model":"Code Llama - Instruct 34B (3-shot)","metrics":{"Accuracy":"57"},"uses_additional_data":false,"paper_date":"2023-08-24","paper":"/paper/code-llama-open-foundation-models-for-code","paper_url":"https://arxiv.org/abs/2308.12950v3","paper_title":"Code Llama: Open Foundation Models for Code","code":"https://github.com/facebookresearch/codellama","n_code_links":2,"official":{"repos":["facebookresearch/codellama"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":4,"sample_list":"/paper/code-llama-open-foundation-models-for-code#ran","syntology_url":"https://syntology.ai/paper/2308.12950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12950"}}}},{"rank_in_archive_order":52,"model":"Code Llama - Python 34B (3-shot)","metrics":{"Accuracy":"56.2"},"uses_additional_data":true,"paper_date":"2023-08-24","paper":"/paper/code-llama-open-foundation-models-for-code","paper_url":"https://arxiv.org/abs/2308.12950v3","paper_title":"Code Llama: Open Foundation Models for Code","code":"https://github.com/facebookresearch/codellama","n_code_links":2,"official":{"repos":["facebookresearch/codellama"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":4,"sample_list":"/paper/code-llama-open-foundation-models-for-code#ran","syntology_url":"https://syntology.ai/paper/2308.12950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12950"}}}},{"rank_in_archive_order":53,"model":"code-cushman-001 12B (CodeT)","metrics":{"Accuracy":"55.4"},"uses_additional_data":false,"paper_date":"2022-07-21","paper":"/paper/codet-code-generation-with-generated-tests","paper_url":"https://arxiv.org/abs/2207.10397v2","paper_title":"CodeT: Code Generation with Generated Tests","code":"https://github.com/microsoft/codet","n_code_links":1,"official":{"repos":["microsoft/codet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0,"sample_list":"/paper/codet-code-generation-with-generated-tests#ran","syntology_url":"https://syntology.ai/paper/2207.10397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10397"}}}},{"rank_in_archive_order":54,"model":"Code Llama 34B (3-shot)","metrics":{"Accuracy":"55"},"uses_additional_data":true,"paper_date":"2023-08-24","paper":"/paper/code-llama-open-foundation-models-for-code","paper_url":"https://arxiv.org/abs/2308.12950v3","paper_title":"Code Llama: Open Foundation Models for Code","code":"https://github.com/facebookresearch/codellama","n_code_links":2,"official":{"repos":["facebookresearch/codellama"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":4,"sample_list":"/paper/code-llama-open-foundation-models-for-code#ran","syntology_url":"https://syntology.ai/paper/2308.12950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12950"}}}},{"rank_in_archive_order":55,"model":"StarCoder 15.5B (Self-Debugging with unit tests + trace)","metrics":{"Accuracy":"53.2"},"uses_additional_data":false,"paper_date":"2023-04-11","paper":"/paper/teaching-large-language-models-to-self-debug","paper_url":"https://arxiv.org/abs/2304.05128v2","paper_title":"Teaching Large Language Models to Self-Debug","code":"https://github.com/amazon-science/SDFeedback","n_code_links":2,"official":null,"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0,"sample_list":"/paper/teaching-large-language-models-to-self-debug#ran","syntology_url":"https://syntology.ai/paper/2304.05128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.05128"}}}},{"rank_in_archive_order":56,"model":"StarCoder 15.5B","metrics":{"Accuracy":"52.7"},"uses_additional_data":false,"paper_date":"2023-05-09","paper":"/paper/starcoder-may-the-source-be-with-you","paper_url":"https://arxiv.org/abs/2305.06161v2","paper_title":"StarCoder: may the source be with you!","code":"https://github.com/bigcode-project/starcoder","n_code_links":4,"official":null,"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0,"sample_list":"/paper/starcoder-may-the-source-be-with-you#ran","syntology_url":"https://syntology.ai/paper/2305.06161","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06161"}}}},{"rank_in_archive_order":57,"model":"GPT-3.5 Turbo","metrics":{"Accuracy":"52.2"},"uses_additional_data":true,"paper_date":"2023-08-24","paper":"/paper/code-llama-open-foundation-models-for-code","paper_url":"https://arxiv.org/abs/2308.12950v3","paper_title":"Code Llama: Open Foundation Models for Code","code":"https://github.com/facebookresearch/codellama","n_code_links":2,"official":{"repos":["facebookresearch/codellama"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":4,"sample_list":"/paper/code-llama-open-foundation-models-for-code#ran","syntology_url":"https://syntology.ai/paper/2308.12950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12950"}}}},{"rank_in_archive_order":58,"model":"WizardCoder 15B","metrics":{"Accuracy":"51.8"},"uses_additional_data":true,"paper_date":"2023-06-14","paper":"/paper/wizardcoder-empowering-code-large-language","paper_url":"https://arxiv.org/abs/2306.08568v1","paper_title":"WizardCoder: Empowering Code Large Language Models with Evol-Instruct","code":"https://github.com/nlpxucan/wizardlm","n_code_links":4,"official":{"repos":["nlpxucan/wizardlm"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"syntology":{"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_samples":7,"n_pointer_only_licence":2,"sample_list":"/paper/wizardcoder-empowering-code-large-language#ran","syntology_url":"https://syntology.ai/paper/2306.08568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08568"}}}},{"rank_in_archive_order":59,"model":"PaLM 2-S* (few-shot)","metrics":{"Accuracy":"50"},"uses_additional_data":false,"paper_date":"2023-05-17","paper":"/paper/palm-2-technical-report-1","paper_url":"https://arxiv.org/abs/2305.10403v3","paper_title":"PaLM 2 Technical Report","code":"https://github.com/eternityyw/tram-benchmark","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":60,"model":"CodeGen-Mono 16B + CodeT","metrics":{"Accuracy":"49.5"},"uses_additional_data":false,"paper_date":"2022-07-21","paper":"/paper/codet-code-generation-with-generated-tests","paper_url":"https://arxiv.org/abs/2207.10397v2","paper_title":"CodeT: Code Generation with Generated Tests","code":"https://github.com/microsoft/codet","n_code_links":1,"official":{"repos":["microsoft/codet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0,"sample_list":"/paper/codet-code-generation-with-generated-tests#ran","syntology_url":"https://syntology.ai/paper/2207.10397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10397"}}}},{"rank_in_archive_order":61,"model":"Code Llama - Instruct 13B (3-shot)","metrics":{"Accuracy":"49.4"},"uses_additional_data":false,"paper_date":"2023-08-24","paper":"/paper/code-llama-open-foundation-models-for-code","paper_url":"https://arxiv.org/abs/2308.12950v3","paper_title":"Code Llama: Open Foundation Models for Code","code":"https://github.com/facebookresearch/codellama","n_code_links":2,"official":{"repos":["facebookresearch/codellama"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":4,"sample_list":"/paper/code-llama-open-foundation-models-for-code#ran","syntology_url":"https://syntology.ai/paper/2308.12950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12950"}}}},{"rank_in_archive_order":62,"model":"DeepSeek-Coder-Instruct 1.3B (few-shot)","metrics":{"Accuracy":"49.4"},"uses_additional_data":false,"paper_date":"2024-01-25","paper":"/paper/deepseek-coder-when-the-large-language-model","paper_url":"https://arxiv.org/abs/2401.14196v2","paper_title":"DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligence","code":"https://github.com/deepseek-ai/DeepSeek-Coder","n_code_links":1,"official":{"repos":["deepseek-ai/DeepSeek-Coder"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":3,"n_instrument":6,"n_unverified":1,"n_samples":10,"n_pointer_only_licence":1,"sample_list":"/paper/deepseek-coder-when-the-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2401.14196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.14196"}}}},{"rank_in_archive_order":63,"model":"StarCoderBase 15.5B","metrics":{"Accuracy":"49"},"uses_additional_data":false,"paper_date":"2023-05-09","paper":"/paper/starcoder-may-the-source-be-with-you","paper_url":"https://arxiv.org/abs/2305.06161v2","paper_title":"StarCoder: may the source be with you!","code":"https://github.com/bigcode-project/starcoder","n_code_links":4,"official":null,"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0,"sample_list":"/paper/starcoder-may-the-source-be-with-you#ran","syntology_url":"https://syntology.ai/paper/2305.06161","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06161"}}}},{"rank_in_archive_order":64,"model":"Code Llama - Python 13B (3-shot)","metrics":{"Accuracy":"49"},"uses_additional_data":false,"paper_date":"2023-08-24","paper":"/paper/code-llama-open-foundation-models-for-code","paper_url":"https://arxiv.org/abs/2308.12950v3","paper_title":"Code Llama: Open Foundation Models for Code","code":"https://github.com/facebookresearch/codellama","n_code_links":2,"official":{"repos":["facebookresearch/codellama"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":4,"sample_list":"/paper/code-llama-open-foundation-models-for-code#ran","syntology_url":"https://syntology.ai/paper/2308.12950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12950"}}}},{"rank_in_archive_order":65,"model":"Qwen2idae-16x14B (4-shot)","metrics":{"Accuracy":"48.6"},"uses_additional_data":false,"paper_date":"2024-01-05","paper":"/paper/parameter-efficient-sparsity-crafting-from","paper_url":"https://arxiv.org/abs/2401.02731v4","paper_title":"Parameter-Efficient Sparsity Crafting from Dense to Mixture-of-Experts for Instruction Tuning on General Tasks","code":"https://github.com/wuhy68/parameter-efficient-moe","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":66,"model":"code-cushman-001 12B + MBR-Exec","metrics":{"Accuracy":"48.3"},"uses_additional_data":false,"paper_date":"2022-11-29","paper":"/paper/coder-reviewer-reranking-for-code-generation","paper_url":"https://arxiv.org/abs/2211.16490v1","paper_title":"Coder Reviewer Reranking for Code Generation","code":"https://github.com/facebookresearch/coder_reviewer_reranking","n_code_links":1,"official":{"repos":["facebookresearch/coder_reviewer_reranking"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/coder-reviewer-reranking-for-code-generation#ran","syntology_url":"https://syntology.ai/paper/2211.16490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.16490"}}}},{"rank_in_archive_order":67,"model":"Code Llama - Python 7B (3-shot)","metrics":{"Accuracy":"47.6"},"uses_additional_data":false,"paper_date":"2023-08-24","paper":"/paper/code-llama-open-foundation-models-for-code","paper_url":"https://arxiv.org/abs/2308.12950v3","paper_title":"Code Llama: Open Foundation Models for Code","code":"https://github.com/facebookresearch/codellama","n_code_links":2,"official":{"repos":["facebookresearch/codellama"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":4,"sample_list":"/paper/code-llama-open-foundation-models-for-code#ran","syntology_url":"https://syntology.ai/paper/2308.12950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12950"}}}},{"rank_in_archive_order":68,"model":"Mistral 7B (3-shot)","metrics":{"Accuracy":"47.5"},"uses_additional_data":false,"paper_date":"2023-10-10","paper":"/paper/mistral-7b","paper_url":"https://arxiv.org/abs/2310.06825v1","paper_title":"Mistral 7B","code":"https://github.com/mistralai/mistral-src","n_code_links":6,"official":{"repos":["mistralai/mistral-src"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["listed","official"]},"syntology":{"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":1,"n_samples":11,"n_pointer_only_licence":2,"sample_list":"/paper/mistral-7b#ran","syntology_url":"https://syntology.ai/paper/2310.06825","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.06825"}}}},{"rank_in_archive_order":69,"model":"CodeGen 16B + MBR-Exec","metrics":{"Accuracy":"47.3"},"uses_additional_data":false,"paper_date":"2022-11-29","paper":"/paper/coder-reviewer-reranking-for-code-generation","paper_url":"https://arxiv.org/abs/2211.16490v1","paper_title":"Coder Reviewer Reranking for Code Generation","code":"https://github.com/facebookresearch/coder_reviewer_reranking","n_code_links":1,"official":{"repos":["facebookresearch/coder_reviewer_reranking"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/coder-reviewer-reranking-for-code-generation#ran","syntology_url":"https://syntology.ai/paper/2211.16490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.16490"}}}},{"rank_in_archive_order":70,"model":"StarCoder 15.5B (3-shot)","metrics":{"Accuracy":"47.2"},"uses_additional_data":false,"paper_date":"2023-04-11","paper":"/paper/teaching-large-language-models-to-self-debug","paper_url":"https://arxiv.org/abs/2304.05128v2","paper_title":"Teaching Large Language Models to Self-Debug","code":"https://github.com/amazon-science/SDFeedback","n_code_links":2,"official":null,"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0,"sample_list":"/paper/teaching-large-language-models-to-self-debug#ran","syntology_url":"https://syntology.ai/paper/2304.05128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.05128"}}}},{"rank_in_archive_order":71,"model":"PaLM Coder 540B","metrics":{"Accuracy":"47"},"uses_additional_data":false,"paper_date":"2022-04-05","paper":"/paper/palm-scaling-language-modeling-with-pathways-1","paper_url":"https://arxiv.org/abs/2204.02311v5","paper_title":"PaLM: Scaling Language Modeling with Pathways","code":"https://github.com/lucidrains/CoCa-pytorch","n_code_links":7,"official":null,"syntology":{"n_ran":32,"n_constructed":16,"n_ran_checked":24,"n_instrument":8,"n_unverified":5,"n_samples":37,"n_pointer_only_licence":0,"sample_list":"/paper/palm-scaling-language-modeling-with-pathways-1#ran","syntology_url":"https://syntology.ai/paper/2204.02311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.02311"}}}},{"rank_in_archive_order":72,"model":"Code Llama 13B (3-shot)","metrics":{"Accuracy":"47"},"uses_additional_data":false,"paper_date":"2023-08-24","paper":"/paper/code-llama-open-foundation-models-for-code","paper_url":"https://arxiv.org/abs/2308.12950v3","paper_title":"Code Llama: Open Foundation Models for Code","code":"https://github.com/facebookresearch/codellama","n_code_links":2,"official":{"repos":["facebookresearch/codellama"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":4,"sample_list":"/paper/code-llama-open-foundation-models-for-code#ran","syntology_url":"https://syntology.ai/paper/2308.12950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12950"}}}},{"rank_in_archive_order":73,"model":"CodeGen 16B + Coder-Reviewer","metrics":{"Accuracy":"46.2"},"uses_additional_data":false,"paper_date":"2022-11-29","paper":"/paper/coder-reviewer-reranking-for-code-generation","paper_url":"https://arxiv.org/abs/2211.16490v1","paper_title":"Coder Reviewer Reranking for Code Generation","code":"https://github.com/facebookresearch/coder_reviewer_reranking","n_code_links":1,"official":{"repos":["facebookresearch/coder_reviewer_reranking"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/coder-reviewer-reranking-for-code-generation#ran","syntology_url":"https://syntology.ai/paper/2211.16490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.16490"}}}},{"rank_in_archive_order":74,"model":"DeepSeek-Coder-Base 1.3B (few-shot)","metrics":{"Accuracy":"46.2"},"uses_additional_data":false,"paper_date":"2024-01-25","paper":"/paper/deepseek-coder-when-the-large-language-model","paper_url":"https://arxiv.org/abs/2401.14196v2","paper_title":"DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligence","code":"https://github.com/deepseek-ai/DeepSeek-Coder","n_code_links":1,"official":{"repos":["deepseek-ai/DeepSeek-Coder"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":9,"n_constructed":0,"n_ran_checked":3,"n_instrument":6,"n_unverified":1,"n_samples":10,"n_pointer_only_licence":1,"sample_list":"/paper/deepseek-coder-when-the-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2401.14196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.14196"}}}},{"rank_in_archive_order":75,"model":"GPT-3.5 Turbo (few-shot)","metrics":{"Accuracy":"45.4"},"uses_additional_data":false,"paper_date":"2023-11-16","paper":"/paper/intervenor-prompt-the-coding-ability-of-large","paper_url":"https://arxiv.org/abs/2311.09868v5","paper_title":"INTERVENOR: Prompting the Coding Ability of Large Language Models with the Interactive Chain of Repair","code":"https://github.com/neuir/intervenor","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":76,"model":"Llama 2 70B (zero-shot)","metrics":{"Accuracy":"45"},"uses_additional_data":false,"paper_date":"2023-07-18","paper":"/paper/llama-2-open-foundation-and-fine-tuned-chat","paper_url":"https://arxiv.org/abs/2307.09288v2","paper_title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","code":"https://github.com/facebookresearch/llama","n_code_links":19,"official":{"repos":["facebookresearch/llama"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"syntology":{"n_ran":33,"n_constructed":7,"n_ran_checked":20,"n_instrument":13,"n_unverified":19,"n_samples":52,"n_pointer_only_licence":20,"sample_list":"/paper/llama-2-open-foundation-and-fine-tuned-chat#ran","syntology_url":"https://syntology.ai/paper/2307.09288","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09288"}}}},{"rank_in_archive_order":77,"model":"Code Llama - Instruct 7B (3-shot)","metrics":{"Accuracy":"44.4"},"uses_additional_data":false,"paper_date":"2023-08-24","paper":"/paper/code-llama-open-foundation-models-for-code","paper_url":"https://arxiv.org/abs/2308.12950v3","paper_title":"Code Llama: Open Foundation Models for Code","code":"https://github.com/facebookresearch/codellama","n_code_links":2,"official":{"repos":["facebookresearch/codellama"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":4,"sample_list":"/paper/code-llama-open-foundation-models-for-code#ran","syntology_url":"https://syntology.ai/paper/2308.12950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12950"}}}},{"rank_in_archive_order":78,"model":"CodeGen 16B + Reviewer","metrics":{"Accuracy":"44.1"},"uses_additional_data":false,"paper_date":"2022-11-29","paper":"/paper/coder-reviewer-reranking-for-code-generation","paper_url":"https://arxiv.org/abs/2211.16490v1","paper_title":"Coder Reviewer Reranking for Code Generation","code":"https://github.com/facebookresearch/coder_reviewer_reranking","n_code_links":1,"official":{"repos":["facebookresearch/coder_reviewer_reranking"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/coder-reviewer-reranking-for-code-generation#ran","syntology_url":"https://syntology.ai/paper/2211.16490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.16490"}}}},{"rank_in_archive_order":79,"model":"phi-1.5-web 1.3B","metrics":{"Accuracy":"43.5"},"uses_additional_data":false,"paper_date":"2023-09-11","paper":"/paper/textbooks-are-all-you-need-ii-phi-1-5","paper_url":"https://arxiv.org/abs/2309.05463v1","paper_title":"Textbooks Are All You Need II: phi-1.5 technical report","code":"https://github.com/knowlab/bi-weekly-paper-presentation","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":80,"model":"Branch-Train-Merge 4x7B (top-2)","metrics":{"Accuracy":"42.6"},"uses_additional_data":false,"paper_date":"2024-03-12","paper":"/paper/branch-train-mix-mixing-expert-llms-into-a","paper_url":"https://arxiv.org/abs/2403.07816v1","paper_title":"Branch-Train-MiX: Mixing Expert LLMs into a Mixture-of-Experts LLM","code":"https://github.com/Leeroo-AI/mergoo","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":81,"model":"Code Llama 7B (3-shot)","metrics":{"Accuracy":"41.4"},"uses_additional_data":false,"paper_date":"2023-08-24","paper":"/paper/code-llama-open-foundation-models-for-code","paper_url":"https://arxiv.org/abs/2308.12950v3","paper_title":"Code Llama: Open Foundation Models for Code","code":"https://github.com/facebookresearch/codellama","n_code_links":2,"official":{"repos":["facebookresearch/codellama"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":4,"sample_list":"/paper/code-llama-open-foundation-models-for-code#ran","syntology_url":"https://syntology.ai/paper/2308.12950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12950"}}}},{"rank_in_archive_order":82,"model":"Camelidae-8×34B (4-shot)","metrics":{"Accuracy":"41.4"},"uses_additional_data":false,"paper_date":"2024-01-05","paper":"/paper/parameter-efficient-sparsity-crafting-from","paper_url":"https://arxiv.org/abs/2401.02731v4","paper_title":"Parameter-Efficient Sparsity Crafting from Dense to Mixture-of-Experts for Instruction Tuning on General Tasks","code":"https://github.com/wuhy68/parameter-efficient-moe","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":83,"model":"GPT-3.5 Turbo (0-shot)","metrics":{"Accuracy":"39.8"},"uses_additional_data":false,"paper_date":"2023-11-16","paper":"/paper/intervenor-prompt-the-coding-ability-of-large","paper_url":"https://arxiv.org/abs/2311.09868v5","paper_title":"INTERVENOR: Prompting the Coding Ability of Large Language Models with the Interactive Chain of Repair","code":"https://github.com/neuir/intervenor","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":84,"model":"Branch-Train-MiX 4x7B (sampling top-2 experts)","metrics":{"Accuracy":"39.4"},"uses_additional_data":false,"paper_date":"2024-03-12","paper":"/paper/branch-train-mix-mixing-expert-llms-into-a","paper_url":"https://arxiv.org/abs/2403.07816v1","paper_title":"Branch-Train-MiX: Mixing Expert LLMs into a Mixture-of-Experts LLM","code":"https://github.com/Leeroo-AI/mergoo","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":85,"model":"LLaMA 65B (0-shot)","metrics":{"Accuracy":"37.7"},"uses_additional_data":false,"paper_date":"2023-02-27","paper":"/paper/llama-open-and-efficient-foundation-language-1","paper_url":"https://arxiv.org/abs/2302.13971v1","paper_title":"LLaMA: Open and Efficient Foundation Language Models","code":"https://github.com/huggingface/transformers","n_code_links":57,"official":{"repos":["facebookresearch/llama"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"syntology":{"n_ran":37,"n_constructed":9,"n_ran_checked":25,"n_instrument":12,"n_unverified":21,"n_samples":58,"n_pointer_only_licence":4,"sample_list":"/paper/llama-open-and-efficient-foundation-language-1#ran","syntology_url":"https://syntology.ai/paper/2302.13971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.13971"}}}},{"rank_in_archive_order":86,"model":"PaLM 540B","metrics":{"Accuracy":"36.8"},"uses_additional_data":false,"paper_date":"2022-04-05","paper":"/paper/palm-scaling-language-modeling-with-pathways-1","paper_url":"https://arxiv.org/abs/2204.02311v5","paper_title":"PaLM: Scaling Language Modeling with Pathways","code":"https://github.com/lucidrains/CoCa-pytorch","n_code_links":7,"official":null,"syntology":{"n_ran":32,"n_constructed":16,"n_ran_checked":24,"n_instrument":8,"n_unverified":5,"n_samples":37,"n_pointer_only_licence":0,"sample_list":"/paper/palm-scaling-language-modeling-with-pathways-1#ran","syntology_url":"https://syntology.ai/paper/2204.02311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.02311"}}}},{"rank_in_archive_order":87,"model":"SantaCoder 1.1B","metrics":{"Accuracy":"35"},"uses_additional_data":false,"paper_date":"2023-05-09","paper":"/paper/starcoder-may-the-source-be-with-you","paper_url":"https://arxiv.org/abs/2305.06161v2","paper_title":"StarCoder: may the source be with you!","code":"https://github.com/bigcode-project/starcoder","n_code_links":4,"official":null,"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0,"sample_list":"/paper/starcoder-may-the-source-be-with-you#ran","syntology_url":"https://syntology.ai/paper/2305.06161","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.06161"}}}},{"rank_in_archive_order":88,"model":"InCoder 6.7B + CodeT","metrics":{"Accuracy":"34.4"},"uses_additional_data":false,"paper_date":"2022-07-21","paper":"/paper/codet-code-generation-with-generated-tests","paper_url":"https://arxiv.org/abs/2207.10397v2","paper_title":"CodeT: Code Generation with Generated Tests","code":"https://github.com/microsoft/codet","n_code_links":1,"official":{"repos":["microsoft/codet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":0,"sample_list":"/paper/codet-code-generation-with-generated-tests#ran","syntology_url":"https://syntology.ai/paper/2207.10397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10397"}}}},{"rank_in_archive_order":89,"model":"Llama 2 34B (0-shot)","metrics":{"Accuracy":"33"},"uses_additional_data":false,"paper_date":"2023-07-18","paper":"/paper/llama-2-open-foundation-and-fine-tuned-chat","paper_url":"https://arxiv.org/abs/2307.09288v2","paper_title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","code":"https://github.com/facebookresearch/llama","n_code_links":19,"official":{"repos":["facebookresearch/llama"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"syntology":{"n_ran":33,"n_constructed":7,"n_ran_checked":20,"n_instrument":13,"n_unverified":19,"n_samples":52,"n_pointer_only_licence":20,"sample_list":"/paper/llama-2-open-foundation-and-fine-tuned-chat#ran","syntology_url":"https://syntology.ai/paper/2307.09288","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09288"}}}},{"rank_in_archive_order":90,"model":"Llama 2 13B (0-shot)","metrics":{"Accuracy":"30.6"},"uses_additional_data":false,"paper_date":"2023-07-18","paper":"/paper/llama-2-open-foundation-and-fine-tuned-chat","paper_url":"https://arxiv.org/abs/2307.09288v2","paper_title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","code":"https://github.com/facebookresearch/llama","n_code_links":19,"official":{"repos":["facebookresearch/llama"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"syntology":{"n_ran":33,"n_constructed":7,"n_ran_checked":20,"n_instrument":13,"n_unverified":19,"n_samples":52,"n_pointer_only_licence":20,"sample_list":"/paper/llama-2-open-foundation-and-fine-tuned-chat#ran","syntology_url":"https://syntology.ai/paper/2307.09288","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09288"}}}},{"rank_in_archive_order":91,"model":"LLaMA 33B (0-shot)","metrics":{"Accuracy":"30.2"},"uses_additional_data":false,"paper_date":"2023-02-27","paper":"/paper/llama-open-and-efficient-foundation-language-1","paper_url":"https://arxiv.org/abs/2302.13971v1","paper_title":"LLaMA: Open and Efficient Foundation Language Models","code":"https://github.com/huggingface/transformers","n_code_links":57,"official":{"repos":["facebookresearch/llama"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"syntology":{"n_ran":37,"n_constructed":9,"n_ran_checked":25,"n_instrument":12,"n_unverified":21,"n_samples":58,"n_pointer_only_licence":4,"sample_list":"/paper/llama-open-and-efficient-foundation-language-1#ran","syntology_url":"https://syntology.ai/paper/2302.13971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.13971"}}}},{"rank_in_archive_order":92,"model":"InCoder 6.7B + MBR-Exec","metrics":{"Accuracy":"26.7"},"uses_additional_data":false,"paper_date":"2022-11-29","paper":"/paper/coder-reviewer-reranking-for-code-generation","paper_url":"https://arxiv.org/abs/2211.16490v1","paper_title":"Coder Reviewer Reranking for Code Generation","code":"https://github.com/facebookresearch/coder_reviewer_reranking","n_code_links":1,"official":{"repos":["facebookresearch/coder_reviewer_reranking"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/coder-reviewer-reranking-for-code-generation#ran","syntology_url":"https://syntology.ai/paper/2211.16490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.16490"}}}},{"rank_in_archive_order":93,"model":"InCoder 6.7B + Coder-Reviewer","metrics":{"Accuracy":"26.1"},"uses_additional_data":false,"paper_date":"2022-11-29","paper":"/paper/coder-reviewer-reranking-for-code-generation","paper_url":"https://arxiv.org/abs/2211.16490v1","paper_title":"Coder Reviewer Reranking for Code Generation","code":"https://github.com/facebookresearch/coder_reviewer_reranking","n_code_links":1,"official":{"repos":["facebookresearch/coder_reviewer_reranking"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/coder-reviewer-reranking-for-code-generation#ran","syntology_url":"https://syntology.ai/paper/2211.16490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.16490"}}}},{"rank_in_archive_order":94,"model":"InCoder 6.7B + Reviewer","metrics":{"Accuracy":"24.4"},"uses_additional_data":false,"paper_date":"2022-11-29","paper":"/paper/coder-reviewer-reranking-for-code-generation","paper_url":"https://arxiv.org/abs/2211.16490v1","paper_title":"Coder Reviewer Reranking for Code Generation","code":"https://github.com/facebookresearch/coder_reviewer_reranking","n_code_links":1,"official":{"repos":["facebookresearch/coder_reviewer_reranking"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/coder-reviewer-reranking-for-code-generation#ran","syntology_url":"https://syntology.ai/paper/2211.16490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.16490"}}}},{"rank_in_archive_order":95,"model":"CodeGeeX-13B","metrics":{"Accuracy":"24.4"},"uses_additional_data":false,"paper_date":"2023-03-30","paper":"/paper/codegeex-a-pre-trained-model-for-code","paper_url":"https://arxiv.org/abs/2303.17568v2","paper_title":"CodeGeeX: A Pre-Trained Model for Code Generation with Multilingual Benchmarking on HumanEval-X","code":"https://github.com/THUDM/CodeGeeX","n_code_links":2,"official":{"repos":["THUDM/CodeGeeX"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]},"syntology":{"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_samples":8,"n_pointer_only_licence":1,"sample_list":"/paper/codegeex-a-pre-trained-model-for-code#ran","syntology_url":"https://syntology.ai/paper/2303.17568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.17568"}}}},{"rank_in_archive_order":96,"model":"LLaMA 13B (0-shot)","metrics":{"Accuracy":"22"},"uses_additional_data":false,"paper_date":"2023-02-27","paper":"/paper/llama-open-and-efficient-foundation-language-1","paper_url":"https://arxiv.org/abs/2302.13971v1","paper_title":"LLaMA: Open and Efficient Foundation Language Models","code":"https://github.com/huggingface/transformers","n_code_links":57,"official":{"repos":["facebookresearch/llama"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"syntology":{"n_ran":37,"n_constructed":9,"n_ran_checked":25,"n_instrument":12,"n_unverified":21,"n_samples":58,"n_pointer_only_licence":4,"sample_list":"/paper/llama-open-and-efficient-foundation-language-1#ran","syntology_url":"https://syntology.ai/paper/2302.13971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.13971"}}}},{"rank_in_archive_order":97,"model":"Llama 2 7B (0-shot)","metrics":{"Accuracy":"20.8"},"uses_additional_data":false,"paper_date":"2023-07-18","paper":"/paper/llama-2-open-foundation-and-fine-tuned-chat","paper_url":"https://arxiv.org/abs/2307.09288v2","paper_title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","code":"https://github.com/facebookresearch/llama","n_code_links":19,"official":{"repos":["facebookresearch/llama"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"syntology":{"n_ran":33,"n_constructed":7,"n_ran_checked":20,"n_instrument":13,"n_unverified":19,"n_samples":52,"n_pointer_only_licence":20,"sample_list":"/paper/llama-2-open-foundation-and-fine-tuned-chat#ran","syntology_url":"https://syntology.ai/paper/2307.09288","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09288"}}}},{"rank_in_archive_order":98,"model":"InCoder 6.7B (0-shot)","metrics":{"Accuracy":"19.4"},"uses_additional_data":false,"paper_date":"2022-04-12","paper":"/paper/incoder-a-generative-model-for-code-infilling","paper_url":"https://arxiv.org/abs/2204.05999v3","paper_title":"InCoder: A Generative Model for Code Infilling and Synthesis","code":"https://github.com/dpfried/incoder","n_code_links":3,"official":{"repos":["dpfried/incoder"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]},"syntology":{"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":4,"n_samples":10,"n_pointer_only_licence":2,"sample_list":"/paper/incoder-a-generative-model-for-code-infilling#ran","syntology_url":"https://syntology.ai/paper/2204.05999","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.05999"}}}},{"rank_in_archive_order":99,"model":"LLaMA 7B (0-shot)","metrics":{"Accuracy":"17.7"},"uses_additional_data":false,"paper_date":"2023-02-27","paper":"/paper/llama-open-and-efficient-foundation-language-1","paper_url":"https://arxiv.org/abs/2302.13971v1","paper_title":"LLaMA: Open and Efficient Foundation Language Models","code":"https://github.com/huggingface/transformers","n_code_links":57,"official":{"repos":["facebookresearch/llama"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"syntology":{"n_ran":37,"n_constructed":9,"n_ran_checked":25,"n_instrument":12,"n_unverified":21,"n_samples":58,"n_pointer_only_licence":4,"sample_list":"/paper/llama-open-and-efficient-foundation-language-1#ran","syntology_url":"https://syntology.ai/paper/2302.13971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.13971"}}}}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"adjudicator":"Claude Opus 5.5","adjudicator_from":"groundwork/59_code_with_papers/LB_EXTRACTOR_PREREG.md (not recorded in lb_measurement.json; the file's frozen_commit, measured_on and counts equal the run the pre-registration records)","adjudicator_sensitivity":[69,70],"adjudicator_specificity":[101,103],"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication by a model (adjudicator) of accepted entries on a held-out split of archive papers, rules frozen before the test; adjudicator_sensitivity and adjudicator_specificity are its own controls as [judged right, of]; it was not measured on the newer papers placed here","measurement_sentence":"Measured before publishing, on held-out archive papers: the extractor was given 883 of them and produced output for 881 (the other 2 had no title and were excluded before any model call, so they are not part of this measurement). A model adjudicator (Claude Opus 5.5), blind to which entries were real, judged 108 of 110 accepted entries correct on those held-out archive papers; its own controls: 69 of 70 archive-confirmed entries judged true, 101 of 103 corrupted copies judged false. It was not measured on the newer papers whose results are placed on this site.","coverage":{"sentence":"Syntology has checked 8,886 of the 18,637 papers on this site that are newer than the archive (for 3,717 of them no archive leaderboard matched the paper's tables, so there was nothing further to check); 733 were read and have nothing to place (arXiv has no HTML version of the paper, or that version has no tables), 41 could not be read (the extractor's reply could not be parsed), and results from the other 8,977 appear after they are checked.","complete":false,"papers_newer_than_archive":18637,"papers_checked":8886,"papers_checked_no_leaderboard_matched":3717,"papers_read_nothing_to_place":733,"papers_could_not_be_read":41,"papers_could_not_be_read_by_status":{"unparseable":41},"papers_extracted_not_yet_verified":0,"boards_without_verdict":3,"papers_not_yet_extracted":8975},"board_status":{"sentence":"Of the 8,888 newer papers whose tables Syntology has read (8,886 checked in full and 2 with a leaderboard still awaiting a verdict), 86 had this board among the leaderboards the extractor considered for their tables (it keeps at most 10 boards per paper and 4 per dataset; the lists of 1,557 of the 8,888 were already full without this board, so if it was crowded out of them it is not counted), and 57 proposed a result; of those 57, 43 gave no cell that passed the extractor's own checks, 10 were rejected by the independent check, 0 await a verdict and 4 were placed.","note":"papers, from the extractor's own records, over the newer papers whose tables were read; proposed = no_cell_passed_checks + rejected_by_independent_check + accepted_not_placed + awaiting_verdict + placed; counts, never a rate","eligible":true,"eligible_note":"false when the extractor never considers this board: it loads only boards with archive rows and at least one metric column (lb_extract.py Boards), so no newer paper can be proposed here; archive_rows and metric_columns say which","archive_rows":99,"metric_columns":1,"papers_read":8888,"papers_read_checked":8886,"papers_read_awaiting_verdict":2,"papers_read_verified":8888,"papers_read_not_yet_verified":0,"papers_read_at_candidate_cap":1596,"papers_read_list_full_without_this_board":1557,"candidates":86,"candidates_capped_note":"candidates = papers that had this board among the leaderboards the extractor considered for their tables; the extractor keeps at most 10 per paper and 4 per dataset, so a board crowded out of a paper's list is not counted and candidates is a floor; papers_read_list_full_without_this_board counts the read papers whose list did not hold this board and had reached 10, or held 4 boards of this board's dataset (the only papers that could have crowded it out); papers_read_at_candidate_cap counts, over every board, the papers whose list reached 10","proposed":57,"no_cell_passed_checks":43,"rejected_by_independent_check":10,"accepted_not_placed":0,"awaiting_verdict":0,"placed":4,"placed_entries_listed":4,"file_lines_unreadable_as_read":0,"since_line":"Since the archive (Syntology): 4 placed; 57 newer papers judged to report on this board so far"},"judged_to_report":{"heading":"Newer papers whose tables Claude Sonnet 4.5 judged to report on this benchmark (a model's judgement, not a result; newest first by arXiv id)","judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"a_record_without_a_model":false,"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here","order":"newest first by arXiv id (the identifier's order, not a rank)","outcomes":{"placed":"placed","no_cell_passed_checks":"no cell passed the extractor's checks","refused_by_rule":"refused by a rule","rejected":"rejected by the independent check","accepted_not_placed":"accepted by the independent check but not placed by this site","awaiting":"awaiting a verdict"},"reason_note":"for refused_by_rule, the rules' plain words for the reason codes the record gives (never the quoted or the actual cell text); null for every other outcome","total":57,"shown_on_page":57,"no_cell_split":{"no_cell_passed_checks_in_ledger":43,"rows_refused_by_rule":43,"rows_no_cell_passed_checks":0},"rows":[{"arxiv_id":"2609.16372","outcome":"refused_by_rule","reason":"the model gave no value to check against the cell"},{"arxiv_id":"2609.02264","outcome":"refused_by_rule","reason":"the number the model quoted is not the number printed in the cell it pointed at"},{"arxiv_id":"2608.24087","outcome":"refused_by_rule","reason":"the value is not on the scale of the leaderboard column's archive values"},{"arxiv_id":"2608.15931","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"},{"arxiv_id":"2608.06628","outcome":"rejected","reason":null},{"arxiv_id":"2606.08411","outcome":"refused_by_rule","reason":"the quoted value appears more than once in the row; one configuration gave two values for one column"},{"arxiv_id":"2606.04974","outcome":"rejected","reason":null},{"arxiv_id":"2606.01041","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"},{"arxiv_id":"2605.31164","outcome":"refused_by_rule","reason":"the row label the model quoted is not the row's label"},{"arxiv_id":"2605.30712","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"},{"arxiv_id":"2605.29398","outcome":"refused_by_rule","reason":"the row is an ablation variant, not the method itself"},{"arxiv_id":"2605.26184","outcome":"refused_by_rule","reason":"the number the model quoted is not the number printed in the cell it pointed at"},{"arxiv_id":"2605.22939","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"},{"arxiv_id":"2605.20075","outcome":"refused_by_rule","reason":"the table does not name the leaderboard's dataset"},{"arxiv_id":"2605.16941","outcome":"rejected","reason":null},{"arxiv_id":"2605.13295","outcome":"refused_by_rule","reason":"the number the model quoted is not the number printed in the cell it pointed at"},{"arxiv_id":"2605.12825","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"},{"arxiv_id":"2605.09536","outcome":"refused_by_rule","reason":"one configuration gave two values for one column"},{"arxiv_id":"2605.09188","outcome":"rejected","reason":null},{"arxiv_id":"2605.08134","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"},{"arxiv_id":"2605.07315","outcome":"rejected","reason":null},{"arxiv_id":"2605.03862","outcome":"placed","reason":null},{"arxiv_id":"2605.02263","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"},{"arxiv_id":"2605.01347","outcome":"refused_by_rule","reason":"one configuration gave two values for one column"},{"arxiv_id":"2605.00649","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"},{"arxiv_id":"2604.23626","outcome":"refused_by_rule","reason":"the table does not name the leaderboard's dataset"},{"arxiv_id":"2604.18995","outcome":"refused_by_rule","reason":"the row label the model quoted is not the row's label"},{"arxiv_id":"2604.15750","outcome":"rejected","reason":null},{"arxiv_id":"2604.08302","outcome":"rejected","reason":null},{"arxiv_id":"2604.07622","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"},{"arxiv_id":"2603.25702","outcome":"refused_by_rule","reason":"one configuration gave two values for one column"},{"arxiv_id":"2603.18489","outcome":"refused_by_rule","reason":"one configuration gave two values for one column"},{"arxiv_id":"2603.10088","outcome":"rejected","reason":null},{"arxiv_id":"2603.08026","outcome":"refused_by_rule","reason":"one configuration gave two values for one column"},{"arxiv_id":"2603.06859","outcome":"refused_by_rule","reason":"the number the model quoted is not the number printed in the cell it pointed at"},{"arxiv_id":"2603.02630","outcome":"placed","reason":null},{"arxiv_id":"2602.13773","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"},{"arxiv_id":"2602.12262","outcome":"refused_by_rule","reason":"the row label the model quoted is not the row's label"},{"arxiv_id":"2602.10693","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"},{"arxiv_id":"2602.08404","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"},{"arxiv_id":"2602.06953","outcome":"refused_by_rule","reason":"one configuration gave two values for one column"},{"arxiv_id":"2602.05992","outcome":"refused_by_rule","reason":"one configuration gave two values for one column"},{"arxiv_id":"2601.22527","outcome":"refused_by_rule","reason":"the quoted value appears more than once in the row; one configuration gave two values for one column"},{"arxiv_id":"2601.20810","outcome":"rejected","reason":null},{"arxiv_id":"2601.17917","outcome":"refused_by_rule","reason":"the number the model quoted is not the number printed in the cell it pointed at"},{"arxiv_id":"2601.10403","outcome":"refused_by_rule","reason":"the model gave no value to check against the cell"},{"arxiv_id":"2601.07568","outcome":"placed","reason":null},{"arxiv_id":"2601.07372","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"},{"arxiv_id":"2601.02236","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"},{"arxiv_id":"2512.14681","outcome":"rejected","reason":null},{"arxiv_id":"2511.22972","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"},{"arxiv_id":"2511.05664","outcome":"refused_by_rule","reason":"one configuration gave two values for one column"},{"arxiv_id":"2511.00351","outcome":"refused_by_rule","reason":"the model gave no value to check against the cell"},{"arxiv_id":"2510.05069","outcome":"placed","reason":null},{"arxiv_id":"2510.01938","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"},{"arxiv_id":"2510.00565","outcome":"refused_by_rule","reason":"one configuration gave two values for one column"},{"arxiv_id":"2509.24945","outcome":"refused_by_rule","reason":"the table's column header does not name the leaderboard's metric"}]},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":["Accuracy"],"entries":[{"paper":"/paper/arxiv-2605-03862","paper_title":"Correct Is Not Enough: Training Reasoning Planners with Executor-Grounded Rewards","arxiv_id":"2605.03862","model":"Qwen3-4B TraceLift · Code","row_label":"Qwen3-4B TraceLift","configuration":"Code","configuration_in_model":true,"configuration_not_shown_because":null,"values":{"Accuracy":"65.80"},"date":"2026-05-05","month_from_arxiv_id":null,"where_in_paper":"Table 1, row “Qwen3-4B TraceLift”","table_label":"1","table_label_from":"the caption's own label","table_position_1based":1,"caption_head":"Table 1 : Two-stage results on code and math benchmarks. We use pass@1…","caption_on_page":"shown","cells":[{"column":"Accuracy","cell_text":"65.80","column_header":"Code / MBPP","value":65.8,"table_index_0based":0,"row":10,"col":4}],"code":"3 harvested: 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","samples_harvested":3,"sample_list":"/paper/arxiv-2605-03862#ran","syntology":{"syntology_url":"https://syntology.ai/paper/2605.03862","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2605.03862"}}}},{"paper":"/paper/arxiv-2603-02630","paper_title":"MASPOB: Bandit-Based Prompt Optimization for Multi-Agent Systems with Graph Neural Networks","arxiv_id":"2603.02630","model":"MASPOB · Code","row_label":"MASPOB","configuration":"Code","configuration_in_model":true,"configuration_not_shown_because":null,"values":{"Accuracy":"80.65 ±0.29"},"date":"2026-03-03","month_from_arxiv_id":null,"where_in_paper":"Table 1, row “MASPOB”","table_label":"1","table_label_from":"the caption's own label","table_position_1based":1,"caption_head":"Table 1 : Performance comparison across six benchmarks. We report mean accuracy…","caption_on_page":"shown","cells":[{"column":"Accuracy","cell_text":"80.65 ±0.29","column_header":"Code / MBPP","value":80.65,"table_index_0based":0,"row":9,"col":4}],"code":"repository linked, no samples harvested","samples_harvested":0,"sample_list":null,"syntology":{"syntology_url":"https://syntology.ai/paper/2603.02630","mcp":null}},{"paper":"/paper/arxiv-2601-07568","paper_title":"d3LLM: Ultra-Fast Diffusion LLM using Pseudo-Trajectory Distillation","arxiv_id":"2601.07568","model":"d3LLM-Coder-7B","row_label":"d3LLM-Coder-7B","configuration":null,"configuration_in_model":false,"configuration_not_shown_because":null,"values":{"Accuracy":"80.1"},"date":"2026-01-12","month_from_arxiv_id":null,"where_in_paper":"Table 9, row “d3LLM-Coder-7B”","table_label":"9","table_label_from":"the caption's own label","table_position_1based":9,"caption_head":"Table 9: Comparison of d3LLM-Coder-7B with contenders. We report the Tokens Per…","caption_on_page":"shown","cells":[{"column":"Accuracy","cell_text":"80.1","column_header":"Accuracy \\uparrow","value":80.1,"table_index_0based":8,"row":9,"col":3}],"code":"3 harvested: 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","samples_harvested":3,"sample_list":"/paper/arxiv-2601-07568#ran","syntology":{"syntology_url":"https://syntology.ai/paper/2601.07568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2601.07568"}}}},{"paper":"/paper/arxiv-2510-05069","paper_title":"SwiReasoning: Switch-Thinking in Latent and Explicit for Pareto-Superior Reasoning LLMs","arxiv_id":"2510.05069","model":"SwiR (Ours)","row_label":"SwiR (Ours)","configuration":null,"configuration_in_model":false,"configuration_not_shown_because":null,"values":{"Accuracy":"95.33"},"date":"2025-10-06","month_from_arxiv_id":null,"where_in_paper":"Table 5, row “SwiR (Ours)”","table_label":"5","table_label_from":"the caption's own label","table_position_1based":5,"caption_head":"Table 5: Comparison of SwiReasoning and baselines on coding, multi-hop QA, and…","caption_on_page":"shown","cells":[{"column":"Accuracy","cell_text":"95.33","column_header":"MBPP / MBPP","value":95.33,"table_index_0based":4,"row":5,"col":9}],"code":"6 harvested: 4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","samples_harvested":6,"sample_list":"/paper/arxiv-2510-05069#ran","syntology":{"syntology_url":"https://syntology.ai/paper/2510.05069","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2510.05069"}}}}]},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per row: of M harvested code samples from that row's paper, n_ran executed on a synthesized fixture (n_ran = n_ran_checked + n_instrument; n_instrument counts failures of Syntology's instrument, not of the code); the other M - n_ran are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","key_notes":{"n_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_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)"},"rows_with_graph_line":75,"rows_with_any_sample_ran":68,"rows_with_a_run_with_no_instrument_failure":63,"official":{"state_rule":"the archive's official repositories have samples for this paper that ran: 'official (archive's flag): N ran' (N counts them, instrument failures included); they have samples, none ran: 'official: harvested, nothing ran'; they have no sample for this paper and another sample ran: 'community repositories only' when every sample that ran came from a repository the archive lists for the paper but neither marks official nor records as mentioned in it, or one Syntology harvested outside the archive's links, else 'official: no sample here; runs from other or unrecorded repositories' (a repository named in the paper or found in its text by Syntology, or no repository recorded); otherwise 'official: harvested for another paper' or 'official: not harvested'. Absent when the archive marks no repository official. Official is the archive's is_official flag, not an authorship verdict","flag":"the archive's is_official flag for the paper's code link; not a verdict on who wrote the code","rows_with_an_archive_official_repository":61,"rows_whose_official_repository_has_a_sample_that_ran":49,"rows_whose_official_repository_has_a_run_with_no_instrument_failure":44,"rows_community_repositories_only":8,"rows_runs_from_other_or_unrecorded_repositories":4,"note":"rows[].official, per row with a graph line: repos (marked official in the archive), state, n_ran and n_unverified (samples from those repositories), and ran_from_kinds (the kinds of repository the paper's samples that ran came from; 'unlocated' is no repository recorded)"},"filters":{"ran_modes":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"the page's filters hide rows and never renumber them; they read the Ran cell's counts, the same figures rows[].syntology and rows[].official carry"},"row_route":"rows[].syntology carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","distinct_papers_with_graph_line":22,"distinct_papers_with_any_sample_ran":21,"distinct_papers_with_a_run_with_no_instrument_failure":20,"samples_over_distinct_papers":{"n_ran":216,"n_constructed":37,"n_ran_checked":149,"n_instrument":67,"n_unverified":69,"n_samples":285,"n_pointer_only_licence":44,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":620,"n_constructed":101,"n_ran_checked":385,"n_instrument":235,"n_unverified":242,"n_samples":862,"n_pointer_only_licence":196,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}},"record_sha256":"a907967d2e3f116976f9618a97a25b2636cac87f82ff229c7c7e501574b27504","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}