{"_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_d92c553f8fe06511a663da8101ba23a1f27aa85a1f3e705673f8b7327abfe095","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_d92c553f8fe06511a663da8101ba23a1f27aa85a1f3e705673f8b7327abfe095","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"0c97df23f3204945bc102fb55fe998394a12cc783911af4850ae282a8582b3db","published":"Mon, 08 Jun 2026 00:00:00 -0400","receipt_hash":"0c97df23f3204945bc102fb55fe998394a12cc783911af4850ae282a8582b3db","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":"0c97df23f3204945bc102fb55fe998394a12cc783911af4850ae282a8582b3db","observed_at":"2026-06-08T04:44:02.392073Z","parent_run_hash":"4b9e67a023632e16a32d228bb97fee209911f388e0a8dbf20b5a4ec02729c20f","published":"Mon, 08 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.06787v1 Announce Type: new \nAbstract: Large Language Models (LLMs) show promise as tool-using agents but remain limited in long-horizon tasks that require remembering, organizing, and reusing knowledge. Prior memory approaches aim to resolve the situation, but mainly focus on storing factual information. Recent work on procedural memory improves task reuse, yet often reduces to replaying past successes without addressing failure cases or online scalability. We introduce a unified and automatic memory framework that integrates semantic, episodic, and procedural memory in a bi-level design combining short-term and long-term stores. A multi-agent architecture with actor, memory, and critic agents enables automatic memory generation, reward annotation, and adaptive retrieval. Long-term memory is managed through reward-based evaluation, merging, and pruning, ensuring scalability and continual improvement. Experiments across various environments show that our approach improves rob","title":"AdMem: Advanced Memory for Task-solving Agents","url":"https://arxiv.org/abs/2606.06787","vendor":"arxiv_cs_ai"},"summary":"arXiv:2606.06787v1 Announce Type: new \nAbstract: Large Language Models (LLMs) show promise as tool-using agents but remain limited in long-horizon tasks that require remembering, organizing, and reusing knowledge. Prior memory approaches aim to resolve the situation, but mainly focus on storing factual information. Recent work on procedural memory improves task reuse, yet often reduces to replaying past successes without addressing failure cases or online scalability. We introduce a unified and automatic memory framework that integrates semantic, episodic, and procedural memory in a bi-level design combining short-term and long-term stores. A multi-agent architecture with actor, memory, and critic agents enables automatic memory generation, reward annotation, and adaptive retrieval. Long-term memory is managed through reward-based evaluation, merging, and pruning, ensuring scalability and continual improvement. Experiments across various environments show that our approach improves rob","title":"AdMem: Advanced Memory for Task-solving Agents","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-06-08T04:44:02Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2606.06787"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:8bfa0fa913e24d0cf2f3a8c88636520b09d1ceea82b51304dfbcaa9fb70b6343ce5e540b1d8e825cf477da9e835b1ea514a58a393f5d71b7e7ea03890d8ba209","signer":"crovia.substrate","subject":{"observed_at":"2026-06-08T04:44:02Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2606.06787"},"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":"6ac269e953c51ab7ca3a59250030aa7fc0ba40d8a0872222791cc3ab3c66139d","leaf_index":223650,"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":"f825628381721b2157eb87198ff7335e2e921b9a79291630e5f5059f3ab506d8","side":"right"},{"sibling":"13ff5c46bfad2dd54cdcd1a2091f100be8cacbc2ce1c13cd7d80b6f1b8c98e5c","side":"left"},{"sibling":"9c476390332aec6aa07f278283b3243877019c3749e3499db2f555bed0c04b5d","side":"right"},{"sibling":"0a79ef14ed0e7f1a2bc46d3e0d0b6910cb5729f99045f5f366d4b2bbcd6d945e","side":"right"},{"sibling":"1152166bb1c25fe15c7957929b948ea262e5d1c166f87cce50a34254b61f618c","side":"right"},{"sibling":"05827a4a13c768e2db265e72fad0f6fb7a7fbb7d073c0c14e6439b2d7aa27a42","side":"left"},{"sibling":"60fb6338c1398b60f2495d29f49c8dd6efd167badd0ad0f69e5eaf6aa895db59","side":"right"},{"sibling":"f52e49855e10c1db333480ff9b611c4795fd9e2f84430900141c99330582a520","side":"left"},{"sibling":"5f83c2a81d932eed327e06ff2498f8ed85199cdf7d5f3cd3565fb2a9003a8b8f","side":"left"},{"sibling":"06e9be95ebfd6e5cffbe9db8fc8fd32e8c20d38b7d7f0df3dc7dc5e76bb1848c","side":"right"},{"sibling":"5480e1ea31f4744f9bd7c4261771fe51f2cdb01e705cc17320bfc202d935ca12","side":"right"},{"sibling":"24fdc29d461691aedb6fa920758206b5bb43851f477ef7a04c34aaed84b8971b","side":"left"},{"sibling":"036922da4e1e2c46d948f070454bfad299b7406fb00735ea9d8bd1e687f5f445","side":"right"},{"sibling":"533d82482604463aa4a281b9d8b85917b383b7c5f924b2b494039524c55e8797","side":"left"},{"sibling":"b2590791b920ca2a4ed39de126d2c0b1a10d9e7e62f572f12425f214e767b6e1","side":"left"},{"sibling":"87c6b850dfec08ac35a693d9db3a3315250a68adb1cfab9b1015f212b63b15bd","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":224761,"merkle_root":"e9f7b49b652e869ab97ffba9c5a31356b2d0e3dc5d00bb28944adf737c46b1e7","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260609T103805Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-06-09T14:15:34Z","sig_algorithm":"ed25519","signature":"8ad8076fb12c8e486ae1d1559a9a7ba8e2ee996a9ad3d8ba7bcdbdbd88ab3a15bcb429707aca6d3e9d8b97e2ba755b3dcc77b1abb6601ccb829842719a6fb30d","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_d92c553f8fe06511a663da8101ba23a1f27aa85a1f3e705673f8b7327abfe095"}}