{"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":"/task/text-to-code-generation","name":"Text-to-Code Generation","slug":"text-to-code-generation","description_markdown":"**Text-to-Code Generation** is a task where we can generate code based on the natural language description.\r\n\r\nSource: [Text-to-code Generation with TensorFlow, 🤗 & MBPP](https://www.kaggle.com/code/rhtsingh/text-to-code-generation-with-tensorflow-mbpp)","categories":[{"name":"Computer Code","url":"/area/computer-code"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":20,"papers_with_code":12,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":10,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/text-to-code-generation-on-codexglue-concode","slug":"text-to-code-generation-on-codexglue-concode","dataset":"CodeXGLUE - CONCODE","dataset_url":"/dataset/codexglue","rows_in_archive":2,"metrics":["BLEU","CodeBLEU","EM"],"first_row_in_archive_order":{"model":"CodeT5","paper_title":"CodeT5: Identifier-aware Unified Pre-trained Encoder-Decoder Models for Code Understanding and Generation","paper_url":"/paper/codet5-identifier-aware-unified-pre-trained","paper_date":"2021-09-02","arxiv_id":"2109.00859","code_links":[{"title":"salesforce/codet5","url":"https://github.com/salesforce/codet5"},{"title":"salesforce/coderl","url":"https://github.com/salesforce/coderl"},{"title":"awsm-research/vulrepair","url":"https://github.com/awsm-research/vulrepair"},{"title":"jetbrains-research/commit_message_generation","url":"https://github.com/jetbrains-research/commit_message_generation"},{"title":"fewshotcdcs/cdcs","url":"https://github.com/fewshotcdcs/cdcs"}],"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/codet5-identifier-aware-unified-pre-trained#ran","syntology_url":"https://syntology.ai/paper/2109.00859","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.00859"}},"official":{"repos":["salesforce/codet5"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}}}],"datasets":[{"url":"/dataset/codexglue","name":"CodeXGLUE","full_name":"","num_papers_in_archive":205},{"url":"/dataset/codecontests","name":"CodeContests","full_name":"","num_papers_in_archive":84},{"url":"/dataset/pytorrent","name":"PyTorrent","full_name":"PyTorrent","num_papers_in_archive":5},{"url":"/dataset/safim","name":"SAFIM","full_name":"Syntax-Aware Fill-In-the-Middle","num_papers_in_archive":5},{"url":"/dataset/blendnet","name":"BlendNet","full_name":"","num_papers_in_archive":1},{"url":"/dataset/cadbench","name":"CADBench","full_name":"","num_papers_in_archive":1},{"url":"/dataset/micro25","name":"MICRO25","full_name":"","num_papers_in_archive":1},{"url":"/dataset/res-q","name":"RES-Q","full_name":"RES-Q: Evaluating Code-Editing Large Language Model Systems at the Repository Scale","num_papers_in_archive":1},{"url":"/dataset/verireason-rtl-coder-7b-reasoning-tb","name":"Verireason-RTL-Coder_7b_reasoning_tb","full_name":"VeriReason Verilog Dataset with Reasoning, Testbench, and Simulation Results","num_papers_in_archive":1},{"url":"/dataset/verireason-rtl-coder-7b-reasoning-tb-simple","name":"Verireason-RTL-Coder_7b_reasoning_tb_simple","full_name":"Simple Problems of VeriReason Verilog Dataset with Reasoning, Testbench, and Simulation Results","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":20,"of":20,"of_with_code":12,"tagged_in_all":20,"counts":{"archive_papers_tagged":20,"with_a_code_link":12,"where_syntology_ran_a_sample":8,"not_listed_spam_title":0,"listed":20,"listed_where_code_ran":8,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":5,"listed_every_run_a_failure_of_syntologys_instrument":3,"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 the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/codexglue-a-machine-learning-benchmark","slug":"codexglue-a-machine-learning-benchmark","title":"CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generation","date":"2021-02-09","arxiv_id":"2102.04664","repositories_listed":7,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"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) · 0 unverified","sample_list":"/paper/codexglue-a-machine-learning-benchmark#ran","syntology_url":"https://syntology.ai/paper/2102.04664","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.04664"}},"official":{"repos":["microsoft/CodeXGLUE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/codet5-identifier-aware-unified-pre-trained","slug":"codet5-identifier-aware-unified-pre-trained","title":"CodeT5: Identifier-aware Unified Pre-trained Encoder-Decoder Models for Code Understanding and Generation","date":"2021-09-02","arxiv_id":"2109.00859","repositories_listed":5,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/codet5-identifier-aware-unified-pre-trained#ran","syntology_url":"https://syntology.ai/paper/2109.00859","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.00859"}},"official":{"repos":["salesforce/codet5"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/magicoder-source-code-is-all-you-need","slug":"magicoder-source-code-is-all-you-need","title":"Magicoder: Empowering Code Generation with OSS-Instruct","date":"2023-12-04","arxiv_id":"2312.02120","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"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) · 1 unverified","sample_list":"/paper/magicoder-source-code-is-all-you-need#ran","syntology_url":"https://syntology.ai/paper/2312.02120","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02120"}},"official":{"repos":["ise-uiuc/magicoder"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bridging-the-gap-between-open-source-and","slug":"bridging-the-gap-between-open-source-and","title":"Bridging the Gap Between Open-Source and Proprietary LLMs in Table QA","date":"2025-06-11","arxiv_id":"2506.09657","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":4,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","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"}},"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"]}}},{"url":"/paper/inversecoder-unleashing-the-power-of","slug":"inversecoder-unleashing-the-power-of","title":"InverseCoder: Self-improving Instruction-Tuned Code LLMs with Inverse-Instruct","date":"2024-07-08","arxiv_id":"2407.05700","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":2,"n_instrument":9,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":11,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 9 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/inversecoder-unleashing-the-power-of#ran","syntology_url":"https://syntology.ai/paper/2407.05700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.05700"}},"official":{"repos":["wyt2000/InverseCoder"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/from-words-to-routes-applying-large-language","slug":"from-words-to-routes-applying-large-language","title":"Can Large Language Models Solve Robot Routing?","date":"2024-03-16","arxiv_id":"2403.10795","repositories_listed":1,"syntology":null},{"url":"/paper/guiding-language-models-of-code-with-global","slug":"guiding-language-models-of-code-with-global","title":"Guiding Language Models of Code with Global Context using Monitors","date":"2023-06-19","arxiv_id":"2306.10763","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/guiding-language-models-of-code-with-global#ran","syntology_url":"https://syntology.ai/paper/2306.10763","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.10763"}},"official":{"repos":["microsoft/monitors4codegen"],"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":["official"]}}},{"url":"/paper/code-execution-with-pre-trained-language","slug":"code-execution-with-pre-trained-language","title":"Code Execution with Pre-trained Language Models","date":"2023-05-08","arxiv_id":"2305.05383","repositories_listed":1,"syntology":null},{"url":"/paper/c3po-a-lightweight-copying-mechanism-for","slug":"c3po-a-lightweight-copying-mechanism-for","title":"C3PO: A Lightweight Copying Mechanism for Translating Pseudocode to Code","date":"2022-11-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/pangu-coder-program-synthesis-with-function","slug":"pangu-coder-program-synthesis-with-function","title":"PanGu-Coder: Program Synthesis with Function-Level Language Modeling","date":"2022-07-22","arxiv_id":"2207.11280","repositories_listed":1,"syntology":null},{"url":"/paper/structcoder-structure-aware-transformer-for","slug":"structcoder-structure-aware-transformer-for","title":"StructCoder: Structure-Aware Transformer for Code Generation","date":"2022-06-10","arxiv_id":"2206.05239","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/structcoder-structure-aware-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2206.05239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.05239"}},"official":{"repos":["reddy-lab-code-research/structcoder"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":null,"slug":"aligning-crowd-sourced-human-feedback-for","title":"Aligning Crowd-sourced Human Feedback for Reinforcement Learning on Code Generation by Large Language Models","date":"2025-03-19","arxiv_id":"2503.15129","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparsepo-controlling-preference-alignment-of","title":"SparsePO: Controlling Preference Alignment of LLMs via Sparse Token Masks","date":"2024-10-07","arxiv_id":"2410.05102","repositories_listed":0,"syntology":null},{"url":"/paper/reranking-laws-for-language-generation-a","slug":"reranking-laws-for-language-generation-a","title":"Reranking Laws for Language Generation: A Communication-Theoretic Perspective","date":"2024-09-11","arxiv_id":"2409.07131","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"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) · 0 unverified","sample_list":"/paper/reranking-laws-for-language-generation-a#ran","syntology_url":"https://syntology.ai/paper/2409.07131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.07131"}},"official":null}},{"url":null,"slug":"can-opensource-beat-chatgpt-a-comparative","title":"Can OpenSource beat ChatGPT? -- A Comparative Study of Large Language Models for Text-to-Code Generation","date":"2024-09-06","arxiv_id":"2409.04164","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-unseen-code-tests-in-infinitum","title":"Generating Unseen Code Tests In Infinitum","date":"2024-07-29","arxiv_id":"2407.19772","repositories_listed":0,"syntology":null},{"url":null,"slug":"text-to-code-generation-with-modality","title":"Text-to-Code Generation with Modality-relative Pre-training","date":"2024-02-08","arxiv_id":"2402.05783","repositories_listed":0,"syntology":null},{"url":"/paper/fine-tuning-large-language-models-for","slug":"fine-tuning-large-language-models-for","title":"Fine-Tuning Large Language Models for Answering Programming Questions with Code Snippets","date":"2023-06-26","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"compilable-neural-code-generation-with","title":"Compilable Neural Code Generation with Compiler Feedback","date":"2022-03-10","arxiv_id":"2203.05132","repositories_listed":0,"syntology":null}],"syntology_records":8,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"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":[]},"papers_where_code_ran":8,"papers_where_code_ran_first_page":"/task/text-to-code-generation/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/text-to-code-generation/papers/ran/1","json":"/task/text-to-code-generation/papers/ran/1.json","rows":8}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper 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"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"748f440dfeeb6cafdfae91b606c93982597d0e9b59b6ccde6157caf2c29d4c01","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}