{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SULJ3IDQ7DG4B2VCQVG25W2AXL","short_pith_number":"pith:SULJ3IDQ","schema_version":"1.0","canonical_sha256":"95169da070f8cdc0eaa2854daedb40bada1c21f354bbdc3ad9d7a8b735fda486","source":{"kind":"arxiv","id":"1503.08895","version":5},"attestation_state":"computed","paper":{"title":"End-To-End Memory Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.NE","authors_text":"Arthur Szlam, Jason Weston, Rob Fergus, Sainbayar Sukhbaatar","submitted_at":"2015-03-31T03:05:37Z","abstract_excerpt":"We introduce a neural network with a recurrent attention model over a possibly large external memory. The architecture is a form of Memory Network (Weston et al., 2015) but unlike the model in that work, it is trained end-to-end, and hence requires significantly less supervision during training, making it more generally applicable in realistic settings. It can also be seen as an extension of RNNsearch to the case where multiple computational steps (hops) are performed per output symbol. The flexibility of the model allows us to apply it to tasks as diverse as (synthetic) question answering and"},"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":"1503.08895","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-03-31T03:05:37Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"49c1bf53fe13332f76bf762f2ffe3ff677778927cf561a072d320bb077635b27","abstract_canon_sha256":"81f0802da4063bebb171d9cfd2b771c7e105c62ab621a0a8b27f36a8456f84c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:10.439104Z","signature_b64":"k5vHQ/a1tYWFHMCpn3geDv+ZHOIpW3f1ri1cjSmCuYMwZz2PB//LuJUzzDCrMoJVYLJLYGiruUnIM1YEhZv6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95169da070f8cdc0eaa2854daedb40bada1c21f354bbdc3ad9d7a8b735fda486","last_reissued_at":"2026-05-18T01:26:10.438484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:10.438484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-To-End Memory Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.NE","authors_text":"Arthur Szlam, Jason Weston, Rob Fergus, Sainbayar Sukhbaatar","submitted_at":"2015-03-31T03:05:37Z","abstract_excerpt":"We introduce a neural network with a recurrent attention model over a possibly large external memory. The architecture is a form of Memory Network (Weston et al., 2015) but unlike the model in that work, it is trained end-to-end, and hence requires significantly less supervision during training, making it more generally applicable in realistic settings. It can also be seen as an extension of RNNsearch to the case where multiple computational steps (hops) are performed per output symbol. The flexibility of the model allows us to apply it to tasks as diverse as (synthetic) question answering and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08895","kind":"arxiv","version":5},"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":"1503.08895","created_at":"2026-05-18T01:26:10.438577+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.08895v5","created_at":"2026-05-18T01:26:10.438577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08895","created_at":"2026-05-18T01:26:10.438577+00:00"},{"alias_kind":"pith_short_12","alias_value":"SULJ3IDQ7DG4","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SULJ3IDQ7DG4B2VC","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SULJ3IDQ","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04897","citing_title":"Storage Is Not Memory: A Retrieval-Centered Architecture for Agent Recall","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SULJ3IDQ7DG4B2VCQVG25W2AXL","json":"https://pith.science/pith/SULJ3IDQ7DG4B2VCQVG25W2AXL.json","graph_json":"https://pith.science/api/pith-number/SULJ3IDQ7DG4B2VCQVG25W2AXL/graph.json","events_json":"https://pith.science/api/pith-number/SULJ3IDQ7DG4B2VCQVG25W2AXL/events.json","paper":"https://pith.science/paper/SULJ3IDQ"},"agent_actions":{"view_html":"https://pith.science/pith/SULJ3IDQ7DG4B2VCQVG25W2AXL","download_json":"https://pith.science/pith/SULJ3IDQ7DG4B2VCQVG25W2AXL.json","view_paper":"https://pith.science/paper/SULJ3IDQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.08895&json=true","fetch_graph":"https://pith.science/api/pith-number/SULJ3IDQ7DG4B2VCQVG25W2AXL/graph.json","fetch_events":"https://pith.science/api/pith-number/SULJ3IDQ7DG4B2VCQVG25W2AXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SULJ3IDQ7DG4B2VCQVG25W2AXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SULJ3IDQ7DG4B2VCQVG25W2AXL/action/storage_attestation","attest_author":"https://pith.science/pith/SULJ3IDQ7DG4B2VCQVG25W2AXL/action/author_attestation","sign_citation":"https://pith.science/pith/SULJ3IDQ7DG4B2VCQVG25W2AXL/action/citation_signature","submit_replication":"https://pith.science/pith/SULJ3IDQ7DG4B2VCQVG25W2AXL/action/replication_record"}},"created_at":"2026-05-18T01:26:10.438577+00:00","updated_at":"2026-05-18T01:26:10.438577+00:00"}