{"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-induction","name":"Program induction","slug":"program-induction","description_markdown":"Generating program code for domain-specific tasks","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":67,"papers_with_code":24,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"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":1,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/aqua-rat","name":"AQUA-RAT","full_name":"Algebra Question Answering with Rationales","num_papers_in_archive":64}],"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":67,"of":67,"of_with_code":24,"tagged_in_all":67,"counts":{"archive_papers_tagged":67,"with_a_code_link":24,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":67,"listed_where_code_ran":6,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":5,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers 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/deepproblog-neural-probabilistic-logic","slug":"deepproblog-neural-probabilistic-logic","title":"DeepProbLog: Neural Probabilistic Logic Programming","date":"2018-05-28","arxiv_id":"1805.10872","repositories_listed":4,"syntology":null},{"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/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/llm-sr-scientific-equation-discovery-via","slug":"llm-sr-scientific-equation-discovery-via","title":"LLM-SR: Scientific Equation Discovery via Programming with Large Language Models","date":"2024-04-29","arxiv_id":"2404.18400","repositories_listed":2,"syntology":null},{"url":"/paper/forgetting-to-learn-logic-programs","slug":"forgetting-to-learn-logic-programs","title":"Forgetting to learn logic programs","date":"2019-11-15","arxiv_id":"1911.06643","repositories_listed":2,"syntology":null},{"url":"/paper/learning-a-natural-language-interface-with","slug":"learning-a-natural-language-interface-with","title":"Learning a Natural Language Interface with Neural Programmer","date":"2016-11-28","arxiv_id":"1611.08945","repositories_listed":2,"syntology":null},{"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/kb-plugin-a-plug-and-play-framework-for-large","slug":"kb-plugin-a-plug-and-play-framework-for-large","title":"KB-Plugin: A Plug-and-play Framework for Large Language Models to Induce Programs over Low-resourced Knowledge Bases","date":"2024-02-02","arxiv_id":"2402.01619","repositories_listed":1,"syntology":null},{"url":"/paper/learning-differentiable-logic-programs-for","slug":"learning-differentiable-logic-programs-for","title":"Learning Differentiable Logic Programs for Abstract Visual Reasoning","date":"2023-07-03","arxiv_id":"2307.00928","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/learning-differentiable-logic-programs-for#ran","syntology_url":"https://syntology.ai/paper/2307.00928","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.00928"}},"official":{"repos":["ml-research/neumann"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/using-natural-language-and-program","slug":"using-natural-language-and-program","title":"Using Natural Language and Program Abstractions to Instill Human Inductive Biases in Machines","date":"2022-05-23","arxiv_id":"2205.11558","repositories_listed":1,"syntology":null},{"url":"/paper/arcaneqa-dynamic-program-induction-and","slug":"arcaneqa-dynamic-program-induction-and","title":"ArcaneQA: Dynamic Program Induction and Contextualized Encoding for Knowledge Base Question Answering","date":"2022-04-17","arxiv_id":"2204.08109","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/arcaneqa-dynamic-program-induction-and#ran","syntology_url":"https://syntology.ai/paper/2204.08109","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.08109"}},"official":{"repos":["dki-lab/arcaneqa"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/think-big-teach-small-do-language-models","slug":"think-big-teach-small-do-language-models","title":"Think Big, Teach Small: Do Language Models Distil Occam’s Razor?","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/map-induction-compositional-spatial-submap-1","slug":"map-induction-compositional-spatial-submap-1","title":"Map Induction: Compositional spatial submap learning for efficient exploration in novel environments","date":"2021-10-23","arxiv_id":"2110.12301","repositories_listed":1,"syntology":null},{"url":"/paper/program-transfer-and-ontology-awareness-for","slug":"program-transfer-and-ontology-awareness-for","title":"Program Transfer for Answering Complex Questions over Knowledge Bases","date":"2021-10-12","arxiv_id":"2110.05743","repositories_listed":1,"syntology":null},{"url":"/paper/learning-a-deep-generative-model-like-a","slug":"learning-a-deep-generative-model-like-a","title":"Learning a Deep Generative Model like a Program: the Free Category Prior","date":"2020-11-22","arxiv_id":"2011.11063","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-complex-knowledge-base-question","slug":"few-shot-complex-knowledge-base-question","title":"Few-Shot Complex Knowledge Base Question Answering via Meta Reinforcement Learning","date":"2020-10-29","arxiv_id":"2010.15877","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/few-shot-complex-knowledge-base-question#ran","syntology_url":"https://syntology.ai/paper/2010.15877","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.15877"}},"official":{"repos":["DevinJake/MRL-CQA"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/strong-generalization-and-efficiency-in","slug":"strong-generalization-and-efficiency-in","title":"Strong Generalization and Efficiency in Neural Programs","date":"2020-07-07","arxiv_id":"2007.03629","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":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) · 1 unverified","sample_list":"/paper/strong-generalization-and-efficiency-in#ran","syntology_url":"https://syntology.ai/paper/2007.03629","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.03629"}},"official":null}},{"url":"/paper/automatic-discovery-of-interpretable-planning","slug":"automatic-discovery-of-interpretable-planning","title":"Automatic Discovery of Interpretable Planning Strategies","date":"2020-05-24","arxiv_id":"2005.11730","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-refactoring-for-program-induction","slug":"knowledge-refactoring-for-program-induction","title":"Knowledge Refactoring for Inductive Program Synthesis","date":"2020-04-21","arxiv_id":"2004.09931","repositories_listed":1,"syntology":null},{"url":"/paper/playgol-learning-programs-through-play","slug":"playgol-learning-programs-through-play","title":"Playgol: learning programs through play","date":"2019-04-18","arxiv_id":"1904.08993","repositories_listed":1,"syntology":null},{"url":"/paper/recent-advances-in-neural-program-synthesis","slug":"recent-advances-in-neural-program-synthesis","title":"Recent Advances in Neural Program Synthesis","date":"2018-02-07","arxiv_id":"1802.02353","repositories_listed":1,"syntology":null},{"url":"/paper/neural-task-programming-learning-to","slug":"neural-task-programming-learning-to","title":"Neural Task Programming: Learning to Generalize Across Hierarchical Tasks","date":"2017-10-04","arxiv_id":"1710.01813","repositories_listed":1,"syntology":null},{"url":"/paper/p-tree-programming","slug":"p-tree-programming","title":"P-Tree Programming","date":"2017-07-12","arxiv_id":"1707.03744","repositories_listed":1,"syntology":null},{"url":"/paper/program-induction-by-rationale-generation","slug":"program-induction-by-rationale-generation","title":"Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problems","date":"2017-05-11","arxiv_id":"1705.04146","repositories_listed":1,"syntology":null},{"url":null,"slug":"llm-guided-probabilistic-program-induction","title":"LLM-Guided Probabilistic Program Induction for POMDP Model Estimation","date":"2025-05-04","arxiv_id":"2505.02216","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-object-placement-programs-for-indoor","title":"Learning Object Placement Programs for Indoor Scene Synthesis with Iterative Self Training","date":"2025-03-06","arxiv_id":"2503.04496","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-efficient-neurally-guided-program","title":"Towards Efficient Neurally-Guided Program Induction for ARC-AGI","date":"2024-11-13","arxiv_id":"2411.17708","repositories_listed":0,"syntology":null},{"url":null,"slug":"harmonizing-program-induction-with-rate","title":"Harmonizing Program Induction with Rate-Distortion Theory","date":"2024-05-08","arxiv_id":"2405.05294","repositories_listed":0,"syntology":null},{"url":null,"slug":"program-based-strategy-induction-for","title":"Program-Based Strategy Induction for Reinforcement Learning","date":"2024-02-26","arxiv_id":"2402.16668","repositories_listed":0,"syntology":null},{"url":null,"slug":"guided-sketch-based-program-induction-by","title":"Guided Sketch-Based Program Induction by Search Gradients","date":"2024-02-10","arxiv_id":"2402.06990","repositories_listed":0,"syntology":null},{"url":null,"slug":"llms-for-relational-reasoning-how-far-are-we","title":"LLMs for Relational Reasoning: How Far are We?","date":"2024-01-17","arxiv_id":"2401.09042","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-infant-object-perception-as-program","title":"Modeling infant object perception as program induction","date":"2023-08-28","arxiv_id":"2309.07099","repositories_listed":0,"syntology":null},{"url":null,"slug":"viskop-visual-knowledge-oriented-programming","title":"VisKoP: Visual Knowledge oriented Programming for Interactive Knowledge Base Question Answering","date":"2023-07-06","arxiv_id":"2307.03130","repositories_listed":0,"syntology":null},{"url":null,"slug":"dreamdecompiler-improved-bayesian-program","title":"Bayesian Program Learning by Decompiling Amortized Knowledge","date":"2023-06-13","arxiv_id":"2306.07856","repositories_listed":0,"syntology":null},{"url":null,"slug":"compositional-diversity-in-visual-concept","title":"Compositional diversity in visual concept learning","date":"2023-05-30","arxiv_id":"2305.19374","repositories_listed":0,"syntology":null},{"url":null,"slug":"neuro-symbolic-meta-reinforcement-learning","title":"Neuro-symbolic Meta Reinforcement Learning for Trading","date":"2023-01-15","arxiv_id":"2302.08996","repositories_listed":0,"syntology":null},{"url":null,"slug":"program-transfer-for-answering-complex","title":"Program Transfer for Answering Complex Questions over Knowledge Bases","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-visual-program-induction-with","title":"Unsupervised Visual Program Induction with Function Modularization","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"flexible-compositional-learning-of-structured","title":"Flexible Compositional Learning of Structured Visual Concepts","date":"2021-05-20","arxiv_id":"2105.09848","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-and-flexible-human-program-induction-in","title":"Fast and flexible: Human program induction in abstract reasoning tasks","date":"2021-03-10","arxiv_id":"2103.05823","repositories_listed":0,"syntology":null},{"url":null,"slug":"abstraction-and-analogy-making-in-artificial","title":"Abstraction and Analogy-Making in Artificial Intelligence","date":"2021-02-22","arxiv_id":"2102.10717","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-plane-program-induction-with-3d-box-1","title":"Multi-Plane Program Induction with 3D Box Priors","date":"2020-11-19","arxiv_id":"2011.10007","repositories_listed":0,"syntology":null},{"url":null,"slug":"measuring-few-shot-extrapolation-with-program","title":"Measuring few-shot extrapolation with program induction","date":"2020-10-13","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-abstract-structure-for-drawing-by","title":"Learning abstract structure for drawing by efficient motor program induction","date":"2020-08-08","arxiv_id":"2008.03519","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-learn-generative-programs-with","title":"Learning to learn generative programs with Memoised Wake-Sleep","date":"2020-07-06","arxiv_id":"2007.03132","repositories_listed":0,"syntology":null},{"url":null,"slug":"perspective-plane-program-induction-from-a-1","title":"Perspective Plane Program Induction from a Single Image","date":"2020-06-25","arxiv_id":"2006.14708","repositories_listed":0,"syntology":null},{"url":null,"slug":"attention-on-abstract-visual-reasoning","title":"Attention on Abstract Visual Reasoning","date":"2019-11-14","arxiv_id":"1911.05990","repositories_listed":0,"syntology":null},{"url":null,"slug":"deepproblog-neural-probabilistic-logic-2","title":"Neural Probabilistic Logic Programming in DeepProbLog","date":"2019-07-18","arxiv_id":"1907.08194","repositories_listed":0,"syntology":null},{"url":null,"slug":"few-shot-bayesian-imitation-learning-with","title":"Few-Shot Bayesian Imitation Learning with Logical Program Policies","date":"2019-04-12","arxiv_id":"1904.06317","repositories_listed":0,"syntology":null},{"url":null,"slug":"complex-program-induction-for-querying","title":"Complex Program Induction for Querying Knowledge Bases in the Absence of Gold Programs","date":"2019-03-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"from-explanation-to-synthesis-compositional","title":"From explanation to synthesis: Compositional program induction for learning from demonstration","date":"2019-02-27","arxiv_id":"1902.10657","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-libraries-of-subroutines-for","title":"Learning Libraries of Subroutines for Neurally–Guided Bayesian Program Induction","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"library-learning-for-neurally-guided-bayesian","title":"Library Learning for Neurally-Guided Bayesian Program Induction","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-over-programs-that-make-predictions","title":"Inference Over Programs That Make Predictions","date":"2018-10-02","arxiv_id":"1810.01190","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-program-induction-for-intuitive","title":"Probabilistic Program Induction for Intuitive Physics Game Play","date":"2018-09-27","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"representational-efficiency-outweighs-action","title":"Representational efficiency outweighs action efficiency in human program induction","date":"2018-07-18","arxiv_id":"1807.07134","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-model-for-the-learning-of-language","title":"One Model for the Learning of Language","date":"2017-11-16","arxiv_id":"1711.06301","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-program-meta-induction","title":"Neural Program Meta-Induction","date":"2017-10-11","arxiv_id":"1710.04157","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-program-induction-to-interpret","title":"Using Program Induction to Interpret Transition System Dynamics","date":"2017-07-26","arxiv_id":"1708.00376","repositories_listed":0,"syntology":null},{"url":null,"slug":"program-induction-by-rationale-generation-1","title":"Program Induction by Rationale Generation: Learning to Solve and Explain Algebraic Word Problems","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"explaining-transition-systems-through-program","title":"Explaining Transition Systems through Program Induction","date":"2017-05-23","arxiv_id":"1705.08320","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-symbolic-machines-learning-semantic","title":"Neural Symbolic Machines: Learning Semantic Parsers on Freebase with Weak Supervision (Short Version)","date":"2016-12-04","arxiv_id":"1612.01197","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-neural-programs","title":"Probabilistic Neural Programs","date":"2016-12-02","arxiv_id":"1612.00712","repositories_listed":0,"syntology":null},{"url":null,"slug":"summary-terpret-a-probabilistic-programming","title":"Summary - TerpreT: A Probabilistic Programming Language for Program Induction","date":"2016-12-02","arxiv_id":"1612.00817","repositories_listed":0,"syntology":null},{"url":null,"slug":"programs-as-black-box-explanations","title":"Programs as Black-Box Explanations","date":"2016-11-22","arxiv_id":"1611.07579","repositories_listed":0,"syntology":null},{"url":null,"slug":"neuro-symbolic-program-synthesis","title":"Neuro-Symbolic Program Synthesis","date":"2016-11-06","arxiv_id":"1611.01855","repositories_listed":0,"syntology":null},{"url":null,"slug":"terpret-a-probabilistic-programming-language","title":"TerpreT: A Probabilistic Programming Language for Program Induction","date":"2016-08-15","arxiv_id":"1608.04428","repositories_listed":0,"syntology":null}],"syntology_records":7,"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":6,"papers_where_code_ran_first_page":"/task/program-induction/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/program-induction/papers/ran/1","json":"/task/program-induction/papers/ran/1.json","rows":6}],"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":"75076d5107470eba15c6744a21caad877dd635787ac65d516d2cc57c8f6fff8b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}