{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TEJA2DYEKBZLJHOQTB2Z5SPWAV","short_pith_number":"pith:TEJA2DYE","schema_version":"1.0","canonical_sha256":"99120d0f045072b49dd098759ec9f6057c6f3f64a2e267038ccb8c03cb2f5e8d","source":{"kind":"arxiv","id":"2407.01178","version":1},"attestation_state":"computed","paper":{"title":"$\\text{Memory}^3$: Language Modeling with Explicit Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Bo Tang, Chenyang Xi, Feiyu Xiong, Hao Wu, Hongkang Yang, Jinbo Wang, Kai Chen, Linpeng Tang, Shichao Song, Weinan E, Wenjin Wang, Wenqiang Wei, Yu Yu, Zehao Lin, Zeyun Tang, Zhiyu Li","submitted_at":"2024-07-01T11:07:23Z","abstract_excerpt":"The training and inference of large language models (LLMs) are together a costly process that transports knowledge from raw data to meaningful computation. Inspired by the memory hierarchy of the human brain, we reduce this cost by equipping LLMs with explicit memory, a memory format cheaper than model parameters and text retrieval-augmented generation (RAG). Conceptually, with most of its knowledge externalized to explicit memories, the LLM can enjoy a smaller parameter size, training cost, and inference cost, all proportional to the amount of remaining \"abstract knowledge\". As a preliminary "},"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":"2407.01178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-07-01T11:07:23Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"b184509fdaf709d86c5b01a308434688e43ae6d437c6aae83bacd4c78bdd09a6","abstract_canon_sha256":"1a00208cb454aaac3668189961df52a5a65e7a940cdd165d7dee3a298d14ae26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:06:04.818543Z","signature_b64":"oTBWbsE1ycPkvrpv+xuPUkgXc5BGsU3mG6yWnn472UJB+4NcKYXJ2gyFuPiN4/8B7QINM+7vRB28CBOPORSUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99120d0f045072b49dd098759ec9f6057c6f3f64a2e267038ccb8c03cb2f5e8d","last_reissued_at":"2026-07-05T10:06:04.818038Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:06:04.818038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\text{Memory}^3$: Language Modeling with Explicit Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Bo Tang, Chenyang Xi, Feiyu Xiong, Hao Wu, Hongkang Yang, Jinbo Wang, Kai Chen, Linpeng Tang, Shichao Song, Weinan E, Wenjin Wang, Wenqiang Wei, Yu Yu, Zehao Lin, Zeyun Tang, Zhiyu Li","submitted_at":"2024-07-01T11:07:23Z","abstract_excerpt":"The training and inference of large language models (LLMs) are together a costly process that transports knowledge from raw data to meaningful computation. Inspired by the memory hierarchy of the human brain, we reduce this cost by equipping LLMs with explicit memory, a memory format cheaper than model parameters and text retrieval-augmented generation (RAG). Conceptually, with most of its knowledge externalized to explicit memories, the LLM can enjoy a smaller parameter size, training cost, and inference cost, all proportional to the amount of remaining \"abstract knowledge\". As a preliminary "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.01178","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.01178/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2407.01178","created_at":"2026-07-05T10:06:04.818098+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.01178v1","created_at":"2026-07-05T10:06:04.818098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.01178","created_at":"2026-07-05T10:06:04.818098+00:00"},{"alias_kind":"pith_short_12","alias_value":"TEJA2DYEKBZL","created_at":"2026-07-05T10:06:04.818098+00:00"},{"alias_kind":"pith_short_16","alias_value":"TEJA2DYEKBZLJHOQ","created_at":"2026-07-05T10:06:04.818098+00:00"},{"alias_kind":"pith_short_8","alias_value":"TEJA2DYE","created_at":"2026-07-05T10:06:04.818098+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01249","citing_title":"Trust Region On-Policy Distillation","ref_index":280,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30260","citing_title":"How LoRA Remembers? A Parametric Memory Law for LLM Finetuning","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2511.02805","citing_title":"MemSearcher: Training LLMs to Reason, Search and Manage Memory via End-to-End Reinforcement Learning","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2504.15965","citing_title":"From Human Memory to AI Memory: A Survey on Memory Mechanisms in the Era of LLMs","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06132","citing_title":"MemReranker: Reasoning-Aware Reranking for Agent Memory Retrieval","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06132","citing_title":"MemReranker: Reasoning-Aware Reranking for Agent Memory Retrieval","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TEJA2DYEKBZLJHOQTB2Z5SPWAV","json":"https://pith.science/pith/TEJA2DYEKBZLJHOQTB2Z5SPWAV.json","graph_json":"https://pith.science/api/pith-number/TEJA2DYEKBZLJHOQTB2Z5SPWAV/graph.json","events_json":"https://pith.science/api/pith-number/TEJA2DYEKBZLJHOQTB2Z5SPWAV/events.json","paper":"https://pith.science/paper/TEJA2DYE"},"agent_actions":{"view_html":"https://pith.science/pith/TEJA2DYEKBZLJHOQTB2Z5SPWAV","download_json":"https://pith.science/pith/TEJA2DYEKBZLJHOQTB2Z5SPWAV.json","view_paper":"https://pith.science/paper/TEJA2DYE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.01178&json=true","fetch_graph":"https://pith.science/api/pith-number/TEJA2DYEKBZLJHOQTB2Z5SPWAV/graph.json","fetch_events":"https://pith.science/api/pith-number/TEJA2DYEKBZLJHOQTB2Z5SPWAV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TEJA2DYEKBZLJHOQTB2Z5SPWAV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TEJA2DYEKBZLJHOQTB2Z5SPWAV/action/storage_attestation","attest_author":"https://pith.science/pith/TEJA2DYEKBZLJHOQTB2Z5SPWAV/action/author_attestation","sign_citation":"https://pith.science/pith/TEJA2DYEKBZLJHOQTB2Z5SPWAV/action/citation_signature","submit_replication":"https://pith.science/pith/TEJA2DYEKBZLJHOQTB2Z5SPWAV/action/replication_record"}},"created_at":"2026-07-05T10:06:04.818098+00:00","updated_at":"2026-07-05T10:06:04.818098+00:00"}