{"_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_9b120defc9d1c357428c9d1255d7126856a75a181a34ad819c2ee3d91df67816","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_9b120defc9d1c357428c9d1255d7126856a75a181a34ad819c2ee3d91df67816","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"fcc05133d78ab36387d657c2f5c264a299a3f65fd54c572c5ba36be06417be01","published":"Mon, 08 Jun 2026 00:00:00 -0400","receipt_hash":"fcc05133d78ab36387d657c2f5c264a299a3f65fd54c572c5ba36be06417be01","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":"fcc05133d78ab36387d657c2f5c264a299a3f65fd54c572c5ba36be06417be01","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.06618v1 Announce Type: cross \nAbstract: How can we plan long-horizon routes that reach designated goals, visit required waypoints, and remain short when only short-horizon offline trajectories are available? This problem matters in offline navigation because collecting sufficiently rich long-horizon data is difficult, yet real agents must still solve long-range tasks with route-level efficiency rather than mere feasibility. The difficulty is twofold: at the microscopic level, composing many short-horizon segments creates a trade-off between search cost and path quality, while at the macroscopic level, waypoint ordering requires comparing pairwise travel costs among start, goal, and waypoint anchors that are unknown before planning and increasingly unreliable when estimated only from long-range temporal distance.\n  In this paper, we propose ChronoForest, a closed-loop planning system that couples local bridge search and online route re-solving through an anchor-chaining tree ","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","url":"https://arxiv.org/abs/2606.06618","vendor":"arxiv_cs_ai"},"summary":"arXiv:2606.06618v1 Announce Type: cross \nAbstract: How can we plan long-horizon routes that reach designated goals, visit required waypoints, and remain short when only short-horizon offline trajectories are available? This problem matters in offline navigation because collecting sufficiently rich long-horizon data is difficult, yet real agents must still solve long-range tasks with route-level efficiency rather than mere feasibility. The difficulty is twofold: at the microscopic level, composing many short-horizon segments creates a trade-off between search cost and path quality, while at the macroscopic level, waypoint ordering requires comparing pairwise travel costs among start, goal, and waypoint anchors that are unknown before planning and increasingly unreliable when estimated only from long-range temporal distance.\n  In this paper, we propose ChronoForest, a closed-loop planning system that couples local bridge search and online route re-solving through an anchor-chaining tree ","title":"ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition","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.06618"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:c191d98f4634e149c16e7961689b9152a2dc7bc5d8569eaff2fd7c675e26fdeb28269c4da8dc7d480f78f4f6cf6292c9f982a35505ee32504612752c54348300","signer":"crovia.substrate","subject":{"observed_at":"2026-06-08T04:44:02Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2606.06618"},"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":"1e44232f1ff2b6fdd7c7fd1d7b371a9312f1d68094d29153fdbe2e623ddc6592","leaf_index":223700,"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":"6790442ecb6cefacab37d3c5e2cc9028e77f614c3398895e6e406684d525b9c4","side":"right"},{"sibling":"67e281cbd0260c339e0862dd461704edd7cb04b52a794f2ffb393d83f41a9eb8","side":"right"},{"sibling":"4be48c16eecad8984ef2c68062a79dca0ac73e1946188eade9df121dde7927b0","side":"left"},{"sibling":"d14c0d6ce3e1689b74504887d431a719be70cd3ee51538c89bc5a33a74cc1a23","side":"right"},{"sibling":"84b2c5fccf4e90ce0b759f8795f31139f14d7ed4ad752b516345cfc328c5f97c","side":"left"},{"sibling":"69d4c7a585a151d107d94990190ca2f73b24349e5ea99e758fd175b35e8b12a2","side":"right"},{"sibling":"b8fd8426684aecbac5ac68f1180433b0ef287dbac35cd5f96d146410960e5e8e","side":"left"},{"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_9b120defc9d1c357428c9d1255d7126856a75a181a34ad819c2ee3d91df67816"}}