{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_0fab5538e6a3770475e790fd9a7a8013ae7bbf87837101f1fab4c3f50783baf8","bitcoin_anchor":{"bitcoin_attestations":[],"calendar_attestations":[],"ots_url":"","stamped_at":"","status":"pending_next_stamp"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_0fab5538e6a3770475e790fd9a7a8013ae7bbf87837101f1fab4c3f50783baf8","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"133fe9d745ae8d42fa4751b508573afb1cbb16ff2073e7d37973f521e1ac3434","published":"Sat, 06 Jun 2026 00:00:00 -0400","receipt_hash":"133fe9d745ae8d42fa4751b508573afb1cbb16ff2073e7d37973f521e1ac3434","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"133fe9d745ae8d42fa4751b508573afb1cbb16ff2073e7d37973f521e1ac3434","observed_at":"2026-06-06T04:43:19.193968Z","parent_run_hash":"550d5b02674822f43975c282be668ca76a4d9c7c957eb1601ba8b07dcb67715e","published":"Sat, 06 Jun 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2606.06090v1 Announce Type: new \nAbstract: LLM-based agents increasingly tackle long-horizon tasks with interdependent decisions, where each action reshapes future constraints and intermediate errors can cascade. Existing RAG and agent memory systems organize histories by semantic similarity, retrieving content-relevant entries at decision time. We argue that this design mismatches execution-state dependencies: it fragments decision trajectories and mixes valid and erroneous traces, hindering coherent state reconstruction and error isolation. We propose MAGE (Memory as Agent-Guided Exploration), an active execution-state manager that stores interactions in a hierarchical state tree. The agent derives its state from the active root-to-current path, combining subgoal summaries, recent traces, and hints from prior branches. Four coupled operations maintain the tree: Grow records new traces, Compress summarizes completed subgoals, Maintain validates summaries, and Revise restores a t","title":"Beyond Semantic Organization: Memory as Execution State Management for Long-Horizon Agents","url":"https://arxiv.org/abs/2606.06090","vendor":"arxiv_cs_ai"},"summary":"arXiv:2606.06090v1 Announce Type: new \nAbstract: LLM-based agents increasingly tackle long-horizon tasks with interdependent decisions, where each action reshapes future constraints and intermediate errors can cascade. Existing RAG and agent memory systems organize histories by semantic similarity, retrieving content-relevant entries at decision time. We argue that this design mismatches execution-state dependencies: it fragments decision trajectories and mixes valid and erroneous traces, hindering coherent state reconstruction and error isolation. We propose MAGE (Memory as Agent-Guided Exploration), an active execution-state manager that stores interactions in a hierarchical state tree. The agent derives its state from the active root-to-current path, combining subgoal summaries, recent traces, and hints from prior branches. Four coupled operations maintain the tree: Grow records new traces, Compress summarizes completed subgoals, Maintain validates summaries, and Revise restores a t","title":"Beyond Semantic Organization: Memory as Execution State Management for Long-Horizon Agents","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-06-06T04:43:19Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2606.06090"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:3c78b87ec20bf63f9f7bf78da7920284f5bac580cb722d83b80afae8eb8c951fb6b72ddfd9749ffbd45cc6a154ca6e1d71d12a0879187df9f833abb20524d407","signer":"crovia.substrate","subject":{"observed_at":"2026-06-06T04:43:19Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2606.06090"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"b42636fa9260c87b83da0eea165273242ede4d7be60872b2c79695e5bd9eb63e","leaf_index":219213,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"93ec6b48e8ada3ee9a0c587db3a5fb953cf067dd46289d81e4499467380670c2","side":"left"},{"sibling":"d9a2913911d08a9d2e1208cff432df40c796951cf6fd63b0e6be83eb64874434","side":"right"},{"sibling":"e1d364abd3a0ff132f3830ca206030245a74299e6ce461b2071e6233097b252a","side":"left"},{"sibling":"d7e05f91a8954d456a836391a17504cb9ca2acdb6d6eeccbc3cd3c6de4c10ed6","side":"left"},{"sibling":"df12227c6bce1ac6503d4c8f1a8b3f5e8706a35545c1a96e217b00b5d27813b9","side":"right"},{"sibling":"54a29ea507e360ebe80a86f0756bc1afaf2a0bae92bafa210f0b67fa7c7e821e","side":"right"},{"sibling":"63213cfb37562a3ef2d70c7ab846d4203323a4985a9908a7078e73d8d4ab2f65","side":"left"},{"sibling":"8f35ffd1b994bec37a9cc24e0047790f92b64b006d85bef48f319d6d28a40687","side":"right"},{"sibling":"bd0dfa76bed61a2c5e95135a7304a2b8c4fd064958dbf768664232880d0abaa5","side":"right"},{"sibling":"84d2509eab51047589142ed6da8c496305d2fbcbe148e0e6755163db2c7a4bc4","side":"right"},{"sibling":"9e3ea17e834fab022f2eabcfedb8ea0ac95c1f9fb57edc5004dded68522d3c9e","side":"right"},{"sibling":"41d58fea95a95071715ee23ef8bcd15f5867a3639da28e62a0641bc95eb83094","side":"left"},{"sibling":"27ad9d6a9ab792d708709017242a61b9ca519da4e035f87a342811aae221d000","side":"left"},{"sibling":"5f303e2a7840c60038ff2d035b1cd911feefb0fba880de2d737c6671ace594d4","side":"right"},{"sibling":"b2590791b920ca2a4ed39de126d2c0b1a10d9e7e62f572f12425f214e767b6e1","side":"left"},{"sibling":"1a61eadbf0217d063ab78291ccafdc0c92907f7d6ccdc3357534ef89f07d78ae","side":"right"},{"sibling":"c300cf0154c136afc09b1702a0be98f4ba5b6dc5cf57e8cc714ec1eaf4196eff","side":"left"},{"sibling":"d841ad93efda0869e5eb97678f348f03f5caab4353e05ff4bf18f47fb945b822","side":"left"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":219672,"merkle_root":"d3e32d3a61ca02ce6b1f0b2db86721107770b250e8a5bf762a2c225d2f03c870","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260606T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-06-06T05:38:35Z","sig_algorithm":"ed25519","signature":"dab214c2d4d857f01383c8e93a521a774b1aba60eaee5677d4e43e4074f0342b2c6a9b9bfcff0eba74f7ac81fcb490dd0e43727979c1a7e8979c7e11547fb101","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_0fab5538e6a3770475e790fd9a7a8013ae7bbf87837101f1fab4c3f50783baf8"}}