{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QS5YDFYCKWCKHEIQCA2K5HPQKS","short_pith_number":"pith:QS5YDFYC","schema_version":"1.0","canonical_sha256":"84bb8197025584a391101034ae9df05490ac73d4316d42ea129856d3e9a12826","source":{"kind":"arxiv","id":"1410.3916","version":11},"attestation_state":"computed","paper":{"title":"Memory Networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.AI","authors_text":"Antoine Bordes, Jason Weston, Sumit Chopra","submitted_at":"2014-10-15T03:13:18Z","abstract_excerpt":"We describe a new class of learning models called memory networks. Memory networks reason with inference components combined with a long-term memory component; they learn how to use these jointly. The long-term memory can be read and written to, with the goal of using it for prediction. We investigate these models in the context of question answering (QA) where the long-term memory effectively acts as a (dynamic) knowledge base, and the output is a textual response. We evaluate them on a large-scale QA task, and a smaller, but more complex, toy task generated from a simulated world. In the lat"},"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":"1410.3916","kind":"arxiv","version":11},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2014-10-15T03:13:18Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"65c0d0c95adf146323412f02bf86cbfd1dec7ff13e0cfbbdf3fc44f0cc0e6bc6","abstract_canon_sha256":"bb238cd4ed74ff75067b58f6590a64f3badadc0be952cbd332e53907a1009195"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:47.510073Z","signature_b64":"6xeVRxVseyOgsiszddtbiyMjR4D4hwT4jbnqR8MMyhqveQ8Pd7FASIYxMV8njv6vc986whMQv5sKgzQ7g2EvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84bb8197025584a391101034ae9df05490ac73d4316d42ea129856d3e9a12826","last_reissued_at":"2026-05-18T01:25:47.509651Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:47.509651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Memory Networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.AI","authors_text":"Antoine Bordes, Jason Weston, Sumit Chopra","submitted_at":"2014-10-15T03:13:18Z","abstract_excerpt":"We describe a new class of learning models called memory networks. Memory networks reason with inference components combined with a long-term memory component; they learn how to use these jointly. The long-term memory can be read and written to, with the goal of using it for prediction. We investigate these models in the context of question answering (QA) where the long-term memory effectively acts as a (dynamic) knowledge base, and the output is a textual response. We evaluate them on a large-scale QA task, and a smaller, but more complex, toy task generated from a simulated world. In the lat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3916","kind":"arxiv","version":11},"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":"1410.3916","created_at":"2026-05-18T01:25:47.509715+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.3916v11","created_at":"2026-05-18T01:25:47.509715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3916","created_at":"2026-05-18T01:25:47.509715+00:00"},{"alias_kind":"pith_short_12","alias_value":"QS5YDFYCKWCK","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QS5YDFYCKWCKHEIQ","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QS5YDFYC","created_at":"2026-05-18T12:28:46.137349+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":30,"internal_anchor_count":18,"sample":[{"citing_arxiv_id":"2606.20737","citing_title":"Repeated Shared Access Enables Grokking, but Edit Propagation Depends on an Addressable Memory","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2606.10435","citing_title":"Parallel Causal Associative Fields: Gated Sparse Memory for Long-Context Language Modeling","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2606.04445","citing_title":"RowNet: A Memory Transformer for Tabular Regression","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2606.03503","citing_title":"ThoughtFold: Folding Reasoning Chains via Introspective Preference Learning","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2606.28112","citing_title":"BiDeMem: Bidirectional Degradation Memory for Explainable Image Restoration","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2605.27044","citing_title":"BatteryMFormer: Multi-level Learning for Battery Degradation Trajectory Forecasting","ref_index":50,"is_internal_anchor":true},{"citing_arxiv_id":"1907.01686","citing_title":"Machine Reading Comprehension: a Literature Review","ref_index":64,"is_internal_anchor":true},{"citing_arxiv_id":"1907.03202","citing_title":"Evolutionary Algorithm for Sinhala to English Translation","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2411.11259","citing_title":"Graph Retention Networks for Dynamic Graphs","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17270","citing_title":"Beyond Detection: A Structure-Aware Framework for Scene Text Tracking","ref_index":135,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18601","citing_title":"Incantation: Natural Language as the Action Interface for Multi-Entity Video World Models","ref_index":43,"is_internal_anchor":true},{"citing_arxiv_id":"2508.16745","citing_title":"Beyond Memorization: Extending Reasoning Depth with Recurrence, Memory and Test-Time Compute Scaling","ref_index":71,"is_internal_anchor":true},{"citing_arxiv_id":"1911.05507","citing_title":"Compressive Transformers for Long-Range Sequence Modelling","ref_index":131,"is_internal_anchor":true},{"citing_arxiv_id":"2408.16061","citing_title":"3D Reconstruction with Spatial Memory","ref_index":83,"is_internal_anchor":true},{"citing_arxiv_id":"2309.02427","citing_title":"Cognitive Architectures for Language Agents","ref_index":83,"is_internal_anchor":true},{"citing_arxiv_id":"2507.02259","citing_title":"MemAgent: Reshaping Long-Context LLM with Multi-Conv RL-based Memory Agent","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2002.08909","citing_title":"REALM: Retrieval-Augmented Language Model Pre-Training","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2501.00663","citing_title":"Titans: Learning to Memorize at Test Time","ref_index":115,"is_internal_anchor":true},{"citing_arxiv_id":"2001.04451","citing_title":"Reformer: The Efficient Transformer","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10537","citing_title":"Mela: Test-Time Memory Consolidation based on Transformation Hypothesis","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06216","citing_title":"TIDE: Every Layer Knows the Token Beneath the Context","ref_index":79,"is_internal_anchor":false},{"citing_arxiv_id":"2201.02177","citing_title":"Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05189","citing_title":"Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04651","citing_title":"FAAST: Forward-Only Associative Learning via Closed-Form Fast Weights for Test-Time Supervised Adaptation","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2410.10813","citing_title":"LongMemEval: Benchmarking Chat Assistants on Long-Term Interactive Memory","ref_index":96,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QS5YDFYCKWCKHEIQCA2K5HPQKS","json":"https://pith.science/pith/QS5YDFYCKWCKHEIQCA2K5HPQKS.json","graph_json":"https://pith.science/api/pith-number/QS5YDFYCKWCKHEIQCA2K5HPQKS/graph.json","events_json":"https://pith.science/api/pith-number/QS5YDFYCKWCKHEIQCA2K5HPQKS/events.json","paper":"https://pith.science/paper/QS5YDFYC"},"agent_actions":{"view_html":"https://pith.science/pith/QS5YDFYCKWCKHEIQCA2K5HPQKS","download_json":"https://pith.science/pith/QS5YDFYCKWCKHEIQCA2K5HPQKS.json","view_paper":"https://pith.science/paper/QS5YDFYC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.3916&json=true","fetch_graph":"https://pith.science/api/pith-number/QS5YDFYCKWCKHEIQCA2K5HPQKS/graph.json","fetch_events":"https://pith.science/api/pith-number/QS5YDFYCKWCKHEIQCA2K5HPQKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QS5YDFYCKWCKHEIQCA2K5HPQKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QS5YDFYCKWCKHEIQCA2K5HPQKS/action/storage_attestation","attest_author":"https://pith.science/pith/QS5YDFYCKWCKHEIQCA2K5HPQKS/action/author_attestation","sign_citation":"https://pith.science/pith/QS5YDFYCKWCKHEIQCA2K5HPQKS/action/citation_signature","submit_replication":"https://pith.science/pith/QS5YDFYCKWCKHEIQCA2K5HPQKS/action/replication_record"}},"created_at":"2026-05-18T01:25:47.509715+00:00","updated_at":"2026-05-18T01:25:47.509715+00:00"}