{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YFQBZVMY2IGLK2SMXGASKJERKV","short_pith_number":"pith:YFQBZVMY","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"},"canonical_sha256":"c1601cd598d20cb56a4cb98125249155556f6e24349f4c5281fcfb6b3144bf18","source":{"kind":"arxiv","id":"2608.11654","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.11654","created_at":"2026-08-13T01:27:13Z"},{"alias_kind":"arxiv_version","alias_value":"2608.11654v1","created_at":"2026-08-13T01:27:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11654","created_at":"2026-08-13T01:27:13Z"},{"alias_kind":"pith_short_12","alias_value":"YFQBZVMY2IGL","created_at":"2026-08-13T01:27:13Z"},{"alias_kind":"pith_short_16","alias_value":"YFQBZVMY2IGLK2SM","created_at":"2026-08-13T01:27:13Z"},{"alias_kind":"pith_short_8","alias_value":"YFQBZVMY","created_at":"2026-08-13T01:27:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YFQBZVMY2IGLK2SMXGASKJERKV","target":"record","payload":{"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"},"canonical_sha256":"c1601cd598d20cb56a4cb98125249155556f6e24349f4c5281fcfb6b3144bf18","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"},"source_kind":"arxiv","source_id":"2608.11654","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-13T01:27:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B8JNfx667gSZ+i41vsEB6djNbM3drjYpDNrUTZCeVPtW48B3yyJ4CoO9rUjQlVPXCDnVeVEdnDqbwm5wr67HBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:48:35.508417Z"},"content_sha256":"31f7b659e77de01d9760f111695586873ff62174142900719e454b9ba3d426be","schema_version":"1.0","event_id":"sha256:31f7b659e77de01d9760f111695586873ff62174142900719e454b9ba3d426be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YFQBZVMY2IGLK2SMXGASKJERKV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-13T01:27:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XJQJ+P1kXx/SaXEl4bHc5xiSpFmox87sQPgBj2ujo1WLClNKKR9Ik9VrwFN0aosGhNiYlcQR9QULDwvo/gM/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:48:35.509365Z"},"content_sha256":"f854f4df99d95452fa9c6cb89a9f72bd7ef8cb5e37b2b43e485ee3a4ed5908f7","schema_version":"1.0","event_id":"sha256:f854f4df99d95452fa9c6cb89a9f72bd7ef8cb5e37b2b43e485ee3a4ed5908f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YFQBZVMY2IGLK2SMXGASKJERKV/bundle.json","state_url":"https://pith.science/pith/YFQBZVMY2IGLK2SMXGASKJERKV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YFQBZVMY2IGLK2SMXGASKJERKV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-16T13:48:35Z","links":{"resolver":"https://pith.science/pith/YFQBZVMY2IGLK2SMXGASKJERKV","bundle":"https://pith.science/pith/YFQBZVMY2IGLK2SMXGASKJERKV/bundle.json","state":"https://pith.science/pith/YFQBZVMY2IGLK2SMXGASKJERKV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YFQBZVMY2IGLK2SMXGASKJERKV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YFQBZVMY2IGLK2SMXGASKJERKV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"28da599d60e1a99187d3c85e3db9029622cdb535355de34be1bb1d5cb80be57e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-12T04:54:26Z","title_canon_sha256":"e7afe255c626bf9b2f8efe24822df575333168d2588d453d4552b0793adb6c97"},"schema_version":"1.0","source":{"id":"2608.11654","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.11654","created_at":"2026-08-13T01:27:13Z"},{"alias_kind":"arxiv_version","alias_value":"2608.11654v1","created_at":"2026-08-13T01:27:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11654","created_at":"2026-08-13T01:27:13Z"},{"alias_kind":"pith_short_12","alias_value":"YFQBZVMY2IGL","created_at":"2026-08-13T01:27:13Z"},{"alias_kind":"pith_short_16","alias_value":"YFQBZVMY2IGLK2SM","created_at":"2026-08-13T01:27:13Z"},{"alias_kind":"pith_short_8","alias_value":"YFQBZVMY","created_at":"2026-08-13T01:27:13Z"}],"graph_snapshots":[{"event_id":"sha256:f854f4df99d95452fa9c6cb89a9f72bd7ef8cb5e37b2b43e485ee3a4ed5908f7","target":"graph","created_at":"2026-08-13T01:27:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.11654/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Hongyao Tang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-12T04:54:26Z","title":"Towards a Formal Definition of Agent Memory: Basis, Span, Optimality, and the Sequential Memory Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.11654","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:31f7b659e77de01d9760f111695586873ff62174142900719e454b9ba3d426be","target":"record","created_at":"2026-08-13T01:27:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"28da599d60e1a99187d3c85e3db9029622cdb535355de34be1bb1d5cb80be57e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-12T04:54:26Z","title_canon_sha256":"e7afe255c626bf9b2f8efe24822df575333168d2588d453d4552b0793adb6c97"},"schema_version":"1.0","source":{"id":"2608.11654","kind":"arxiv","version":1}},"canonical_sha256":"c1601cd598d20cb56a4cb98125249155556f6e24349f4c5281fcfb6b3144bf18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1601cd598d20cb56a4cb98125249155556f6e24349f4c5281fcfb6b3144bf18","first_computed_at":"2026-08-13T01:27:13.854749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-13T01:27:13.854749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1NCbAQ/HjAmDZE1OaJS1r+HImVs/Qn3H52so15NHnKiWl8a+A6YH0s2Dv2x/DYYjjennrDgSLTu/bzT8GsJtAw==","signature_status":"signed_v1","signed_at":"2026-08-13T01:27:13.857485Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.11654","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31f7b659e77de01d9760f111695586873ff62174142900719e454b9ba3d426be","sha256:f854f4df99d95452fa9c6cb89a9f72bd7ef8cb5e37b2b43e485ee3a4ed5908f7"],"state_sha256":"0c2cbae03d98d145c46ea032568ae834abe61c6e4837038ebc949cfa088379c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sKkXHN0MFunBzXCgRuLrCfr4HTjjGcVqh6tH1rENZCGoPcfwHYr1+c+7VWJW5G6RQARDaT6IzTMhqclk0ntjBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T13:48:35.531702Z","bundle_sha256":"2f785285f0a4b3d88cc195788e72597db25623d35da6001b567dce2070245039"}}