{"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":"/dataset/mbpp","name":"MBPP","full_name":"Mostly Basic Python Programming","description_markdown":"The benchmark consists of around 1,000 crowd-sourced Python programming problems, designed to be solvable by entry-level programmers, covering programming fundamentals, standard library functionality, and so on. Each problem consists of a task description, code solution and 3 automated test cases.","description_withheld":null,"homepage":"https://github.com/google-research/google-research/tree/master/mbpp","introduced_date":"2021-08-16","introduced_date_note":null,"introduced_by":{"paper":"/paper/program-synthesis-with-large-language-models","title":"Program Synthesis with Large Language Models","first_author":"Jacob Austin","url":null},"license":null,"modalities":[],"tasks":[{"name":"Code Generation","url":"/task/code-generation","datasets_with_task":"/datasets/task/code-generation"}],"languages":[],"variants":["MBPP"],"data_loaders":[],"num_papers_in_archive":666,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/code-generation-on-mbpp","task":"Code Generation","dataset_variant":"MBPP","rows":99,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"EG-CFG (DeepSeek-V3-0324)","paper":"/paper/execution-guided-line-by-line-code-generation","metrics":{"Accuracy":"96.6"},"code_links":[{"title":"boazlavon/eg_cfg","url":"https://github.com/boazlavon/eg_cfg"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":34,"of":34,"counts":{"papers_with_a_benchmark_row":34,"with_a_code_link":30,"where_syntology_ran_a_sample":21,"not_listed_spam_title":0,"listed":34,"listed_where_code_ran":21,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":20,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":20,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/execution-guided-line-by-line-code-generation","slug":"execution-guided-line-by-line-code-generation","title":"Execution Guided Line-by-Line Code Generation","date":"2025-06-12","arxiv_id":"2506.10948","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/codesim-multi-agent-code-generation-and-1","slug":"codesim-multi-agent-code-generation-and-1","title":"CODESIM: Multi-Agent Code Generation and Problem Solving through Simulation-Driven Planning and Debugging","date":"2025-02-08","arxiv_id":"2502.05664","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/qualityflow-an-agentic-workflow-for-program","slug":"qualityflow-an-agentic-workflow-for-program","title":"QualityFlow: An Agentic Workflow for Program Synthesis Controlled by LLM Quality Checks","date":"2025-01-20","arxiv_id":"2501.17167","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/planning-driven-programming-a-large-language","slug":"planning-driven-programming-a-large-language","title":"Planning-Driven Programming: A Large Language Model Programming Workflow","date":"2024-11-21","arxiv_id":"2411.14503","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":5,"samples_unverified":0,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/aflow-automating-agentic-workflow-generation","slug":"aflow-automating-agentic-workflow-generation","title":"AFlow: Automating Agentic Workflow Generation","date":"2024-10-14","arxiv_id":"2410.10762","rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/from-code-to-correctness-closing-the-last","slug":"from-code-to-correctness-closing-the-last","title":"From Code to Correctness: Closing the Last Mile of Code Generation with Hierarchical Debugging","date":"2024-10-02","arxiv_id":"2410.01215","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":3,"samples_unverified":1,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/mapcoder-multi-agent-code-generation-for","slug":"mapcoder-multi-agent-code-generation-for","title":"MapCoder: Multi-Agent Code Generation for Competitive Problem Solving","date":"2024-05-18","arxiv_id":"2405.11403","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/when-llm-based-code-generation-meets-the","slug":"when-llm-based-code-generation-meets-the","title":"SOEN-101: Code Generation by Emulating Software Process Models Using Large Language Model Agents","date":"2024-03-23","arxiv_id":"2403.15852","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/branch-train-mix-mixing-expert-llms-into-a","slug":"branch-train-mix-mixing-expert-llms-into-a","title":"Branch-Train-MiX: Mixing Expert LLMs into a Mixture-of-Experts LLM","date":"2024-03-12","arxiv_id":"2403.07816","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/the-claude-3-model-family-opus-sonnet-haiku","slug":"the-claude-3-model-family-opus-sonnet-haiku","title":"The Claude 3 Model Family: Opus, Sonnet, Haiku","date":"2024-03-04","arxiv_id":null,"rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/starcoder-2-and-the-stack-v2-the-next","slug":"starcoder-2-and-the-stack-v2-the-next","title":"StarCoder 2 and The Stack v2: The Next Generation","date":"2024-02-29","arxiv_id":"2402.19173","rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/deepseek-coder-when-the-large-language-model","slug":"deepseek-coder-when-the-large-language-model","title":"DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligence","date":"2024-01-25","arxiv_id":"2401.14196","rows_on_this_dataset":8,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":6,"samples_unverified":1,"pointer_only_for_licence":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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/mixtral-of-experts","slug":"mixtral-of-experts","title":"Mixtral of Experts","date":"2024-01-08","arxiv_id":"2401.04088","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":5,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/parameter-efficient-sparsity-crafting-from","slug":"parameter-efficient-sparsity-crafting-from","title":"Parameter-Efficient Sparsity Crafting from Dense to Mixture-of-Experts for Instruction Tuning on General Tasks","date":"2024-01-05","arxiv_id":"2401.02731","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/agentcoder-multi-agent-based-code-generation","slug":"agentcoder-multi-agent-based-code-generation","title":"AgentCoder: Multi-Agent-based Code Generation with Iterative Testing and Optimisation","date":"2023-12-20","arxiv_id":"2312.13010","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/intervenor-prompt-the-coding-ability-of-large","slug":"intervenor-prompt-the-coding-ability-of-large","title":"INTERVENOR: Prompting the Coding Ability of Large Language Models with the Interactive Chain of Repair","date":"2023-11-16","arxiv_id":"2311.09868","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/mistral-7b","slug":"mistral-7b","title":"Mistral 7B","date":"2023-10-10","arxiv_id":"2310.06825","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mistral-7b#ran","syntology_url":"https://syntology.ai/paper/2310.06825","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.06825"}}}},{"paper":"/paper/language-agent-tree-search-unifies-reasoning","slug":"language-agent-tree-search-unifies-reasoning","title":"Language Agent Tree Search Unifies Reasoning Acting and Planning in Language Models","date":"2023-10-06","arxiv_id":"2310.04406","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":4,"samples_unverified":0,"pointer_only_for_licence":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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/textbooks-are-all-you-need-ii-phi-1-5","slug":"textbooks-are-all-you-need-ii-phi-1-5","title":"Textbooks Are All You Need II: phi-1.5 technical report","date":"2023-09-11","arxiv_id":"2309.05463","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/code-llama-open-foundation-models-for-code","slug":"code-llama-open-foundation-models-for-code","title":"Code Llama: Open Foundation Models for Code","date":"2023-08-24","arxiv_id":"2308.12950","rows_on_this_dataset":14,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":4,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/chatgpt-for-software-security-exploring-the","slug":"chatgpt-for-software-security-exploring-the","title":"How Does Naming Affect LLMs on Code Analysis Tasks?","date":"2023-07-24","arxiv_id":"2307.12488","rows_on_this_dataset":5,"code_links":0,"syntology":null},{"paper":"/paper/llama-2-open-foundation-and-fine-tuned-chat","slug":"llama-2-open-foundation-and-fine-tuned-chat","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","date":"2023-07-18","arxiv_id":"2307.09288","rows_on_this_dataset":4,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":52,"samples_ran":33,"samples_constructed":7,"samples_ran_checked":20,"samples_ran_instrument_failed":13,"samples_unverified":19,"pointer_only_for_licence":20,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/wizardcoder-empowering-code-large-language","slug":"wizardcoder-empowering-code-large-language","title":"WizardCoder: Empowering Code Large Language Models with Evol-Instruct","date":"2023-06-14","arxiv_id":"2306.08568","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/palm-2-technical-report-1","slug":"palm-2-technical-report-1","title":"PaLM 2 Technical Report","date":"2023-05-17","arxiv_id":"2305.10403","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/starcoder-may-the-source-be-with-you","slug":"starcoder-may-the-source-be-with-you","title":"StarCoder: may the source be with you!","date":"2023-05-09","arxiv_id":"2305.06161","rows_on_this_dataset":3,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/teaching-large-language-models-to-self-debug","slug":"teaching-large-language-models-to-self-debug","title":"Teaching Large Language Models to Self-Debug","date":"2023-04-11","arxiv_id":"2304.05128","rows_on_this_dataset":7,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/codegeex-a-pre-trained-model-for-code","slug":"codegeex-a-pre-trained-model-for-code","title":"CodeGeeX: A Pre-Trained Model for Code Generation with Multilingual Benchmarking on HumanEval-X","date":"2023-03-30","arxiv_id":"2303.17568","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":1,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/llama-open-and-efficient-foundation-language-1","slug":"llama-open-and-efficient-foundation-language-1","title":"LLaMA: Open and Efficient Foundation Language Models","date":"2023-02-27","arxiv_id":"2302.13971","rows_on_this_dataset":4,"code_links":57,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":58,"samples_ran":37,"samples_constructed":9,"samples_ran_checked":25,"samples_ran_instrument_failed":12,"samples_unverified":21,"pointer_only_for_licence":4,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/lever-learning-to-verify-language-to-code","slug":"lever-learning-to-verify-language-to-code","title":"LEVER: Learning to Verify Language-to-Code Generation with Execution","date":"2023-02-16","arxiv_id":"2302.08468","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":22,"samples_ran":18,"samples_constructed":0,"samples_ran_checked":14,"samples_ran_instrument_failed":4,"samples_unverified":4,"pointer_only_for_licence":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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/coder-reviewer-reranking-for-code-generation","slug":"coder-reviewer-reranking-for-code-generation","title":"Coder Reviewer Reranking for Code Generation","date":"2022-11-29","arxiv_id":"2211.16490","rows_on_this_dataset":10,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/codet-code-generation-with-generated-tests","slug":"codet-code-generation-with-generated-tests","title":"CodeT: Code Generation with Generated Tests","date":"2022-07-21","arxiv_id":"2207.10397","rows_on_this_dataset":5,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/natural-language-to-code-translation-with","slug":"natural-language-to-code-translation-with","title":"Natural Language to Code Translation with Execution","date":"2022-04-25","arxiv_id":"2204.11454","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":12,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/incoder-a-generative-model-for-code-infilling","slug":"incoder-a-generative-model-for-code-infilling","title":"InCoder: A Generative Model for Code Infilling and Synthesis","date":"2022-04-12","arxiv_id":"2204.05999","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":3,"samples_unverified":4,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/palm-scaling-language-modeling-with-pathways-1","slug":"palm-scaling-language-modeling-with-pathways-1","title":"PaLM: Scaling Language Modeling with Pathways","date":"2022-04-05","arxiv_id":"2204.02311","rows_on_this_dataset":2,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":37,"samples_ran":32,"samples_constructed":16,"samples_ran_checked":24,"samples_ran_instrument_failed":8,"samples_unverified":5,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/execution-guided-line-by-line-code-generation","slug":"execution-guided-line-by-line-code-generation","title":"Execution Guided Line-by-Line Code Generation","date":"2025-06-12","arxiv_id":"2506.10948","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/codesim-multi-agent-code-generation-and-1","slug":"codesim-multi-agent-code-generation-and-1","title":"CODESIM: Multi-Agent Code Generation and Problem Solving through Simulation-Driven Planning and Debugging","date":"2025-02-08","arxiv_id":"2502.05664","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/qualityflow-an-agentic-workflow-for-program","slug":"qualityflow-an-agentic-workflow-for-program","title":"QualityFlow: An Agentic Workflow for Program Synthesis Controlled by LLM Quality Checks","date":"2025-01-20","arxiv_id":"2501.17167","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/planning-driven-programming-a-large-language","slug":"planning-driven-programming-a-large-language","title":"Planning-Driven Programming: A Large Language Model Programming Workflow","date":"2024-11-21","arxiv_id":"2411.14503","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":5,"samples_unverified":0,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/aflow-automating-agentic-workflow-generation","slug":"aflow-automating-agentic-workflow-generation","title":"AFlow: Automating Agentic Workflow Generation","date":"2024-10-14","arxiv_id":"2410.10762","rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/from-code-to-correctness-closing-the-last","slug":"from-code-to-correctness-closing-the-last","title":"From Code to Correctness: Closing the Last Mile of Code Generation with Hierarchical Debugging","date":"2024-10-02","arxiv_id":"2410.01215","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":3,"samples_unverified":1,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/mapcoder-multi-agent-code-generation-for","slug":"mapcoder-multi-agent-code-generation-for","title":"MapCoder: Multi-Agent Code Generation for Competitive Problem Solving","date":"2024-05-18","arxiv_id":"2405.11403","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/when-llm-based-code-generation-meets-the","slug":"when-llm-based-code-generation-meets-the","title":"SOEN-101: Code Generation by Emulating Software Process Models Using Large Language Model Agents","date":"2024-03-23","arxiv_id":"2403.15852","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/branch-train-mix-mixing-expert-llms-into-a","slug":"branch-train-mix-mixing-expert-llms-into-a","title":"Branch-Train-MiX: Mixing Expert LLMs into a Mixture-of-Experts LLM","date":"2024-03-12","arxiv_id":"2403.07816","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/the-claude-3-model-family-opus-sonnet-haiku","slug":"the-claude-3-model-family-opus-sonnet-haiku","title":"The Claude 3 Model Family: Opus, Sonnet, Haiku","date":"2024-03-04","arxiv_id":null,"rows_on_this_dataset":3,"code_links":0,"syntology":null},{"paper":"/paper/starcoder-2-and-the-stack-v2-the-next","slug":"starcoder-2-and-the-stack-v2-the-next","title":"StarCoder 2 and The Stack v2: The Next Generation","date":"2024-02-29","arxiv_id":"2402.19173","rows_on_this_dataset":1,"code_links":4,"syntology":null},{"paper":"/paper/deepseek-coder-when-the-large-language-model","slug":"deepseek-coder-when-the-large-language-model","title":"DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligence","date":"2024-01-25","arxiv_id":"2401.14196","rows_on_this_dataset":8,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":6,"samples_unverified":1,"pointer_only_for_licence":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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/mixtral-of-experts","slug":"mixtral-of-experts","title":"Mixtral of Experts","date":"2024-01-08","arxiv_id":"2401.04088","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":5,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/parameter-efficient-sparsity-crafting-from","slug":"parameter-efficient-sparsity-crafting-from","title":"Parameter-Efficient Sparsity Crafting from Dense to Mixture-of-Experts for Instruction Tuning on General Tasks","date":"2024-01-05","arxiv_id":"2401.02731","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/agentcoder-multi-agent-based-code-generation","slug":"agentcoder-multi-agent-based-code-generation","title":"AgentCoder: Multi-Agent-based Code Generation with Iterative Testing and Optimisation","date":"2023-12-20","arxiv_id":"2312.13010","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/intervenor-prompt-the-coding-ability-of-large","slug":"intervenor-prompt-the-coding-ability-of-large","title":"INTERVENOR: Prompting the Coding Ability of Large Language Models with the Interactive Chain of Repair","date":"2023-11-16","arxiv_id":"2311.09868","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/mistral-7b","slug":"mistral-7b","title":"Mistral 7B","date":"2023-10-10","arxiv_id":"2310.06825","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mistral-7b#ran","syntology_url":"https://syntology.ai/paper/2310.06825","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.06825"}}}},{"paper":"/paper/language-agent-tree-search-unifies-reasoning","slug":"language-agent-tree-search-unifies-reasoning","title":"Language Agent Tree Search Unifies Reasoning Acting and Planning in Language Models","date":"2023-10-06","arxiv_id":"2310.04406","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":9,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":4,"samples_unverified":0,"pointer_only_for_licence":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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/textbooks-are-all-you-need-ii-phi-1-5","slug":"textbooks-are-all-you-need-ii-phi-1-5","title":"Textbooks Are All You Need II: phi-1.5 technical report","date":"2023-09-11","arxiv_id":"2309.05463","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/code-llama-open-foundation-models-for-code","slug":"code-llama-open-foundation-models-for-code","title":"Code Llama: Open Foundation Models for Code","date":"2023-08-24","arxiv_id":"2308.12950","rows_on_this_dataset":14,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":4,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/chatgpt-for-software-security-exploring-the","slug":"chatgpt-for-software-security-exploring-the","title":"How Does Naming Affect LLMs on Code Analysis Tasks?","date":"2023-07-24","arxiv_id":"2307.12488","rows_on_this_dataset":5,"code_links":0,"syntology":null},{"paper":"/paper/llama-2-open-foundation-and-fine-tuned-chat","slug":"llama-2-open-foundation-and-fine-tuned-chat","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","date":"2023-07-18","arxiv_id":"2307.09288","rows_on_this_dataset":4,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":52,"samples_ran":33,"samples_constructed":7,"samples_ran_checked":20,"samples_ran_instrument_failed":13,"samples_unverified":19,"pointer_only_for_licence":20,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/wizardcoder-empowering-code-large-language","slug":"wizardcoder-empowering-code-large-language","title":"WizardCoder: Empowering Code Large Language Models with Evol-Instruct","date":"2023-06-14","arxiv_id":"2306.08568","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/palm-2-technical-report-1","slug":"palm-2-technical-report-1","title":"PaLM 2 Technical Report","date":"2023-05-17","arxiv_id":"2305.10403","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/starcoder-may-the-source-be-with-you","slug":"starcoder-may-the-source-be-with-you","title":"StarCoder: may the source be with you!","date":"2023-05-09","arxiv_id":"2305.06161","rows_on_this_dataset":3,"code_links":4,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/teaching-large-language-models-to-self-debug","slug":"teaching-large-language-models-to-self-debug","title":"Teaching Large Language Models to Self-Debug","date":"2023-04-11","arxiv_id":"2304.05128","rows_on_this_dataset":7,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/codegeex-a-pre-trained-model-for-code","slug":"codegeex-a-pre-trained-model-for-code","title":"CodeGeeX: A Pre-Trained Model for Code Generation with Multilingual Benchmarking on HumanEval-X","date":"2023-03-30","arxiv_id":"2303.17568","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":8,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":1,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/llama-open-and-efficient-foundation-language-1","slug":"llama-open-and-efficient-foundation-language-1","title":"LLaMA: Open and Efficient Foundation Language Models","date":"2023-02-27","arxiv_id":"2302.13971","rows_on_this_dataset":4,"code_links":57,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":58,"samples_ran":37,"samples_constructed":9,"samples_ran_checked":25,"samples_ran_instrument_failed":12,"samples_unverified":21,"pointer_only_for_licence":4,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/lever-learning-to-verify-language-to-code","slug":"lever-learning-to-verify-language-to-code","title":"LEVER: Learning to Verify Language-to-Code Generation with Execution","date":"2023-02-16","arxiv_id":"2302.08468","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":22,"samples_ran":18,"samples_constructed":0,"samples_ran_checked":14,"samples_ran_instrument_failed":4,"samples_unverified":4,"pointer_only_for_licence":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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/coder-reviewer-reranking-for-code-generation","slug":"coder-reviewer-reranking-for-code-generation","title":"Coder Reviewer Reranking for Code Generation","date":"2022-11-29","arxiv_id":"2211.16490","rows_on_this_dataset":10,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/codet-code-generation-with-generated-tests","slug":"codet-code-generation-with-generated-tests","title":"CodeT: Code Generation with Generated Tests","date":"2022-07-21","arxiv_id":"2207.10397","rows_on_this_dataset":5,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/natural-language-to-code-translation-with","slug":"natural-language-to-code-translation-with","title":"Natural Language to Code Translation with Execution","date":"2022-04-25","arxiv_id":"2204.11454","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":12,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/incoder-a-generative-model-for-code-infilling","slug":"incoder-a-generative-model-for-code-infilling","title":"InCoder: A Generative Model for Code Infilling and Synthesis","date":"2022-04-12","arxiv_id":"2204.05999","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":3,"samples_unverified":4,"pointer_only_for_licence":2,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/palm-scaling-language-modeling-with-pathways-1","slug":"palm-scaling-language-modeling-with-pathways-1","title":"PaLM: Scaling Language Modeling with Pathways","date":"2022-04-05","arxiv_id":"2204.02311","rows_on_this_dataset":2,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":37,"samples_ran":32,"samples_constructed":16,"samples_ran_checked":24,"samples_ran_instrument_failed":8,"samples_unverified":5,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}}],"papers_where_code_ran":21,"papers_where_code_ran_first_page":"/dataset/mbpp/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/mbpp/papers/ran/1","json":"/dataset/mbpp/papers/ran/1.json","rows":21}],"row_route":"each paper's syntology object 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","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":22,"samples_harvested":285,"samples_ran":216,"samples_constructed":37,"samples_ran_checked":149,"samples_ran_instrument_failed":67,"samples_unverified":69,"pointer_only_for_licence":44,"papers_with_no_sample_that_ran":1,"papers_with_a_sample_that_ran":21,"papers_with_a_run_with_no_instrument_failure":20,"papers_where_every_run_was_an_instrument_failure":1,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":57,"papers_placed":4,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"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; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/code-generation-on-mbpp","since_archive":"/sota/code-generation-on-mbpp#since-judged","papers_judged":57,"placed":4}]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"08ef10aee55c5e97fe8b064629c3738a4c393957163f09ac20488f2058b67b4b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}