{"_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_38f9e187131da963e7e9b9e98562eb247c7661e5a797e022b9ff0fda84f42de0","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_38f9e187131da963e7e9b9e98562eb247c7661e5a797e022b9ff0fda84f42de0","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"e9b0493f24b9435bc36eb062147d94903d483c554ae72a2c56f2624532c30ed7","published":"Thu, 16 Jul 2026 00:00:00 -0400","receipt_hash":"e9b0493f24b9435bc36eb062147d94903d483c554ae72a2c56f2624532c30ed7","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":"e9b0493f24b9435bc36eb062147d94903d483c554ae72a2c56f2624532c30ed7","observed_at":"2026-07-16T04:44:04.234592Z","parent_run_hash":"392cd8ef881a5a54dbb7fbd0e0c490e4811d7ed32379244b3196bd5cb9c5d632","published":"Thu, 16 Jul 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:2607.13884v1 Announce Type: new \nAbstract: Large Language Model (LLM) agents have shown remarkable capabilities in autonomous decision-making by generating sequential trajectories of states, actions, and observations. However, in complex, long-horizon tasks, these agents frequently suffer from compounding errors and struggle to recover from failures. Existing self-correction mechanisms rely on prompt-based reflection, which is inherently brittle, incurs heavy time and API costs due to iterative trial-and-error loops, and produces task-specific memory that may be hard to generalize to new scenarios. To address this, we propose Experience Memory Graph (EMG), a framework that reformulates agent failure recovery as a graph matching problem. At training time, we convert both failed exploration trajectories and successful expert trajectories into directed action decision graphs. By matching these graphs, we extract common subgraphs (successful workflows) and graph edit paths that expli","title":"Experience Memory Graph: One-Shot Error Correction for Agents","url":"https://arxiv.org/abs/2607.13884","vendor":"arxiv_cs_ai"},"summary":"arXiv:2607.13884v1 Announce Type: new \nAbstract: Large Language Model (LLM) agents have shown remarkable capabilities in autonomous decision-making by generating sequential trajectories of states, actions, and observations. However, in complex, long-horizon tasks, these agents frequently suffer from compounding errors and struggle to recover from failures. Existing self-correction mechanisms rely on prompt-based reflection, which is inherently brittle, incurs heavy time and API costs due to iterative trial-and-error loops, and produces task-specific memory that may be hard to generalize to new scenarios. To address this, we propose Experience Memory Graph (EMG), a framework that reformulates agent failure recovery as a graph matching problem. At training time, we convert both failed exploration trajectories and successful expert trajectories into directed action decision graphs. By matching these graphs, we extract common subgraphs (successful workflows) and graph edit paths that expli","title":"Experience Memory Graph: One-Shot Error Correction for Agents","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-07-16T04:44:04Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2607.13884"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:6f595ba926f379154a382350714e40d380342a13ffee30113a6e0653c04c944b58f148f7b48f9df747ac13c875be455acbe492839f0e9e9d7eefc3a0f1050305","signer":"crovia.substrate","subject":{"observed_at":"2026-07-16T04:44:04Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2607.13884"},"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":"6752a15c8a9e622ecbd465f0840325468fcc26811e897b432e4754085bb37aa7","leaf_index":319761,"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":"4613dbd424117c862bc763da8a9a80eef8748fc7651a9f5a58b5dcea7fe1e67e","side":"left"},{"sibling":"513a060860d1f9f43bb16037947a78da1888edb80b9732b7f889644a6d99a080","side":"right"},{"sibling":"9dd2fde5b41e42aa8cdff2c32b0ccce5b5a711bf9c06a4419a9b9e2c14966710","side":"right"},{"sibling":"76878bbbd80ea634e8016ac7af39cdf266d07c94f09ca88823ac83f85adbf9b4","side":"right"},{"sibling":"5e897a1d9753e32d2a856efec1512761cde4363809f74c7cfaf090f88fba0213","side":"left"},{"sibling":"1dbd22a5fb822c5476cb7e180e8490d921621bc1cceb4d837ea2f04dcdffe7ec","side":"right"},{"sibling":"7afb932f161ff4724a1990887cc43d4adfc6ec58627f8a3dbdaf74b08b052856","side":"right"},{"sibling":"ec3fec9bb698cfe3c65d9f75111532c318eaa7e7c5b933ded046cea471e330ab","side":"right"},{"sibling":"929619d7bb5abd9d4c015f749565f8d43a371ed382bafe122457d67edb9b8323","side":"left"},{"sibling":"1290775fa2a1fe2079ed83a9c60b8cb479714b6312967daa62f6a91dbbe1cac9","side":"right"},{"sibling":"95977bf2fb44d423026e874e6c275f78b1cf48666d2c472c5e4603d16f4faf7f","side":"right"},{"sibling":"6b83879fdb76b5b7270071f1edfe4d1a059fa9b92653e70fc8c8893214b8f237","side":"right"},{"sibling":"ff49c1d8749b258f58cc33cfaf20d723098ed6860fb62a6779db960d6250915b","side":"right"},{"sibling":"34d85f6ad6cc7dfa79d90e2b9ff99a561bcdc75b0301bbbd3e83861f54535c1e","side":"left"},{"sibling":"f302542c38ba7c3aab7c9280dd60259ecec777dca6e6f71b6f0729b0b8791b72","side":"left"},{"sibling":"d8b9143917b539c543cf4448cec00131f8b807bd8004979c54ebe09798748c66","side":"left"},{"sibling":"3ee6ab8db1878db0b324dd807ca233edd472899b8e90d2c5e018848ea5d12d99","side":"right"},{"sibling":"73a8d1605c15a74de720f0c54b5b4567e3eb8b5999bd8812dc66eedc461540fa","side":"right"},{"sibling":"1cecb7f447febd025aac272837c80de218aecc6485d2395a509b2a1f1b9c746e","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":320080,"merkle_root":"1e159bceacfdb1f3c930dae410f8759ddc4c762abcfa4a257b150d6f44ab16e0","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260716T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-07-16T05:38:31Z","sig_algorithm":"ed25519","signature":"c1cd1fc5704d4fec4dee47b29a0e9877f8cfb41eb61dcfd783d82344a15f6e44d80d6cd5128849547b62fe9d9724fc71433319ab6030445b4ac1c9e6bf8a3709","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_38f9e187131da963e7e9b9e98562eb247c7661e5a797e022b9ff0fda84f42de0"}}