{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:J5S3NOSS3W2LSSNBAWK577BWUF","short_pith_number":"pith:J5S3NOSS","schema_version":"1.0","canonical_sha256":"4f65b6ba52ddb4b949a10595dffc36a1728a4431df51e2bbba1438d9764711ef","source":{"kind":"arxiv","id":"1804.00218","version":2},"attestation_state":"computed","paper":{"title":"HOUDINI: Lifelong Learning as Program Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Akash Srivastava, Charles Sutton, Dipak Chaudhari, Lazar Valkov, Swarat Chaudhuri","submitted_at":"2018-03-31T21:34:50Z","abstract_excerpt":"We present a neurosymbolic framework for the lifelong learning of algorithmic tasks that mix perception and procedural reasoning. Reusing high-level concepts across domains and learning complex procedures are key challenges in lifelong learning. We show that a program synthesis approach that combines gradient descent with combinatorial search over programs can be a more effective response to these challenges than purely neural methods. Our framework, called HOUDINI, represents neural networks as strongly typed, differentiable functional programs that use symbolic higher-order combinators to co"},"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":"1804.00218","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-31T21:34:50Z","cross_cats_sorted":["cs.PL","stat.ML"],"title_canon_sha256":"f5f5ef0724d7b7e273b843e5ddc65ba96e3c9f2133628010c234b384a3dbf8ca","abstract_canon_sha256":"a50887e0b52e010e79d78ce38c184a7fa7f4ed95982819e5ce97767c8b1a0dee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:12.538228Z","signature_b64":"gkj9dT98SnSgl44aJQmkX6lRlIQT1qWaB+ZIOj4VhWh4sg2ulTZfuRGzhnvFbFStfNN9SEfAOXlDaUVkKmGSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f65b6ba52ddb4b949a10595dffc36a1728a4431df51e2bbba1438d9764711ef","last_reissued_at":"2026-05-18T00:02:12.537572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:12.537572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HOUDINI: Lifelong Learning as Program Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Akash Srivastava, Charles Sutton, Dipak Chaudhari, Lazar Valkov, Swarat Chaudhuri","submitted_at":"2018-03-31T21:34:50Z","abstract_excerpt":"We present a neurosymbolic framework for the lifelong learning of algorithmic tasks that mix perception and procedural reasoning. Reusing high-level concepts across domains and learning complex procedures are key challenges in lifelong learning. We show that a program synthesis approach that combines gradient descent with combinatorial search over programs can be a more effective response to these challenges than purely neural methods. Our framework, called HOUDINI, represents neural networks as strongly typed, differentiable functional programs that use symbolic higher-order combinators to co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00218","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1804.00218","created_at":"2026-05-18T00:02:12.537673+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00218v2","created_at":"2026-05-18T00:02:12.537673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00218","created_at":"2026-05-18T00:02:12.537673+00:00"},{"alias_kind":"pith_short_12","alias_value":"J5S3NOSS3W2L","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"J5S3NOSS3W2LSSNB","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"J5S3NOSS","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J5S3NOSS3W2LSSNBAWK577BWUF","json":"https://pith.science/pith/J5S3NOSS3W2LSSNBAWK577BWUF.json","graph_json":"https://pith.science/api/pith-number/J5S3NOSS3W2LSSNBAWK577BWUF/graph.json","events_json":"https://pith.science/api/pith-number/J5S3NOSS3W2LSSNBAWK577BWUF/events.json","paper":"https://pith.science/paper/J5S3NOSS"},"agent_actions":{"view_html":"https://pith.science/pith/J5S3NOSS3W2LSSNBAWK577BWUF","download_json":"https://pith.science/pith/J5S3NOSS3W2LSSNBAWK577BWUF.json","view_paper":"https://pith.science/paper/J5S3NOSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00218&json=true","fetch_graph":"https://pith.science/api/pith-number/J5S3NOSS3W2LSSNBAWK577BWUF/graph.json","fetch_events":"https://pith.science/api/pith-number/J5S3NOSS3W2LSSNBAWK577BWUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J5S3NOSS3W2LSSNBAWK577BWUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J5S3NOSS3W2LSSNBAWK577BWUF/action/storage_attestation","attest_author":"https://pith.science/pith/J5S3NOSS3W2LSSNBAWK577BWUF/action/author_attestation","sign_citation":"https://pith.science/pith/J5S3NOSS3W2LSSNBAWK577BWUF/action/citation_signature","submit_replication":"https://pith.science/pith/J5S3NOSS3W2LSSNBAWK577BWUF/action/replication_record"}},"created_at":"2026-05-18T00:02:12.537673+00:00","updated_at":"2026-05-18T00:02:12.537673+00:00"}