{"_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_51a55c0509101aed17cfeef5154299a5e78748d6a133038ebb130bdbec484154","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_51a55c0509101aed17cfeef5154299a5e78748d6a133038ebb130bdbec484154","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"6b61295038f09113bdbd0b82e77a664801a402fece5f775d75b7ea8185987dd9","published":"Tue, 21 Jul 2026 00:00:00 -0400","receipt_hash":"6b61295038f09113bdbd0b82e77a664801a402fece5f775d75b7ea8185987dd9","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":"6b61295038f09113bdbd0b82e77a664801a402fece5f775d75b7ea8185987dd9","observed_at":"2026-07-21T04:43:35.036805Z","parent_run_hash":"03e944014de2697434479833d15ea9303e014945afc230ecc7f207824493b589","published":"Tue, 21 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.17311v1 Announce Type: cross \nAbstract: The problem of fair multi-agent coordination in decentralized settings is one of the most pressing challenges for building efficient collaborative systems. Resource allocation is based on optimized collective arrangements accounting for agents' needs. Such coordination should not only be computationally efficient but also account for fairness, i.e., equitable redistribution of costs incurred by all agents. Recent literature has proposed several algorithms that efficiently determine optimal plan combinations balancing system-wide efficiency and individual discomfort of agents in a centralized setting. However, these works do not address equitable resource optimization in fully decentralized scenarios, specifically, the optimized redistribution of discomfort among coordinating agents so that none experiences a discomfort level that could lead to loss of incentive or polarization that can disrupt planned operations. In this work, we study","title":"The Optimization Trilemma: Efficiency, Comfort and Fairness in Decentralized Multi-agent Coordination","url":"https://arxiv.org/abs/2607.17311","vendor":"arxiv_cs_ai"},"summary":"arXiv:2607.17311v1 Announce Type: cross \nAbstract: The problem of fair multi-agent coordination in decentralized settings is one of the most pressing challenges for building efficient collaborative systems. Resource allocation is based on optimized collective arrangements accounting for agents' needs. Such coordination should not only be computationally efficient but also account for fairness, i.e., equitable redistribution of costs incurred by all agents. Recent literature has proposed several algorithms that efficiently determine optimal plan combinations balancing system-wide efficiency and individual discomfort of agents in a centralized setting. However, these works do not address equitable resource optimization in fully decentralized scenarios, specifically, the optimized redistribution of discomfort among coordinating agents so that none experiences a discomfort level that could lead to loss of incentive or polarization that can disrupt planned operations. In this work, we study","title":"The Optimization Trilemma: Efficiency, Comfort and Fairness in Decentralized Multi-agent Coordination","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-07-21T04:43:35Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2607.17311"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:b670c3906c961e3462e278796f5f66b30eef547548267d8919f8ed39e21f2851379942a247d05e9f5b822efd5aded331a78a29fa3cbcc69efdec3d3cd4386d07","signer":"crovia.substrate","subject":{"observed_at":"2026-07-21T04:43:35Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2607.17311"},"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":"d4b208be52bc3fd305993f7a0c45a01a2553f07daa2f0e3038d3ae6556054ab6","leaf_index":336764,"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":"3f5daf835f1c45c5c17694b9678d38c82fd68e1cebc60cf235d75b93b4e5e6cd","side":"right"},{"sibling":"077fad7530dc2183a21b98ddd3f66f5005528b2d720cc4382ccd95afcec9c736","side":"right"},{"sibling":"0ee94e121d3c5df9ed21df34fcb4e063c7670c66c28e4fc398bfa933ccfc9efb","side":"left"},{"sibling":"6450b4b401ab7f9bd7f71799f79699748e0fad0b709b4686eb6d59f15f9de897","side":"left"},{"sibling":"4b2f046085c15f5820154e0594323133374b97562d1b8776f0b51650988bf0c6","side":"left"},{"sibling":"0f11a14b52dbd7ce194a8ec5a9532d618ad4ab1219f25bbd53b7eae1c8d17760","side":"left"},{"sibling":"c3453c4355287f8f6ea5b33a2f2d95f482fa4ede383b4407cc8d044e332ee8e5","side":"left"},{"sibling":"a4c41a614872a391d764732d35b746845ccfe3f2a51fe13e1f0e934d271e94f4","side":"right"},{"sibling":"bd233cee8c0876447824d86de33608c36e3a8e17dca0737155291ed768cf56d1","side":"left"},{"sibling":"7b927551b5db06b6571913b4e6792ffcce5291a3eca5a0df4a3b6e296271105f","side":"left"},{"sibling":"b77a0b5ae4607c8fe6ba73449d46b35076e3dedc0c82a2c65a05780d42a7bc2e","side":"right"},{"sibling":"9eb5077edfb3dc553857d4794b925bfce117e0f8a1d049af5d0dd9026b470eef","side":"right"},{"sibling":"414b1a70fd1dcb25489a194714b97492b066684b15d0b7a48a176c4b9b5bc713","side":"right"},{"sibling":"21d66dd41003813f710b7617944f1bfba3258658a5d3370c21cad8f9e945bc99","side":"left"},{"sibling":"613f015699131eb89bd755dee67133be95af25cf5f16c1c8ce4b99d963b8dd86","side":"right"},{"sibling":"a729b574b1135956436ded5eef1fe8f08014ff6a0729749d307ab1bca93fcdc9","side":"right"},{"sibling":"77025bcb374a7ad74f520643e20a8ae1205a7ee78507b0beb93117760f1c29d3","side":"left"},{"sibling":"4bf21052e085e8ac81f1dec1d2b310bd12bf948992de6177d12e9d2fda8d39f0","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":337144,"merkle_root":"5e969cc01afa67e4dbe5d37b712cdb10f4aa1fd74404e02eab724cf487c8d6d9","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260721T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-07-21T05:38:38Z","sig_algorithm":"ed25519","signature":"5c0c1a8dd2793d787ccd5e49e8b4d70eed136352555518589f05c74be357fc171702e42a76c3a556d90e3d51ff36cb3d292aaac83c66566de7b943f318bda50c","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_51a55c0509101aed17cfeef5154299a5e78748d6a133038ebb130bdbec484154"}}