{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5JDYBLGTK2W6UWEITDJ7YWHYNI","short_pith_number":"pith:5JDYBLGT","schema_version":"1.0","canonical_sha256":"ea4780acd356adea588898d3fc58f86a0f594c238932a2c8852ea2fbec56c5d4","source":{"kind":"arxiv","id":"1611.01855","version":1},"attestation_state":"computed","paper":{"title":"Neuro-Symbolic Program Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.AI","authors_text":"Abdel-rahman Mohamed, Dengyong Zhou, Emilio Parisotto, Lihong Li, Pushmeet Kohli, Rishabh Singh","submitted_at":"2016-11-06T22:23:56Z","abstract_excerpt":"Recent years have seen the proposal of a number of neural architectures for the problem of Program Induction. Given a set of input-output examples, these architectures are able to learn mappings that generalize to new test inputs. While achieving impressive results, these approaches have a number of important limitations: (a) they are computationally expensive and hard to train, (b) a model has to be trained for each task (program) separately, and (c) it is hard to interpret or verify the correctness of the learnt mapping (as it is defined by a neural network). In this paper, we propose a nove"},"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":"1611.01855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-11-06T22:23:56Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"3af720d54b9bea8daaf3997684392c803e9d923966bb7ef7f2c335d799e06362","abstract_canon_sha256":"d6463bb2eb91451393d41fcebcf8b5490f114d3e0c7579bc1c7661dcb61594f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:04.326402Z","signature_b64":"Qm96w4mfH6c0fF8OTzfPE1F9hj+mBwmJfEXL7N8NxroprF9NjtTJspeTvyqo2kCrz0U0TBnbt7jF4u1Oy+j2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea4780acd356adea588898d3fc58f86a0f594c238932a2c8852ea2fbec56c5d4","last_reissued_at":"2026-05-18T01:00:04.325696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:04.325696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neuro-Symbolic Program Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.AI","authors_text":"Abdel-rahman Mohamed, Dengyong Zhou, Emilio Parisotto, Lihong Li, Pushmeet Kohli, Rishabh Singh","submitted_at":"2016-11-06T22:23:56Z","abstract_excerpt":"Recent years have seen the proposal of a number of neural architectures for the problem of Program Induction. Given a set of input-output examples, these architectures are able to learn mappings that generalize to new test inputs. While achieving impressive results, these approaches have a number of important limitations: (a) they are computationally expensive and hard to train, (b) a model has to be trained for each task (program) separately, and (c) it is hard to interpret or verify the correctness of the learnt mapping (as it is defined by a neural network). In this paper, we propose a nove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01855","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":""},"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":"1611.01855","created_at":"2026-05-18T01:00:04.325796+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01855v1","created_at":"2026-05-18T01:00:04.325796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01855","created_at":"2026-05-18T01:00:04.325796+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JDYBLGTK2W6","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JDYBLGTK2W6UWEI","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JDYBLGT","created_at":"2026-05-18T12:30:01.593930+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.15865","citing_title":"From Text to DSL: Evaluating Grammar-Based Model Generation Using Open LLMs","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17187","citing_title":"PluRule: A Benchmark for Moderating Pluralistic Communities on Social Media","ref_index":94,"is_internal_anchor":true},{"citing_arxiv_id":"2603.25111","citing_title":"SEVerA: Verified Synthesis of Self-Evolving Agents","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2604.15623","citing_title":"Overmind NSA: A Unified Neuro-Symbolic Computing Architecture with Approximate Nonlinear Activations and Preemptive Memory Bypass","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17184","citing_title":"SynthFix: Adaptive Neuro-Symbolic Code Vulnerability Repair","ref_index":53,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5JDYBLGTK2W6UWEITDJ7YWHYNI","json":"https://pith.science/pith/5JDYBLGTK2W6UWEITDJ7YWHYNI.json","graph_json":"https://pith.science/api/pith-number/5JDYBLGTK2W6UWEITDJ7YWHYNI/graph.json","events_json":"https://pith.science/api/pith-number/5JDYBLGTK2W6UWEITDJ7YWHYNI/events.json","paper":"https://pith.science/paper/5JDYBLGT"},"agent_actions":{"view_html":"https://pith.science/pith/5JDYBLGTK2W6UWEITDJ7YWHYNI","download_json":"https://pith.science/pith/5JDYBLGTK2W6UWEITDJ7YWHYNI.json","view_paper":"https://pith.science/paper/5JDYBLGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01855&json=true","fetch_graph":"https://pith.science/api/pith-number/5JDYBLGTK2W6UWEITDJ7YWHYNI/graph.json","fetch_events":"https://pith.science/api/pith-number/5JDYBLGTK2W6UWEITDJ7YWHYNI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JDYBLGTK2W6UWEITDJ7YWHYNI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JDYBLGTK2W6UWEITDJ7YWHYNI/action/storage_attestation","attest_author":"https://pith.science/pith/5JDYBLGTK2W6UWEITDJ7YWHYNI/action/author_attestation","sign_citation":"https://pith.science/pith/5JDYBLGTK2W6UWEITDJ7YWHYNI/action/citation_signature","submit_replication":"https://pith.science/pith/5JDYBLGTK2W6UWEITDJ7YWHYNI/action/replication_record"}},"created_at":"2026-05-18T01:00:04.325796+00:00","updated_at":"2026-05-18T01:00:04.325796+00:00"}