{"_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_b219b9bc7bd1c4faa0b54be8af3eaf3f9e5f248998719c8685d9bd4168143d31","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_b219b9bc7bd1c4faa0b54be8af3eaf3f9e5f248998719c8685d9bd4168143d31","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"320aaafedda3b4d87bde24c466618e33a693c45efa090d48bbeb7b1ab4e52611","published":"Thu, 09 Jul 2026 00:00:00 -0400","receipt_hash":"320aaafedda3b4d87bde24c466618e33a693c45efa090d48bbeb7b1ab4e52611","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":"320aaafedda3b4d87bde24c466618e33a693c45efa090d48bbeb7b1ab4e52611","observed_at":"2026-07-09T04:43:38.345231Z","parent_run_hash":"3e22c7c40abc4d94232acf1766a43492b8b8d51d10a58f1109535988a16554e6","published":"Thu, 09 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.06447v2 Announce Type: replace \nAbstract: Recent LLM-based mathematical reasoning agents have begun to tackle research-level problems and, in several cases, have contributed to the resolution of open problems. However, scaling and orchestrating such agents effectively remains challenging, due to the difficulty of coordinating parallel proof search while keeping intermediate claims organized and reliable. In this paper, we propose Danus, an orchestration system for research-level mathematical reasoning centered on a shared fact graph as a global memory-management mechanism. Danus consists of a main agent that performs planning and coordination, multiple worker agents that carry out proof search in parallel, and a stateless verifier that checks proposed mathematical claims before they are admitted into the fact graph. Each verified fact is stored together with its proof and logical dependencies, allowing the system to build long arguments incrementally while keeping the shared","title":"Danus: Orchestrating Mathematical Reasoning Agents with Fact-Graph Memory","url":"https://arxiv.org/abs/2607.06447","vendor":"arxiv_cs_ai"},"summary":"arXiv:2607.06447v2 Announce Type: replace \nAbstract: Recent LLM-based mathematical reasoning agents have begun to tackle research-level problems and, in several cases, have contributed to the resolution of open problems. However, scaling and orchestrating such agents effectively remains challenging, due to the difficulty of coordinating parallel proof search while keeping intermediate claims organized and reliable. In this paper, we propose Danus, an orchestration system for research-level mathematical reasoning centered on a shared fact graph as a global memory-management mechanism. Danus consists of a main agent that performs planning and coordination, multiple worker agents that carry out proof search in parallel, and a stateless verifier that checks proposed mathematical claims before they are admitted into the fact graph. Each verified fact is stored together with its proof and logical dependencies, allowing the system to build long arguments incrementally while keeping the shared","title":"Danus: Orchestrating Mathematical Reasoning Agents with Fact-Graph Memory","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-07-09T04:43:38Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2607.06447"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:63879e46286465cb756c48661383a3e4c8d30e743ece6a3259eb8a3d2ca6d29fe2b76cb61c78d1e98a072ac3988948da76cb02b5457b0ea4c70550db5bbd250e","signer":"crovia.substrate","subject":{"observed_at":"2026-07-09T04:43:38Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2607.06447"},"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":"abec09a86c02f00cab46cd73005c956d936961e07b441eda578f98822949b7ac","leaf_index":296179,"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":"4334678734f33fccb5fe8a7a884fe60bdcbafc1255edef092f1797f1f1f6f1eb","side":"left"},{"sibling":"21399af080565a30588cc806f4d8a6e58d20bf6d3afe5c8c35e251296787fd6d","side":"left"},{"sibling":"c3a803329510b0b17f9f18ecbf31717fd33248773413ff7e81f7e32379a8629b","side":"right"},{"sibling":"7f681771d6f1600525465500f4fc25c8a3afcc8c8deeadf72a0e60595ad207e3","side":"right"},{"sibling":"3d4f6ddfc02f6b588b8e7e47d928f6a9337230f2984b7bbc50b5608d7e7aa03b","side":"left"},{"sibling":"f95bff985aa7c669523e81a6b3e235ec2edadeeaf162721af802f1ea75a20888","side":"left"},{"sibling":"0c64b5ca40a519de00e7e467e1220b2def2b2b1f0826ffde72f1d615f3bcf094","side":"left"},{"sibling":"6e8f2e16cb75beb661e7f7b63be19804b6f6474dfbf899f8e417b19695f2fba4","side":"left"},{"sibling":"47a94dfb6e50a020e68582e6af2e6a8cf5a4c7efe9fed3deaedbc51f53d75367","side":"right"},{"sibling":"92bb57de69c78fd32ac7108b10d81676c184265a5a53de3c4b22d8cf3b54b499","side":"right"},{"sibling":"85a226efd14acc17835b04bc26706fa44595edbd531f194faf59f60ab72d4bb8","side":"left"},{"sibling":"da38b05536b12aee196b6ac988739211c257d32da790faccf5ac4b0cbc1bb15c","side":"right"},{"sibling":"d438dc3eddb0b14dc8b97cd021a4f44545ce5a8e827f3ea4044fd32b1877475e","side":"right"},{"sibling":"f73ad10346837ae47f59f0647f79b9416e1d499bf2b90af44448e7f09372200a","side":"right"},{"sibling":"bdc09902fcd434c0f7d3e680bf550e560777228c0b085ce80c637ce97fc4104c","side":"right"},{"sibling":"d8b9143917b539c543cf4448cec00131f8b807bd8004979c54ebe09798748c66","side":"left"},{"sibling":"ba603dffe985ef518e3a72793a3eaca83a7f1a79e5491fd0f62f421339f2d137","side":"right"},{"sibling":"be20b90931f0a14e3558ea4387537200fcbd14e019b3c5ed07a2ae4c62fc7c42","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":296360,"merkle_root":"64af62f723a5bc02adfa98b77e2006fc634de4ebf68626694f052342a200bea2","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260709T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-07-09T05:38:18Z","sig_algorithm":"ed25519","signature":"92ece7411e0d82898aac164e7d6573a6d0f7a595aad0780d710d873e548a061d2a8678cef4d237d3bf0eabe0a5f766b41cbc0b4bada2801e7532026291b4a309","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_b219b9bc7bd1c4faa0b54be8af3eaf3f9e5f248998719c8685d9bd4168143d31"}}