{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XD2QXGL4O2CSKLOKWXIGLHLNC3","short_pith_number":"pith:XD2QXGL4","schema_version":"1.0","canonical_sha256":"b8f50b997c7685252dcab5d0659d6d16f913513c910b4706a5e5e5406c5515d4","source":{"kind":"arxiv","id":"1511.06279","version":4},"attestation_state":"computed","paper":{"title":"Neural Programmer-Interpreters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Nando de Freitas, Scott Reed","submitted_at":"2015-11-19T17:49:32Z","abstract_excerpt":"We propose the neural programmer-interpreter (NPI): a recurrent and compositional neural network that learns to represent and execute programs. NPI has three learnable components: a task-agnostic recurrent core, a persistent key-value program memory, and domain-specific encoders that enable a single NPI to operate in multiple perceptually diverse environments with distinct affordances. By learning to compose lower-level programs to express higher-level programs, NPI reduces sample complexity and increases generalization ability compared to sequence-to-sequence LSTMs. The program memory allows "},"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":"1511.06279","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-19T17:49:32Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"71779055eeb81c2a7e8ee3a0747af6caf25582d473467ce851b6729124fe06ad","abstract_canon_sha256":"0d3b1cfb5cbff09de3ea45d27a90a2052b5c3954421044ed17086bda73b0db8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:53.391899Z","signature_b64":"H9NHTS3/LeNE3xVtETe///QC8yxwefmRc9xOKTVvZzoXJKXR4Kr+VBeBgdAoP2i2aXAQm750G6dENMlMtHr2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8f50b997c7685252dcab5d0659d6d16f913513c910b4706a5e5e5406c5515d4","last_reissued_at":"2026-05-18T01:19:53.391480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:53.391480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Programmer-Interpreters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Nando de Freitas, Scott Reed","submitted_at":"2015-11-19T17:49:32Z","abstract_excerpt":"We propose the neural programmer-interpreter (NPI): a recurrent and compositional neural network that learns to represent and execute programs. NPI has three learnable components: a task-agnostic recurrent core, a persistent key-value program memory, and domain-specific encoders that enable a single NPI to operate in multiple perceptually diverse environments with distinct affordances. By learning to compose lower-level programs to express higher-level programs, NPI reduces sample complexity and increases generalization ability compared to sequence-to-sequence LSTMs. The program memory allows "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06279","kind":"arxiv","version":4},"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":"1511.06279","created_at":"2026-05-18T01:19:53.391544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.06279v4","created_at":"2026-05-18T01:19:53.391544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06279","created_at":"2026-05-18T01:19:53.391544+00:00"},{"alias_kind":"pith_short_12","alias_value":"XD2QXGL4O2CS","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XD2QXGL4O2CSKLOK","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XD2QXGL4","created_at":"2026-05-18T12:29:50.041715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2102.04664","citing_title":"CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generation","ref_index":67,"is_internal_anchor":true},{"citing_arxiv_id":"2104.13478","citing_title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","ref_index":67,"is_internal_anchor":false},{"citing_arxiv_id":"2112.00114","citing_title":"Show Your Work: Scratchpads for Intermediate Computation with Language Models","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"1603.08983","citing_title":"Adaptive Computation Time for Recurrent Neural Networks","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25166","citing_title":"Training Transformers as a Universal Computer","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2201.02177","citing_title":"Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18907","citing_title":"Gradient-Based Program Synthesis with Neurally Interpreted Languages","ref_index":109,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06425","citing_title":"Neural Computers","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XD2QXGL4O2CSKLOKWXIGLHLNC3","json":"https://pith.science/pith/XD2QXGL4O2CSKLOKWXIGLHLNC3.json","graph_json":"https://pith.science/api/pith-number/XD2QXGL4O2CSKLOKWXIGLHLNC3/graph.json","events_json":"https://pith.science/api/pith-number/XD2QXGL4O2CSKLOKWXIGLHLNC3/events.json","paper":"https://pith.science/paper/XD2QXGL4"},"agent_actions":{"view_html":"https://pith.science/pith/XD2QXGL4O2CSKLOKWXIGLHLNC3","download_json":"https://pith.science/pith/XD2QXGL4O2CSKLOKWXIGLHLNC3.json","view_paper":"https://pith.science/paper/XD2QXGL4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.06279&json=true","fetch_graph":"https://pith.science/api/pith-number/XD2QXGL4O2CSKLOKWXIGLHLNC3/graph.json","fetch_events":"https://pith.science/api/pith-number/XD2QXGL4O2CSKLOKWXIGLHLNC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XD2QXGL4O2CSKLOKWXIGLHLNC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XD2QXGL4O2CSKLOKWXIGLHLNC3/action/storage_attestation","attest_author":"https://pith.science/pith/XD2QXGL4O2CSKLOKWXIGLHLNC3/action/author_attestation","sign_citation":"https://pith.science/pith/XD2QXGL4O2CSKLOKWXIGLHLNC3/action/citation_signature","submit_replication":"https://pith.science/pith/XD2QXGL4O2CSKLOKWXIGLHLNC3/action/replication_record"}},"created_at":"2026-05-18T01:19:53.391544+00:00","updated_at":"2026-05-18T01:19:53.391544+00:00"}