{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:RPPM2D7CY4CFSDFK3V4BOYFGEU","short_pith_number":"pith:RPPM2D7C","schema_version":"1.0","canonical_sha256":"8bdecd0fe2c704590caadd781760a6250288c75ee473d8fab0a933bc91032245","source":{"kind":"arxiv","id":"2006.08381","version":1},"attestation_state":"computed","paper":{"title":"DreamCoder: Growing generalizable, interpretable knowledge with wake-sleep Bayesian program learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Armando Solar-Lezama, Catherine Wong, Joshua B. Tenenbaum, Kevin Ellis, Lucas Morales, Luc Cary, Luke Hewitt, Mathias Sable-Meyer, Maxwell Nye","submitted_at":"2020-06-15T13:06:29Z","abstract_excerpt":"Expert problem-solving is driven by powerful languages for thinking about problems and their solutions. Acquiring expertise means learning these languages -- systems of concepts, alongside the skills to use them. We present DreamCoder, a system that learns to solve problems by writing programs. It builds expertise by creating programming languages for expressing domain concepts, together with neural networks to guide the search for programs within these languages. A ``wake-sleep'' learning algorithm alternately extends the language with new symbolic abstractions and trains the neural network o"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2006.08381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-06-15T13:06:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"87fc59f6f4220174f1008935366c8b0a664f8cb26228105c9e0f8a556d3879d4","abstract_canon_sha256":"d89c005b9bf97fac850b4515b29d50481807c85a229c980d56f3461073d4af39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:10:20.985228Z","signature_b64":"13VNK55gHuOMc4EDaSa1AtPIzZ+uIRprrSdYPutIwYF1jYFy1u5vPQDk8mRbAwb4qwNj8KxHB3oW7KyZbW2YCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bdecd0fe2c704590caadd781760a6250288c75ee473d8fab0a933bc91032245","last_reissued_at":"2026-07-05T01:10:20.984660Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:10:20.984660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DreamCoder: Growing generalizable, interpretable knowledge with wake-sleep Bayesian program learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Armando Solar-Lezama, Catherine Wong, Joshua B. Tenenbaum, Kevin Ellis, Lucas Morales, Luc Cary, Luke Hewitt, Mathias Sable-Meyer, Maxwell Nye","submitted_at":"2020-06-15T13:06:29Z","abstract_excerpt":"Expert problem-solving is driven by powerful languages for thinking about problems and their solutions. Acquiring expertise means learning these languages -- systems of concepts, alongside the skills to use them. We present DreamCoder, a system that learns to solve problems by writing programs. It builds expertise by creating programming languages for expressing domain concepts, together with neural networks to guide the search for programs within these languages. A ``wake-sleep'' learning algorithm alternately extends the language with new symbolic abstractions and trains the neural network o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.08381","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.08381/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2006.08381","created_at":"2026-07-05T01:10:20.984723+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.08381v1","created_at":"2026-07-05T01:10:20.984723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.08381","created_at":"2026-07-05T01:10:20.984723+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPPM2D7CY4CF","created_at":"2026-07-05T01:10:20.984723+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPPM2D7CY4CFSDFK","created_at":"2026-07-05T01:10:20.984723+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPPM2D7C","created_at":"2026-07-05T01:10:20.984723+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06764","citing_title":"Cost-Effective Agent Harnesses for Abstract Reasoning and Generalization on ARC-AGI-1","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2606.25394","citing_title":"FactorLibrary: From Polynomials to Circuits via Recursive Subgoals","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25931","citing_title":"Explore Before You Solve: The Speed--Depth Trade-off in Epistemic Agents for ARC-AGI-3","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2510.01685","citing_title":"How Do Language Models Compose Functions?","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2512.00380","citing_title":"Knowledge-Graph-Driven Data Synthesis for Low-Resource Software Development: A HarmonyOS Case Study","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2209.07753","citing_title":"Code as Policies: Language Model Programs for Embodied Control","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06107","citing_title":"Artificial Intelligence and the Structure of Mathematics","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2305.16291","citing_title":"Voyager: An Open-Ended Embodied Agent with Large Language Models","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RPPM2D7CY4CFSDFK3V4BOYFGEU","json":"https://pith.science/pith/RPPM2D7CY4CFSDFK3V4BOYFGEU.json","graph_json":"https://pith.science/api/pith-number/RPPM2D7CY4CFSDFK3V4BOYFGEU/graph.json","events_json":"https://pith.science/api/pith-number/RPPM2D7CY4CFSDFK3V4BOYFGEU/events.json","paper":"https://pith.science/paper/RPPM2D7C"},"agent_actions":{"view_html":"https://pith.science/pith/RPPM2D7CY4CFSDFK3V4BOYFGEU","download_json":"https://pith.science/pith/RPPM2D7CY4CFSDFK3V4BOYFGEU.json","view_paper":"https://pith.science/paper/RPPM2D7C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.08381&json=true","fetch_graph":"https://pith.science/api/pith-number/RPPM2D7CY4CFSDFK3V4BOYFGEU/graph.json","fetch_events":"https://pith.science/api/pith-number/RPPM2D7CY4CFSDFK3V4BOYFGEU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPPM2D7CY4CFSDFK3V4BOYFGEU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPPM2D7CY4CFSDFK3V4BOYFGEU/action/storage_attestation","attest_author":"https://pith.science/pith/RPPM2D7CY4CFSDFK3V4BOYFGEU/action/author_attestation","sign_citation":"https://pith.science/pith/RPPM2D7CY4CFSDFK3V4BOYFGEU/action/citation_signature","submit_replication":"https://pith.science/pith/RPPM2D7CY4CFSDFK3V4BOYFGEU/action/replication_record"}},"created_at":"2026-07-05T01:10:20.984723+00:00","updated_at":"2026-07-05T01:10:20.984723+00:00"}