{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WMPDCHI5N5XTUTVBCKU6IF2GEI","short_pith_number":"pith:WMPDCHI5","canonical_record":{"source":{"id":"2607.05690","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-06T23:16:11Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"6f05dbedca50cdd3f6697038abecab52e936d34c60b43afa540d6c7ad61075fe","abstract_canon_sha256":"ffbe345dc9d4f4213ef818da6b01b07a1568a865e1822eaca8640df7ea66266d"},"schema_version":"1.0"},"canonical_sha256":"b31e311d1d6f6f3a4ea112a9e41746222ad14988c6c3dc80af53734077f8e47b","source":{"kind":"arxiv","id":"2607.05690","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.05690","created_at":"2026-07-08T01:18:41Z"},{"alias_kind":"arxiv_version","alias_value":"2607.05690v1","created_at":"2026-07-08T01:18:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05690","created_at":"2026-07-08T01:18:41Z"},{"alias_kind":"pith_short_12","alias_value":"WMPDCHI5N5XT","created_at":"2026-07-08T01:18:41Z"},{"alias_kind":"pith_short_16","alias_value":"WMPDCHI5N5XTUTVB","created_at":"2026-07-08T01:18:41Z"},{"alias_kind":"pith_short_8","alias_value":"WMPDCHI5","created_at":"2026-07-08T01:18:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WMPDCHI5N5XTUTVBCKU6IF2GEI","target":"record","payload":{"canonical_record":{"source":{"id":"2607.05690","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-06T23:16:11Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"6f05dbedca50cdd3f6697038abecab52e936d34c60b43afa540d6c7ad61075fe","abstract_canon_sha256":"ffbe345dc9d4f4213ef818da6b01b07a1568a865e1822eaca8640df7ea66266d"},"schema_version":"1.0"},"canonical_sha256":"b31e311d1d6f6f3a4ea112a9e41746222ad14988c6c3dc80af53734077f8e47b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-08T01:18:41.685329Z","signature_b64":"m8Ah3FlWbCARTm7RJPW2WIUU2vL1tSMy4eO5FAdXAxqfaWVOEZtAodnx9bBUGrjzSyzkCp6ADamy8ZkcJbhCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b31e311d1d6f6f3a4ea112a9e41746222ad14988c6c3dc80af53734077f8e47b","last_reissued_at":"2026-07-08T01:18:41.684884Z","signature_status":"signed_v1","first_computed_at":"2026-07-08T01:18:41.684884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.05690","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-07-08T01:18:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D/Z/ByZ2ANhANxuL0v0V1gfZEqLQkq5s6yHDNMe8FzNxQUtKB/CoRHijpJvdjHAqe8Ee34CeU9HyT1nlGMIgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T04:51:22.027027Z"},"content_sha256":"ce138ec5c485a4926048d02fe25a20f865eb6e428270a03384b58e3557652279","schema_version":"1.0","event_id":"sha256:ce138ec5c485a4926048d02fe25a20f865eb6e428270a03384b58e3557652279"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WMPDCHI5N5XTUTVBCKU6IF2GEI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memory in the Loop: In-Process Retrieval as ExtendedWorking Memory for Language Agents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Carlo Lipizzi, Yusuf Khan","submitted_at":"2026-07-06T23:16:11Z","abstract_excerpt":"Language agents run a loop - observe, reason, act - but the memory they reason over sits outside it: a store queried at most once per turn. We study the regime where memory moves inside the loop, read and written on every step. The obstacle has always been latency: networked stores answer in tens to hundreds of milliseconds, and in-loop retrieval can inflate end-to-end latency by up to 83x when retrieval is expensive. Prior work manages that cost rather than questioning it: serving-layer scheduling hides it, \"memory-first\" designs ration retrieval to once per turn. We argue latency is a proper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.05690","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/2607.05690/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-07-08T01:18:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aOImUlGd84ndVFQjgZoFB3C8JesBPTH9zlU5zm5PS+13Da1km4VDW2wGd3HPtCb2nOkO0FxguC47w4gLfybYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T04:51:22.027413Z"},"content_sha256":"7cd8c079f0a35b70eec476a2980fe28b4215868bef0386b9e5678d22962a3078","schema_version":"1.0","event_id":"sha256:7cd8c079f0a35b70eec476a2980fe28b4215868bef0386b9e5678d22962a3078"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WMPDCHI5N5XTUTVBCKU6IF2GEI/bundle.json","state_url":"https://pith.science/pith/WMPDCHI5N5XTUTVBCKU6IF2GEI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WMPDCHI5N5XTUTVBCKU6IF2GEI/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-07-12T04:51:22Z","links":{"resolver":"https://pith.science/pith/WMPDCHI5N5XTUTVBCKU6IF2GEI","bundle":"https://pith.science/pith/WMPDCHI5N5XTUTVBCKU6IF2GEI/bundle.json","state":"https://pith.science/pith/WMPDCHI5N5XTUTVBCKU6IF2GEI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WMPDCHI5N5XTUTVBCKU6IF2GEI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WMPDCHI5N5XTUTVBCKU6IF2GEI","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":"ffbe345dc9d4f4213ef818da6b01b07a1568a865e1822eaca8640df7ea66266d","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-06T23:16:11Z","title_canon_sha256":"6f05dbedca50cdd3f6697038abecab52e936d34c60b43afa540d6c7ad61075fe"},"schema_version":"1.0","source":{"id":"2607.05690","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.05690","created_at":"2026-07-08T01:18:41Z"},{"alias_kind":"arxiv_version","alias_value":"2607.05690v1","created_at":"2026-07-08T01:18:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05690","created_at":"2026-07-08T01:18:41Z"},{"alias_kind":"pith_short_12","alias_value":"WMPDCHI5N5XT","created_at":"2026-07-08T01:18:41Z"},{"alias_kind":"pith_short_16","alias_value":"WMPDCHI5N5XTUTVB","created_at":"2026-07-08T01:18:41Z"},{"alias_kind":"pith_short_8","alias_value":"WMPDCHI5","created_at":"2026-07-08T01:18:41Z"}],"graph_snapshots":[{"event_id":"sha256:7cd8c079f0a35b70eec476a2980fe28b4215868bef0386b9e5678d22962a3078","target":"graph","created_at":"2026-07-08T01:18:41Z","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/2607.05690/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Language agents run a loop - observe, reason, act - but the memory they reason over sits outside it: a store queried at most once per turn. We study the regime where memory moves inside the loop, read and written on every step. The obstacle has always been latency: networked stores answer in tens to hundreds of milliseconds, and in-loop retrieval can inflate end-to-end latency by up to 83x when retrieval is expensive. Prior work manages that cost rather than questioning it: serving-layer scheduling hides it, \"memory-first\" designs ration retrieval to once per turn. We argue latency is a proper","authors_text":"Carlo Lipizzi, Yusuf Khan","cross_cats":["cs.CL"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-06T23:16:11Z","title":"Memory in the Loop: In-Process Retrieval as ExtendedWorking Memory for Language Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.05690","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:ce138ec5c485a4926048d02fe25a20f865eb6e428270a03384b58e3557652279","target":"record","created_at":"2026-07-08T01:18:41Z","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":"ffbe345dc9d4f4213ef818da6b01b07a1568a865e1822eaca8640df7ea66266d","cross_cats_sorted":["cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-06T23:16:11Z","title_canon_sha256":"6f05dbedca50cdd3f6697038abecab52e936d34c60b43afa540d6c7ad61075fe"},"schema_version":"1.0","source":{"id":"2607.05690","kind":"arxiv","version":1}},"canonical_sha256":"b31e311d1d6f6f3a4ea112a9e41746222ad14988c6c3dc80af53734077f8e47b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b31e311d1d6f6f3a4ea112a9e41746222ad14988c6c3dc80af53734077f8e47b","first_computed_at":"2026-07-08T01:18:41.684884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-08T01:18:41.684884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m8Ah3FlWbCARTm7RJPW2WIUU2vL1tSMy4eO5FAdXAxqfaWVOEZtAodnx9bBUGrjzSyzkCp6ADamy8ZkcJbhCAw==","signature_status":"signed_v1","signed_at":"2026-07-08T01:18:41.685329Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.05690","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce138ec5c485a4926048d02fe25a20f865eb6e428270a03384b58e3557652279","sha256:7cd8c079f0a35b70eec476a2980fe28b4215868bef0386b9e5678d22962a3078"],"state_sha256":"6c7c4f03cacb74d9f6bd6e2db274fb7ac0482532c4b8328e3cdb8f1eb550ae51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z7EqLUI1iioF5uZhmAksVqYKgghI9Z9rHftX1fpbO+nyrSxPbsyl/ngwBrctnT8vABihLuYpnffTVuvm3INbDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T04:51:22.029949Z","bundle_sha256":"33a5c78a573803002b2896d39a87f696654d32eb53b6d3beaf699dfd5b8bcffd"}}