{"_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_080ddbdca92deb51a79f6c5a4eee6c19369c69ea9636ec00aed56919fad0cb9f","bitcoin_anchor":{"bitcoin_attestations":["bitcoin_block_949451"],"calendar_attestations":["https://finney.calendar.eternitywall.com","https://btc.calendar.catallaxy.com","https://alice.btc.calendar.opentimestamps.org","https://bob.btc.calendar.opentimestamps.org"],"ots_url":"/registry/data/substrate/anchors/77fc9c28fae777b81da5b495b3115474df6592dfac590333213d3bdf8b94a9b3.ots","stamped_at":"2026-05-15T03:00:03Z","status":"bitcoin"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_080ddbdca92deb51a79f6c5a4eee6c19369c69ea9636ec00aed56919fad0cb9f","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"aa9575fce4c44e58efa0096107287ba78468adbb8ed44017f808f2701f89ea37","published":"Mon, 11 May 2026 00:00:00 -0400","receipt_hash":"aa9575fce4c44e58efa0096107287ba78468adbb8ed44017f808f2701f89ea37","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":"aa9575fce4c44e58efa0096107287ba78468adbb8ed44017f808f2701f89ea37","observed_at":"2026-05-11T04:43:50.688999Z","parent_run_hash":"8244cc3d66edb4604be5ded19e92c0b47893b228a258432a9c53a5796a870982","published":"Mon, 11 May 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:2605.06671v1 Announce Type: new \nAbstract: Large Language Models (LLMs) have demonstrated strong potential for many mathematical problems. However, their performance on graph algorithmic tasks is still unsatisfying, since graphs are naturally more complex in topology and often require systematic multi-step reasoning, especially on larger graphs. Motivated by this gap, we propose GraphDC, a Divide-and-Conquer multi-agent framework for scalable graph algorithm reasoning. Specifically, inspired by Divide-and-Conquer design, GraphDC decomposes an input graph into smaller subgraphs, assigns each subgraph to a specialized agent for local reasoning, and uses a master agent to integrate the local outputs with inter-subgraph information to produce the final solution. This hierarchical design reduces the reasoning burden on individual agents, alleviates computational bottlenecks, and improves robustness on large graph instances. Extensive experiments show that GraphDC consistently outperfo","title":"GraphDC: A Divide-and-Conquer Multi-Agent System for Scalable Graph Algorithm Reasoning","url":"https://arxiv.org/abs/2605.06671","vendor":"arxiv_cs_ai"},"summary":"arXiv:2605.06671v1 Announce Type: new \nAbstract: Large Language Models (LLMs) have demonstrated strong potential for many mathematical problems. However, their performance on graph algorithmic tasks is still unsatisfying, since graphs are naturally more complex in topology and often require systematic multi-step reasoning, especially on larger graphs. Motivated by this gap, we propose GraphDC, a Divide-and-Conquer multi-agent framework for scalable graph algorithm reasoning. Specifically, inspired by Divide-and-Conquer design, GraphDC decomposes an input graph into smaller subgraphs, assigns each subgraph to a specialized agent for local reasoning, and uses a master agent to integrate the local outputs with inter-subgraph information to produce the final solution. This hierarchical design reduces the reasoning burden on individual agents, alleviates computational bottlenecks, and improves robustness on large graph instances. Extensive experiments show that GraphDC consistently outperfo","title":"GraphDC: A Divide-and-Conquer Multi-Agent System for Scalable Graph Algorithm Reasoning","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-11T04:43:50Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2605.06671"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:b1defd54bd9ded293fcabce46660e76e813aa6848103e292254c436d34dd705012b303ac19653aa351889ee073a4e688ad5b9c06351da9a5b1a6e6bd87e6d80b","signer":"crovia.substrate","subject":{"observed_at":"2026-05-11T04:43:50Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2605.06671"},"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":"0b1d980217d4a341e7362a1b2423322aa47b5b9e39ca91788532025dc4999899","leaf_index":126262,"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":"c6dc92a784358ae83c3e259bcbd5e5c57ad18a9bb4495eff14510dc051669edb","side":"right"},{"sibling":"58d96a8b9c3c80e7d9e57590a30b37e968fa4f5cef79d534b91f89e96d6fb46d","side":"left"},{"sibling":"88dea61ab93a59a0ec4c3342a3ccc970a31c8f6c0f5f61cf4cfeb691133d286f","side":"left"},{"sibling":"ea0f1ab284e9be47da08161164f959ec5ed24ae4ab712d0fb3e73e7dfa0737d3","side":"right"},{"sibling":"864c69839ce6d1e6304fa385da09bd3be7b0cedbbfb326935de2b134a4fe5372","side":"left"},{"sibling":"d84e77d9c81c6925e72094d9abe43dc7e83c1bb87841b26fc80442b803f28118","side":"left"},{"sibling":"c6a41e89a22d430c6613dc3d443e978bbadd8f0c5f1aa10c7bf40491e3a5b06a","side":"right"},{"sibling":"fd62d742789ec2a4ad0baaf30412885f0f707ff8c8186d2dd2d66fddc87a651a","side":"right"},{"sibling":"d2135da61742c6387f57e5dbeb0f84ba6602653b50838e32a22e26e69c963d0c","side":"left"},{"sibling":"fe7cf0b54f5bf9492865fdc338944ef352cdca1a4f9f377e2991ace599a3bb58","side":"right"},{"sibling":"1a581be91236d1f25e8d47fe5efa0e2b51b7f0f6d706ef76a9093067688e5d56","side":"left"},{"sibling":"878cc30108509c9fa1fc52705a216f519d73b647916fcbdfc30a389934d3364b","side":"left"},{"sibling":"ae7dfff36ba07d9f48c36c28a341482ef244ee13cd0efd49aee2bbef2fd65f87","side":"right"},{"sibling":"62ac6554017807bd83187f5a3e5f4f72d6c482616429c2780e9fff1f4845fa04","side":"left"},{"sibling":"3a5e69cf0803f4c91f3895ed7c9a95748fef240bec4422e167c05300f79f06c0","side":"left"},{"sibling":"f2817ab288b5324fe49770372c7a10f33f7cd11005f8d4c0a730316f5229dc98","side":"left"},{"sibling":"725fac972e772ca0dc598810ea1abc70df472f72d2d6ab8a0baee2b80e5d2f4c","side":"left"},{"sibling":"98fc57dfef8873b512edc8340f7181df57302bb96777625e072235c62d7c5895","side":"right"}]},"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":134292,"merkle_root":"77fc9c28fae777b81da5b495b3115474df6592dfac590333213d3bdf8b94a9b3","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260515T023701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-05-15T02:37:25Z","sig_algorithm":"ed25519","signature":"68107a834b00b24f5d4501e5ec727445311f132a486567ecc4c72a4e6dff24c8c21f2de3105293353ba5fdbe370d032819af6aa70f694e2e39b6af6737507009","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_080ddbdca92deb51a79f6c5a4eee6c19369c69ea9636ec00aed56919fad0cb9f"}}