{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YFQBZVMY2IGLK2SMXGASKJERKV","short_pith_number":"pith:YFQBZVMY","schema_version":"1.0","canonical_sha256":"c1601cd598d20cb56a4cb98125249155556f6e24349f4c5281fcfb6b3144bf18","source":{"kind":"arxiv","id":"2608.11654","version":1},"attestation_state":"computed","paper":{"title":"Towards a Formal Definition of Agent Memory: Basis, Span, Optimality, and the Sequential Memory Problem","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hongyao Tang","submitted_at":"2026-08-12T04:54:26Z","abstract_excerpt":"Despite the wide deployment of memory in large-model agents, there is no unified formal account of what a memory is or when it is optimal. This paper takes a first step toward this account. The central idea is that memory is a basis, knowledge is its span, and answerability is a coverage problem: an agent stores events extracted from a material; a generation operator turns any event set into the knowledge it entails; and a query is answerable exactly when some single item in the span covers it. The optimal memory is then the capacity-constrained maximizer of expected coverage, and its value tr"},"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":"2608.11654","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-12T04:54:26Z","cross_cats_sorted":[],"title_canon_sha256":"e7afe255c626bf9b2f8efe24822df575333168d2588d453d4552b0793adb6c97","abstract_canon_sha256":"28da599d60e1a99187d3c85e3db9029622cdb535355de34be1bb1d5cb80be57e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-13T01:27:13.857485Z","signature_b64":"1NCbAQ/HjAmDZE1OaJS1r+HImVs/Qn3H52so15NHnKiWl8a+A6YH0s2Dv2x/DYYjjennrDgSLTu/bzT8GsJtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1601cd598d20cb56a4cb98125249155556f6e24349f4c5281fcfb6b3144bf18","last_reissued_at":"2026-08-13T01:27:13.854749Z","signature_status":"signed_v1","first_computed_at":"2026-08-13T01:27:13.854749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a Formal Definition of Agent Memory: Basis, Span, Optimality, and the Sequential Memory Problem","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hongyao Tang","submitted_at":"2026-08-12T04:54:26Z","abstract_excerpt":"Despite the wide deployment of memory in large-model agents, there is no unified formal account of what a memory is or when it is optimal. This paper takes a first step toward this account. The central idea is that memory is a basis, knowledge is its span, and answerability is a coverage problem: an agent stores events extracted from a material; a generation operator turns any event set into the knowledge it entails; and a query is answerable exactly when some single item in the span covers it. The optimal memory is then the capacity-constrained maximizer of expected coverage, and its value tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.11654","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/2608.11654/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":"2608.11654","created_at":"2026-08-13T01:27:13.856126+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.11654v1","created_at":"2026-08-13T01:27:13.856126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11654","created_at":"2026-08-13T01:27:13.856126+00:00"},{"alias_kind":"pith_short_12","alias_value":"YFQBZVMY2IGL","created_at":"2026-08-13T01:27:13.856126+00:00"},{"alias_kind":"pith_short_16","alias_value":"YFQBZVMY2IGLK2SM","created_at":"2026-08-13T01:27:13.856126+00:00"},{"alias_kind":"pith_short_8","alias_value":"YFQBZVMY","created_at":"2026-08-13T01:27:13.856126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YFQBZVMY2IGLK2SMXGASKJERKV","json":"https://pith.science/pith/YFQBZVMY2IGLK2SMXGASKJERKV.json","graph_json":"https://pith.science/api/pith-number/YFQBZVMY2IGLK2SMXGASKJERKV/graph.json","events_json":"https://pith.science/api/pith-number/YFQBZVMY2IGLK2SMXGASKJERKV/events.json","paper":"https://pith.science/paper/YFQBZVMY"},"agent_actions":{"view_html":"https://pith.science/pith/YFQBZVMY2IGLK2SMXGASKJERKV","download_json":"https://pith.science/pith/YFQBZVMY2IGLK2SMXGASKJERKV.json","view_paper":"https://pith.science/paper/YFQBZVMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.11654&json=true","fetch_graph":"https://pith.science/api/pith-number/YFQBZVMY2IGLK2SMXGASKJERKV/graph.json","fetch_events":"https://pith.science/api/pith-number/YFQBZVMY2IGLK2SMXGASKJERKV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YFQBZVMY2IGLK2SMXGASKJERKV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YFQBZVMY2IGLK2SMXGASKJERKV/action/storage_attestation","attest_author":"https://pith.science/pith/YFQBZVMY2IGLK2SMXGASKJERKV/action/author_attestation","sign_citation":"https://pith.science/pith/YFQBZVMY2IGLK2SMXGASKJERKV/action/citation_signature","submit_replication":"https://pith.science/pith/YFQBZVMY2IGLK2SMXGASKJERKV/action/replication_record"}},"created_at":"2026-08-13T01:27:13.856126+00:00","updated_at":"2026-08-13T01:27:13.856126+00:00"}