{"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/program-synthesis/papers/ran/1","list_of":"/task/program-synthesis","task":"Program Synthesis","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,69],"of":69,"counts":{"archive_papers_tagged":423,"with_a_code_link":179,"where_syntology_ran_a_sample":69,"not_listed_spam_title":0,"listed":423,"listed_where_code_ran":69,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":52,"every_run_a_failure_of_syntologys_instrument":17,"listed_with_a_run_with_no_instrument_failure":52,"listed_every_run_a_failure_of_syntologys_instrument":17,"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"},"first_page":"/task/program-synthesis/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/rewriting-pre-training-data-boosts-llm","slug":"rewriting-pre-training-data-boosts-llm","title":"Rewriting Pre-Training Data Boosts LLM Performance in Math and Code","date":"2025-05-05","arxiv_id":"2505.02881","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rewriting-pre-training-data-boosts-llm#ran","syntology_url":"https://syntology.ai/paper/2505.02881","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.02881"}},"official":{"repos":["rioyokotalab/swallow-code-math"],"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"]}}},{"url":"/paper/osvbench-benchmarking-llms-on-specification","slug":"osvbench-benchmarking-llms-on-specification","title":"OSVBench: Benchmarking LLMs on Specification Generation Tasks for Operating System Verification","date":"2025-04-29","arxiv_id":"2504.20964","repositories_listed":1,"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/osvbench-benchmarking-llms-on-specification#ran","syntology_url":"https://syntology.ai/paper/2504.20964","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.20964"}},"official":{"repos":["lishangyu-hkust/osvbench"],"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/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","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","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"}},"official":null}},{"url":"/paper/arc-prize-2024-technical-report","slug":"arc-prize-2024-technical-report","title":"ARC Prize 2024: Technical Report","date":"2024-12-05","arxiv_id":"2412.04604","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/arc-prize-2024-technical-report#ran","syntology_url":"https://syntology.ai/paper/2412.04604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.04604"}},"official":{"repos":["michaelhodel/re-arc"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/searching-latent-program-spaces","slug":"searching-latent-program-spaces","title":"Searching Latent Program Spaces","date":"2024-11-13","arxiv_id":"2411.08706","repositories_listed":1,"syntology":{"n":9,"n_ran":4,"n_constructed":3,"n_ran_checked":3,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/searching-latent-program-spaces#ran","syntology_url":"https://syntology.ai/paper/2411.08706","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.08706"}},"official":{"repos":["clement-bonnet/lpn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/the-surprising-effectiveness-of-test-time","slug":"the-surprising-effectiveness-of-test-time","title":"The Surprising Effectiveness of Test-Time Training for Few-Shot Learning","date":"2024-11-11","arxiv_id":"2411.07279","repositories_listed":1,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/the-surprising-effectiveness-of-test-time#ran","syntology_url":"https://syntology.ai/paper/2411.07279","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.07279"}},"official":{"repos":["ekinakyurek/marc"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/combining-induction-and-transduction-for","slug":"combining-induction-and-transduction-for","title":"Combining Induction and Transduction for Abstract Reasoning","date":"2024-11-04","arxiv_id":"2411.02272","repositories_listed":1,"syntology":{"n":19,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":19,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/combining-induction-and-transduction-for#ran","syntology_url":"https://syntology.ai/paper/2411.02272","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02272"}},"official":{"repos":["xu3kev/barc"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/from-easy-to-hard-tackling-quantum-problems","slug":"from-easy-to-hard-tackling-quantum-problems","title":"Reinforcement learning with learned gadgets to tackle hard quantum problems on real hardware","date":"2024-10-31","arxiv_id":"2411.00230","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/from-easy-to-hard-tackling-quantum-problems#ran","syntology_url":"https://syntology.ai/paper/2411.00230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.00230"}},"official":{"repos":["aqasch/gadget_rl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/tackling-the-abstraction-and-reasoning-corpus-1","slug":"tackling-the-abstraction-and-reasoning-corpus-1","title":"Tackling the Abstraction and Reasoning Corpus with Vision Transformers: the Importance of 2D Representation, Positions, and Objects","date":"2024-10-08","arxiv_id":"2410.06405","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/tackling-the-abstraction-and-reasoning-corpus-1#ran","syntology_url":"https://syntology.ai/paper/2410.06405","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.06405"}},"official":{"repos":["khalil-research/ViTARC"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/autosafecoder-a-multi-agent-framework-for","slug":"autosafecoder-a-multi-agent-framework-for","title":"AutoSafeCoder: A Multi-Agent Framework for Securing LLM Code Generation through Static Analysis and Fuzz Testing","date":"2024-09-16","arxiv_id":"2409.10737","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/autosafecoder-a-multi-agent-framework-for#ran","syntology_url":"https://syntology.ai/paper/2409.10737","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.10737"}},"official":{"repos":["secureaiautonomylab/autosafecoder"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/syntax-guided-procedural-synthesis-of","slug":"syntax-guided-procedural-synthesis-of","title":"Procedural Synthesis of Synthesizable Molecules","date":"2024-08-24","arxiv_id":"2409.05873","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":1,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 1 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/syntax-guided-procedural-synthesis-of#ran","syntology_url":"https://syntology.ai/paper/2409.05873","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.05873"}},"official":{"repos":["shiningsunnyday/synthesisnet"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":1,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/relational-decomposition-for-program","slug":"relational-decomposition-for-program","title":"Relational decomposition for program synthesis","date":"2024-08-22","arxiv_id":"2408.12212","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":14,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/relational-decomposition-for-program#ran","syntology_url":"https://syntology.ai/paper/2408.12212","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.12212"}},"official":{"repos":["celinehocquette/ijcai25-relational-decomposition"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/fvel-interactive-formal-verification","slug":"fvel-interactive-formal-verification","title":"FVEL: Interactive Formal Verification Environment with Large Language Models via Theorem Proving","date":"2024-06-20","arxiv_id":"2406.14408","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fvel-interactive-formal-verification#ran","syntology_url":"https://syntology.ai/paper/2406.14408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14408"}},"official":{"repos":["fveler/fvel"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/generating-code-world-models-with-large","slug":"generating-code-world-models-with-large","title":"Generating Code World Models with Large Language Models Guided by Monte Carlo Tree Search","date":"2024-05-24","arxiv_id":"2405.15383","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/generating-code-world-models-with-large#ran","syntology_url":"https://syntology.ai/paper/2405.15383","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15383"}},"official":{"repos":["nicoladainese96/code-world-models"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/goals-as-reward-producing-programs","slug":"goals-as-reward-producing-programs","title":"Goals as Reward-Producing Programs","date":"2024-05-21","arxiv_id":"2405.13242","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/goals-as-reward-producing-programs#ran","syntology_url":"https://syntology.ai/paper/2405.13242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.13242"}},"official":{"repos":["guydav/goals-as-reward-producing-programs"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/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","repositories_listed":2,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","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"}},"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"]}}},{"url":"/paper/top-leaderboard-ranking-top-coding","slug":"top-leaderboard-ranking-top-coding","title":"Top Leaderboard Ranking = Top Coding Proficiency, Always? EvoEval: Evolving Coding Benchmarks via LLM","date":"2024-03-28","arxiv_id":"2403.19114","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/top-leaderboard-ranking-top-coding#ran","syntology_url":"https://syntology.ai/paper/2403.19114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.19114"}},"official":{"repos":["evo-eval/evoeval"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/constrained-decoding-for-code-language-models","slug":"constrained-decoding-for-code-language-models","title":"Constrained Decoding for Fill-in-the-Middle Code Language Models via Efficient Left and Right Quotienting of Context-Sensitive Grammars","date":"2024-02-28","arxiv_id":"2402.17988","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/constrained-decoding-for-code-language-models#ran","syntology_url":"https://syntology.ai/paper/2402.17988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.17988"}},"official":{"repos":["amazon-science/incremental-parsing"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/humaneval-on-latest-gpt-models-2024","slug":"humaneval-on-latest-gpt-models-2024","title":"HumanEval on Latest GPT Models -- 2024","date":"2024-02-20","arxiv_id":"2402.14852","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/humaneval-on-latest-gpt-models-2024#ran","syntology_url":"https://syntology.ai/paper/2402.14852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.14852"}},"official":{"repos":["daniel442li/gpt-human-eval"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/swissnyf-tool-grounded-llm-agents-for-black","slug":"swissnyf-tool-grounded-llm-agents-for-black","title":"SwissNYF: Tool Grounded LLM Agents for Black Box Setting","date":"2024-02-15","arxiv_id":"2402.10051","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/swissnyf-tool-grounded-llm-agents-for-black#ran","syntology_url":"https://syntology.ai/paper/2402.10051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.10051"}},"official":{"repos":["iclr-dummy-user/swissnyf"],"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"]}}},{"url":"/paper/pix2code-learning-to-compose-neural-visual","slug":"pix2code-learning-to-compose-neural-visual","title":"Pix2Code: Learning to Compose Neural Visual Concepts as Programs","date":"2024-02-13","arxiv_id":"2402.08280","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pix2code-learning-to-compose-neural-visual#ran","syntology_url":"https://syntology.ai/paper/2402.08280","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.08280"}},"official":{"repos":["ml-research/pix2code"],"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"]}}},{"url":"/paper/codeit-self-improving-language-models-with","slug":"codeit-self-improving-language-models-with","title":"CodeIt: Self-Improving Language Models with Prioritized Hindsight Replay","date":"2024-02-07","arxiv_id":"2402.04858","repositories_listed":1,"syntology":{"n":41,"n_ran":32,"n_constructed":4,"n_ran_checked":10,"n_instrument":22,"n_unverified":9,"n_honours":4,"n_violates":2,"n_no_contract":4,"n_pointer_only":41,"phrase":"32 ran (of which 4 constructed an object rather than computing a result; 10 with no instrument failure: 4 honoured, 2 violated, 4 with no contract checked; 22 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/codeit-self-improving-language-models-with#ran","syntology_url":"https://syntology.ai/paper/2402.04858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04858"}},"official":{"repos":["Qualcomm-AI-research/codeit"],"state":"official (archive's flag): 32 ran","n_ran":32,"n_constructed":4,"n_ran_no_instrument_failure":10,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/opening-the-ai-black-box-program-synthesis","slug":"opening-the-ai-black-box-program-synthesis","title":"Opening the AI black box: program synthesis via mechanistic interpretability","date":"2024-02-07","arxiv_id":"2402.05110","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/opening-the-ai-black-box-program-synthesis#ran","syntology_url":"https://syntology.ai/paper/2402.05110","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.05110"}},"official":{"repos":["ejmichaud/neural-verification"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/regal-refactoring-programs-to-discover","slug":"regal-refactoring-programs-to-discover","title":"ReGAL: Refactoring Programs to Discover Generalizable Abstractions","date":"2024-01-29","arxiv_id":"2401.16467","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/regal-refactoring-programs-to-discover#ran","syntology_url":"https://syntology.ai/paper/2401.16467","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.16467"}},"official":{"repos":["esteng/regal_program_learning"],"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"]}}},{"url":"/paper/generating-pragmatic-examples-to-train-neural","slug":"generating-pragmatic-examples-to-train-neural","title":"Generating Pragmatic Examples to Train Neural Program Synthesizers","date":"2023-11-09","arxiv_id":"2311.05740","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/generating-pragmatic-examples-to-train-neural#ran","syntology_url":"https://syntology.ai/paper/2311.05740","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.05740"}},"official":{"repos":["saujasv/generating-pragmatic-examples"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/lilo-learning-interpretable-libraries-by","slug":"lilo-learning-interpretable-libraries-by","title":"LILO: Learning Interpretable Libraries by Compressing and Documenting Code","date":"2023-10-30","arxiv_id":"2310.19791","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lilo-learning-interpretable-libraries-by#ran","syntology_url":"https://syntology.ai/paper/2310.19791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.19791"}},"official":{"repos":["gabegrand/lilo"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-mdl-logic-programs-from-noisy-data","slug":"learning-mdl-logic-programs-from-noisy-data","title":"Learning MDL logic programs from noisy data","date":"2023-08-18","arxiv_id":"2308.09393","repositories_listed":1,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":16,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-mdl-logic-programs-from-noisy-data#ran","syntology_url":"https://syntology.ai/paper/2308.09393","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09393"}},"official":{"repos":["celinehocquette/aaai24-maxsynth"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/exedec-execution-decomposition-for","slug":"exedec-execution-decomposition-for","title":"ExeDec: Execution Decomposition for Compositional Generalization in Neural Program Synthesis","date":"2023-07-26","arxiv_id":"2307.13883","repositories_listed":0,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/exedec-execution-decomposition-for#ran","syntology_url":"https://syntology.ai/paper/2307.13883","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.13883"}},"official":null}},{"url":"/paper/rltf-reinforcement-learning-from-unit-test","slug":"rltf-reinforcement-learning-from-unit-test","title":"RLTF: Reinforcement Learning from Unit Test Feedback","date":"2023-07-10","arxiv_id":"2307.04349","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"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) · 3 unverified","sample_list":"/paper/rltf-reinforcement-learning-from-unit-test#ran","syntology_url":"https://syntology.ai/paper/2307.04349","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.04349"}},"official":{"repos":["zyq-scut/rltf"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/lambdabeam-neural-program-search-with-higher","slug":"lambdabeam-neural-program-search-with-higher","title":"LambdaBeam: Neural Program Search with Higher-Order Functions and Lambdas","date":"2023-06-03","arxiv_id":"2306.02049","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lambdabeam-neural-program-search-with-higher#ran","syntology_url":"https://syntology.ai/paper/2306.02049","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02049"}},"official":null}},{"url":"/paper/critic-large-language-models-can-self-correct","slug":"critic-large-language-models-can-self-correct","title":"CRITIC: Large Language Models Can Self-Correct with Tool-Interactive Critiquing","date":"2023-05-19","arxiv_id":"2305.11738","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/critic-large-language-models-can-self-correct#ran","syntology_url":"https://syntology.ai/paper/2305.11738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.11738"}},"official":{"repos":["microsoft/ProphetNet"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/evidence-of-meaning-in-language-models","slug":"evidence-of-meaning-in-language-models","title":"Emergent Representations of Program Semantics in Language Models Trained on Programs","date":"2023-05-18","arxiv_id":"2305.11169","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":0,"n_instrument":12,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":13,"phrase":"12 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; 12 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/evidence-of-meaning-in-language-models#ran","syntology_url":"https://syntology.ai/paper/2305.11169","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.11169"}},"official":{"repos":["charlesjin/emergent-semantics"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/is-your-code-generated-by-chatgpt-really-1","slug":"is-your-code-generated-by-chatgpt-really-1","title":"Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generation","date":"2023-05-02","arxiv_id":"2305.01210","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/is-your-code-generated-by-chatgpt-really-1#ran","syntology_url":"https://syntology.ai/paper/2305.01210","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.01210"}},"official":{"repos":["evalplus/evalplus"],"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"]}}},{"url":"/paper/outline-then-details-syntactically-guided","slug":"outline-then-details-syntactically-guided","title":"Outline, Then Details: Syntactically Guided Coarse-To-Fine Code Generation","date":"2023-04-28","arxiv_id":"2305.00909","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":1,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"7 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/outline-then-details-syntactically-guided#ran","syntology_url":"https://syntology.ai/paper/2305.00909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.00909"}},"official":{"repos":["vita-group/chaincoder"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":1,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-code-generation-by-training-with","slug":"improving-code-generation-by-training-with","title":"Improving Code Generation by Training with Natural Language Feedback","date":"2023-03-28","arxiv_id":"2303.16749","repositories_listed":1,"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/improving-code-generation-by-training-with#ran","syntology_url":"https://syntology.ai/paper/2303.16749","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.16749"}},"official":{"repos":["nyu-mll/ILF-for-code-generation"],"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/xcodeeval-a-large-scale-multilingual","slug":"xcodeeval-a-large-scale-multilingual","title":"xCodeEval: A Large Scale Multilingual Multitask Benchmark for Code Understanding, Generation, Translation and Retrieval","date":"2023-03-06","arxiv_id":"2303.03004","repositories_listed":4,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/xcodeeval-a-large-scale-multilingual#ran","syntology_url":"https://syntology.ai/paper/2303.03004","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.03004"}},"official":{"repos":["ntunlp/xCodeEval"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["named_in_paper","official"]}}},{"url":"/paper/execution-based-code-generation-using-deep","slug":"execution-based-code-generation-using-deep","title":"Execution-based Code Generation using Deep Reinforcement Learning","date":"2023-01-31","arxiv_id":"2301.13816","repositories_listed":1,"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/execution-based-code-generation-using-deep#ran","syntology_url":"https://syntology.ai/paper/2301.13816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.13816"}},"official":{"repos":["reddy-lab-code-research/PPOCoder"],"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/parsel-a-unified-natural-language-framework","slug":"parsel-a-unified-natural-language-framework","title":"Parsel: Algorithmic Reasoning with Language Models by Composing Decompositions","date":"2022-12-20","arxiv_id":"2212.10561","repositories_listed":1,"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/parsel-a-unified-natural-language-framework#ran","syntology_url":"https://syntology.ai/paper/2212.10561","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.10561"}},"official":{"repos":["ezelikman/parsel"],"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/large-language-models-are-human-level-prompt","slug":"large-language-models-are-human-level-prompt","title":"Large Language Models Are Human-Level Prompt Engineers","date":"2022-11-03","arxiv_id":"2211.01910","repositories_listed":5,"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/large-language-models-are-human-level-prompt#ran","syntology_url":"https://syntology.ai/paper/2211.01910","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.01910"}},"official":{"repos":["keirp/automatic_prompt_engineer"],"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/coderl-mastering-code-generation-through","slug":"coderl-mastering-code-generation-through","title":"CodeRL: Mastering Code Generation through Pretrained Models and Deep Reinforcement Learning","date":"2022-07-05","arxiv_id":"2207.01780","repositories_listed":2,"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/coderl-mastering-code-generation-through#ran","syntology_url":"https://syntology.ai/paper/2207.01780","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.01780"}},"official":{"repos":["salesforce/coderl"],"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/github-copilot-ai-pair-programmer-asset-or","slug":"github-copilot-ai-pair-programmer-asset-or","title":"GitHub Copilot AI pair programmer: Asset or Liability?","date":"2022-06-30","arxiv_id":"2206.15331","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/github-copilot-ai-pair-programmer-asset-or#ran","syntology_url":"https://syntology.ai/paper/2206.15331","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.15331"}},"official":{"repos":["copilot-eval-replication-package/copilotevaluation"],"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"]}}},{"url":"/paper/learning-from-self-sampled-correct-and","slug":"learning-from-self-sampled-correct-and","title":"Learning Math Reasoning from Self-Sampled Correct and Partially-Correct Solutions","date":"2022-05-28","arxiv_id":"2205.14318","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/learning-from-self-sampled-correct-and#ran","syntology_url":"https://syntology.ai/paper/2205.14318","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.14318"}},"official":{"repos":["microsoft/tracecodegen"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/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","repositories_listed":3,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","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"}},"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"]}}},{"url":"/paper/a-conversational-paradigm-for-program","slug":"a-conversational-paradigm-for-program","title":"CodeGen: An Open Large Language Model for Code with Multi-Turn Program Synthesis","date":"2022-03-25","arxiv_id":"2203.13474","repositories_listed":8,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":4,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-conversational-paradigm-for-program#ran","syntology_url":"https://syntology.ai/paper/2203.13474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.13474"}},"official":{"repos":["salesforce/CodeGen","salesforce/jaxformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/crossbeam-learning-to-search-in-bottom-up-1","slug":"crossbeam-learning-to-search-in-bottom-up-1","title":"CrossBeam: Learning to Search in Bottom-Up Program Synthesis","date":"2022-03-20","arxiv_id":"2203.10452","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/crossbeam-learning-to-search-in-bottom-up-1#ran","syntology_url":"https://syntology.ai/paper/2203.10452","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10452"}},"official":{"repos":["google-research/crossbeam"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/less-is-more-summary-of-long-instructions-is","slug":"less-is-more-summary-of-long-instructions-is","title":"Less is More: Summary of Long Instructions is Better for Program Synthesis","date":"2022-03-16","arxiv_id":"2203.08597","repositories_listed":1,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/less-is-more-summary-of-long-instructions-is#ran","syntology_url":"https://syntology.ai/paper/2203.08597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.08597"}},"official":{"repos":["kurbster/prompt-summarization"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-neural-network-solves-and-generates","slug":"a-neural-network-solves-and-generates","title":"A Neural Network Solves, Explains, and Generates University Math Problems by Program Synthesis and Few-Shot Learning at Human Level","date":"2021-12-31","arxiv_id":"2112.15594","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-neural-network-solves-and-generates#ran","syntology_url":"https://syntology.ai/paper/2112.15594","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.15594"}},"official":{"repos":["idrori/mathq"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-synthesize-programs-as","slug":"learning-to-synthesize-programs-as","title":"Learning to Synthesize Programs as Interpretable and Generalizable Policies","date":"2021-08-31","arxiv_id":"2108.13643","repositories_listed":1,"syntology":{"n":20,"n_ran":15,"n_constructed":6,"n_ran_checked":8,"n_instrument":7,"n_unverified":5,"n_honours":0,"n_violates":2,"n_no_contract":6,"n_pointer_only":0,"phrase":"15 ran (of which 6 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 2 violated, 6 with no contract checked; 7 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-to-synthesize-programs-as#ran","syntology_url":"https://syntology.ai/paper/2108.13643","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.13643"}},"official":null}},{"url":"/paper/mwp-bert-a-strong-baseline-for-math-word","slug":"mwp-bert-a-strong-baseline-for-math-word","title":"MWP-BERT: Numeracy-Augmented Pre-training for Math Word Problem Solving","date":"2021-07-28","arxiv_id":"2107.13435","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 2 unverified","sample_list":"/paper/mwp-bert-a-strong-baseline-for-math-word#ran","syntology_url":"https://syntology.ai/paper/2107.13435","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.13435"}},"official":{"repos":["lzhenwen/mwp-bert"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/latent-execution-for-neural-program-synthesis","slug":"latent-execution-for-neural-program-synthesis","title":"Latent Execution for Neural Program Synthesis","date":"2021-06-29","arxiv_id":"2107.00101","repositories_listed":1,"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":2,"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/latent-execution-for-neural-program-synthesis#ran","syntology_url":"https://syntology.ai/paper/2107.00101","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.00101"}},"official":{"repos":["jungyhuk/latent-execution"],"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/learning-to-combine-per-example-solutions-for","slug":"learning-to-combine-per-example-solutions-for","title":"Learning to Combine Per-Example Solutions for Neural Program Synthesis","date":"2021-06-14","arxiv_id":"2106.07175","repositories_listed":1,"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/learning-to-combine-per-example-solutions-for#ran","syntology_url":"https://syntology.ai/paper/2106.07175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07175"}},"official":{"repos":["shrivastavadisha/N-PEPS"],"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/program-synthesis-guided-reinforcement","slug":"program-synthesis-guided-reinforcement","title":"Program Synthesis Guided Reinforcement Learning for Partially Observed Environments","date":"2021-02-22","arxiv_id":"2102.11137","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/program-synthesis-guided-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2102.11137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11137"}},"official":{"repos":["yycdavid/program-synthesis-guided-rl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/synthesize-execute-and-debug-learning-to","slug":"synthesize-execute-and-debug-learning-to","title":"Synthesize, Execute and Debug: Learning to Repair for Neural Program Synthesis","date":"2020-07-16","arxiv_id":"2007.08095","repositories_listed":1,"syntology":{"n":19,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/synthesize-execute-and-debug-learning-to#ran","syntology_url":"https://syntology.ai/paper/2007.08095","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.08095"}},"official":null}},{"url":"/paper/sketchgraphs-a-large-scale-dataset-for","slug":"sketchgraphs-a-large-scale-dataset-for","title":"SketchGraphs: A Large-Scale Dataset for Modeling Relational Geometry in Computer-Aided Design","date":"2020-07-16","arxiv_id":"2007.08506","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sketchgraphs-a-large-scale-dataset-for#ran","syntology_url":"https://syntology.ai/paper/2007.08506","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.08506"}},"official":{"repos":["PrincetonLIPS/SketchGraphs"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dreamcoder-growing-generalizable","slug":"dreamcoder-growing-generalizable","title":"DreamCoder: Growing generalizable, interpretable knowledge with wake-sleep Bayesian program learning","date":"2020-06-15","arxiv_id":"2006.08381","repositories_listed":3,"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":11,"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/dreamcoder-growing-generalizable#ran","syntology_url":"https://syntology.ai/paper/2006.08381","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08381"}},"official":{"repos":["CatherineWong/dreamcoder"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/graph-based-self-supervised-program-repair","slug":"graph-based-self-supervised-program-repair","title":"Graph-based, Self-Supervised Program Repair from Diagnostic Feedback","date":"2020-05-20","arxiv_id":"2005.10636","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":2,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/graph-based-self-supervised-program-repair#ran","syntology_url":"https://syntology.ai/paper/2005.10636","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.10636"}},"official":{"repos":["michiyasunaga/DrRepair","worksheets.codalab.org/worksheets/0x01838644724a433c932bef4cb5c42fbd"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/tf-coder-program-synthesis-for-tensor","slug":"tf-coder-program-synthesis-for-tensor","title":"TF-Coder: Program Synthesis for Tensor Manipulations","date":"2020-03-19","arxiv_id":"2003.09040","repositories_listed":2,"syntology":{"n":14,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/tf-coder-program-synthesis-for-tensor#ran","syntology_url":"https://syntology.ai/paper/2003.09040","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09040"}},"official":{"repos":["google-research/tensorflow-coder"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/learning-compositional-rules-via-neural","slug":"learning-compositional-rules-via-neural","title":"Learning Compositional Rules via Neural Program Synthesis","date":"2020-03-12","arxiv_id":"2003.05562","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-compositional-rules-via-neural#ran","syntology_url":"https://syntology.ai/paper/2003.05562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05562"}},"official":{"repos":["mtensor/rulesynthesis"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/incremental-sampling-without-replacement-for","slug":"incremental-sampling-without-replacement-for","title":"Incremental Sampling Without Replacement for Sequence Models","date":"2020-02-21","arxiv_id":"2002.09067","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/incremental-sampling-without-replacement-for#ran","syntology_url":"https://syntology.ai/paper/2002.09067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09067"}},"official":{"repos":["google-research/unique-randomizer"],"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/improving-molecular-design-by-stochastic","slug":"improving-molecular-design-by-stochastic","title":"Improving Molecular Design by Stochastic Iterative Target Augmentation","date":"2020-02-11","arxiv_id":"2002.04720","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/improving-molecular-design-by-stochastic#ran","syntology_url":"https://syntology.ai/paper/2002.04720","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.04720"}},"official":{"repos":["yangkevin2/icml2020-stochastic-iterative-target-augmentation"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/natural-to-formal-language-generation-using-1","slug":"natural-to-formal-language-generation-using-1","title":"Mapping Natural-language Problems to Formal-language Solutions Using Structured Neural Representations","date":"2019-10-05","arxiv_id":"1910.02339","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/natural-to-formal-language-generation-using-1#ran","syntology_url":"https://syntology.ai/paper/1910.02339","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02339"}},"official":null}},{"url":"/paper/synthesizing-action-sequences-for-modifying","slug":"synthesizing-action-sequences-for-modifying","title":"Synthesizing Action Sequences for Modifying Model Decisions","date":"2019-09-30","arxiv_id":"1910.00057","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/synthesizing-action-sequences-for-modifying#ran","syntology_url":"https://syntology.ai/paper/1910.00057","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00057"}},"official":null}},{"url":"/paper/program-synthesis-and-semantic-parsing-with","slug":"program-synthesis-and-semantic-parsing-with","title":"Program Synthesis and Semantic Parsing with Learned Code Idioms","date":"2019-06-26","arxiv_id":"1906.10816","repositories_listed":1,"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/program-synthesis-and-semantic-parsing-with#ran","syntology_url":"https://syntology.ai/paper/1906.10816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.10816"}},"official":{"repos":["rshin/seq2struct"],"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/automatic-program-synthesis-of-long-programs","slug":"automatic-program-synthesis-of-long-programs","title":"Automatic Program Synthesis of Long Programs with a Learned Garbage Collector","date":"2018-09-12","arxiv_id":"1809.04682","repositories_listed":1,"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/automatic-program-synthesis-of-long-programs#ran","syntology_url":"https://syntology.ai/paper/1809.04682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.04682"}},"official":{"repos":["amitz25/PCCoder"],"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/memory-augmented-policy-optimization-for","slug":"memory-augmented-policy-optimization-for","title":"Memory Augmented Policy Optimization for Program Synthesis and Semantic Parsing","date":"2018-07-06","arxiv_id":"1807.02322","repositories_listed":4,"syntology":{"n":15,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/memory-augmented-policy-optimization-for#ran","syntology_url":"https://syntology.ai/paper/1807.02322","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.02322"}},"official":{"repos":["crazydonkey200/neural-symbolic-machines"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/naps-natural-program-synthesis-dataset","slug":"naps-natural-program-synthesis-dataset","title":"NAPS: Natural Program Synthesis Dataset","date":"2018-07-06","arxiv_id":"1807.03168","repositories_listed":1,"syntology":{"n":14,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/naps-natural-program-synthesis-dataset#ran","syntology_url":"https://syntology.ai/paper/1807.03168","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.03168"}},"official":null}},{"url":"/paper/houdini-lifelong-learning-as-program","slug":"houdini-lifelong-learning-as-program","title":"HOUDINI: Lifelong Learning as Program Synthesis","date":"2018-03-31","arxiv_id":"1804.00218","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/houdini-lifelong-learning-as-program#ran","syntology_url":"https://syntology.ai/paper/1804.00218","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.00218"}},"official":{"repos":["capergroup/houdini"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/robustfill-neural-program-learning-under","slug":"robustfill-neural-program-learning-under","title":"RobustFill: Neural Program Learning under Noisy I/O","date":"2017-03-21","arxiv_id":"1703.07469","repositories_listed":3,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/robustfill-neural-program-learning-under#ran","syntology_url":"https://syntology.ai/paper/1703.07469","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.07469"}},"official":null}},{"url":"/paper/deepcoder-learning-to-write-programs","slug":"deepcoder-learning-to-write-programs","title":"DeepCoder: Learning to Write Programs","date":"2016-11-07","arxiv_id":"1611.01989","repositories_listed":3,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"8 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deepcoder-learning-to-write-programs#ran","syntology_url":"https://syntology.ai/paper/1611.01989","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01989"}},"official":null}}],"record_sha256":"ed029e3b68eb76a5f61ef1ed2ff054c618e8eb6f1944f2d8b9230f508ca385e9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}