{"_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_05e04f8c709b9fa5ed4c6b0741c46e28a692da7b26733b9494842821b347c8e8","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_05e04f8c709b9fa5ed4c6b0741c46e28a692da7b26733b9494842821b347c8e8","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"2780e2b31b5fd3e1090ceb758090c0759e125bb390eb59a4a2f1851a2943875b","published":"Fri, 08 May 2026 00:00:00 -0400","receipt_hash":"2780e2b31b5fd3e1090ceb758090c0759e125bb390eb59a4a2f1851a2943875b","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":"2780e2b31b5fd3e1090ceb758090c0759e125bb390eb59a4a2f1851a2943875b","observed_at":"2026-05-08T04:43:40.537619Z","parent_run_hash":"9837a17a0d4866b3bef2929e933ca29d96f4bd9656766df36f8260d720835b95","published":"Fri, 08 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.05703v1 Announce Type: cross \nAbstract: Optimizing the communication structure of large language model based multi-agent systems (LLM-MAS) has been shown to improve downstream performance and reduce token usage. Existing methods typically rely on randomly sampled training tasks. However, tasks may differ substantially in difficulty and domain, and thus they are not equally informative for updating communication structure, making optimization under limited training budgets often unstable and highly sensitive to the particular training set. To actively identify the most valuable tasks for communication-structure optimization, we propose an ensemble-based information-theoretic task selection framework. The proposed method estimates task informativeness by how much a candidate task changes the distribution over graph parameters, using ensemble Kalman inversion as an efficient and derivative-free approximation of the corresponding Bayesian update. The resulting estimator is espec","title":"Active Learning for Communication Structure Optimization in LLM-Based Multi-Agent Systems","url":"https://arxiv.org/abs/2605.05703","vendor":"arxiv_cs_ai"},"summary":"arXiv:2605.05703v1 Announce Type: cross \nAbstract: Optimizing the communication structure of large language model based multi-agent systems (LLM-MAS) has been shown to improve downstream performance and reduce token usage. Existing methods typically rely on randomly sampled training tasks. However, tasks may differ substantially in difficulty and domain, and thus they are not equally informative for updating communication structure, making optimization under limited training budgets often unstable and highly sensitive to the particular training set. To actively identify the most valuable tasks for communication-structure optimization, we propose an ensemble-based information-theoretic task selection framework. The proposed method estimates task informativeness by how much a candidate task changes the distribution over graph parameters, using ensemble Kalman inversion as an efficient and derivative-free approximation of the corresponding Bayesian update. The resulting estimator is espec","title":"Active Learning for Communication Structure Optimization in LLM-Based Multi-Agent Systems","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-08T04:43:40Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2605.05703"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:4da83ea2296aa82e526cbab4a7eaea02f100f33a3497e9af2d291bd63224caa036f268cb7a182081a8c6269cc1ad86957b86620b6400393d9a58dfd6e2c03b07","signer":"crovia.substrate","subject":{"observed_at":"2026-05-08T04:43:40Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2605.05703"},"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":"b868ce04dc762d11927809e3fa28b780bccf8e792dfbbb14ed7bc75880e44fc2","leaf_index":120217,"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":"6e82dca09692edb27bf89ab531220bfbe23d56751ae4de93c2fa4dec22d1f3ef","side":"left"},{"sibling":"4b5eb11d3375c0c022c3244aaa09e92c30e5968bf1e505f64b3df56474b85b72","side":"right"},{"sibling":"c6207e178160b4070e07a33545dab17fe1644d96b64d5f041078ee9f3a558ee0","side":"right"},{"sibling":"6fb724f148fbcef93aa65c366e1c89e8ff5cd707f34d687e3d2ba233cb04813d","side":"left"},{"sibling":"8ad5035b8628a0446691fce68cf6395904bc652ea79d92248166c86d429b573e","side":"left"},{"sibling":"0ae5581916af0a1caf4a23562a98b60e3c3304667b62f3641d159b738d16cd3a","side":"right"},{"sibling":"bd2a20faaa0d5551ef6fee47062ec5603912f58f4e9c0a4eede0c4173f993f58","side":"right"},{"sibling":"6f9fbeeae57a07a1aca1b75e07f4ae2c8f837e9a25cd31813866783835b2d912","side":"left"},{"sibling":"34e93c6f591cc4fb93a4c29771210eb73573b454d2c5329963f437f1309fe46f","side":"left"},{"sibling":"b9834433f5bd1deeaab4ced2b3bcc0d91d19763a5d0981fb299d124b63459eb3","side":"right"},{"sibling":"143f33d3924b3840fd6dd8ba12566fc35bf86189e663ef0ad4884d676f295e3a","side":"left"},{"sibling":"b1ed99341c327c7c9ab2489f40af2547ab3b3b4b6a74fb684210164fb891a413","side":"right"},{"sibling":"6ee3be9bdfc9bee55d32f7dbb0075f02fe87d20887d563d3e300caf36b1b88c7","side":"left"},{"sibling":"8ccd9937a2c0d5c04044d07d1557791b7d07bb31eac41a39a675608d44b38f23","side":"right"},{"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_05e04f8c709b9fa5ed4c6b0741c46e28a692da7b26733b9494842821b347c8e8"}}