{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WMPDCHI5N5XTUTVBCKU6IF2GEI","short_pith_number":"pith:WMPDCHI5","schema_version":"1.0","canonical_sha256":"b31e311d1d6f6f3a4ea112a9e41746222ad14988c6c3dc80af53734077f8e47b","source":{"kind":"arxiv","id":"2607.05690","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.05690","created_at":"2026-07-08T01:18:41.684943+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.05690v1","created_at":"2026-07-08T01:18:41.684943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05690","created_at":"2026-07-08T01:18:41.684943+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMPDCHI5N5XT","created_at":"2026-07-08T01:18:41.684943+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMPDCHI5N5XTUTVB","created_at":"2026-07-08T01:18:41.684943+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMPDCHI5","created_at":"2026-07-08T01:18:41.684943+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/WMPDCHI5N5XTUTVBCKU6IF2GEI","json":"https://pith.science/pith/WMPDCHI5N5XTUTVBCKU6IF2GEI.json","graph_json":"https://pith.science/api/pith-number/WMPDCHI5N5XTUTVBCKU6IF2GEI/graph.json","events_json":"https://pith.science/api/pith-number/WMPDCHI5N5XTUTVBCKU6IF2GEI/events.json","paper":"https://pith.science/paper/WMPDCHI5"},"agent_actions":{"view_html":"https://pith.science/pith/WMPDCHI5N5XTUTVBCKU6IF2GEI","download_json":"https://pith.science/pith/WMPDCHI5N5XTUTVBCKU6IF2GEI.json","view_paper":"https://pith.science/paper/WMPDCHI5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.05690&json=true","fetch_graph":"https://pith.science/api/pith-number/WMPDCHI5N5XTUTVBCKU6IF2GEI/graph.json","fetch_events":"https://pith.science/api/pith-number/WMPDCHI5N5XTUTVBCKU6IF2GEI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMPDCHI5N5XTUTVBCKU6IF2GEI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMPDCHI5N5XTUTVBCKU6IF2GEI/action/storage_attestation","attest_author":"https://pith.science/pith/WMPDCHI5N5XTUTVBCKU6IF2GEI/action/author_attestation","sign_citation":"https://pith.science/pith/WMPDCHI5N5XTUTVBCKU6IF2GEI/action/citation_signature","submit_replication":"https://pith.science/pith/WMPDCHI5N5XTUTVBCKU6IF2GEI/action/replication_record"}},"created_at":"2026-07-08T01:18:41.684943+00:00","updated_at":"2026-07-08T01:18:41.684943+00:00"}