{"_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_a22a5e2f655d02edc74137eca76ec66f38d841c397c76953a6ba1ac43942bb82","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_a22a5e2f655d02edc74137eca76ec66f38d841c397c76953a6ba1ac43942bb82","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"6572726cfe2bf1a5802571fc0b3efc4643091851bd900e3a7ccb60d08167bdc9","published":"Thu, 14 May 2026 00:00:00 -0400","receipt_hash":"6572726cfe2bf1a5802571fc0b3efc4643091851bd900e3a7ccb60d08167bdc9","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":"6572726cfe2bf1a5802571fc0b3efc4643091851bd900e3a7ccb60d08167bdc9","observed_at":"2026-05-14T04:43:36.462865Z","parent_run_hash":"eb105e641aec4518c665fb1a0f748c2a8c8189675990bd4092425661eb7af1d8","published":"Thu, 14 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:2602.22847v2 Announce Type: replace-cross \nAbstract: The concept of ranking aggregation plays a central role in preference analysis, and numerous algorithms for calculating median rankings, often originating in social choice theory, have been documented in the literature, offering theoretical guarantees in a centralized setting, \\textit{i.e.}, when all the ranking data to be aggregated can be brought together in a single computing unit. For many technologies (\\textit{e.g.} peer-to-peer networks, IoT, multi-agent systems), extending the ability to calculate consensus rankings with guarantees of convergence and resilience to potential contamination in a decentralized setting, when preference data is initially distributed across a communicating network, remains a major methodological challenge. Indeed, in recent years, the literature on decentralized computation has mainly focused on computing or optimizing statistics such as arithmetic means using gossip algorithms. The purpose of ","title":"Decentralized Ranking Aggregation via Gossip: Convergence and Robustness","url":"https://arxiv.org/abs/2602.22847","vendor":"arxiv_cs_ai"},"summary":"arXiv:2602.22847v2 Announce Type: replace-cross \nAbstract: The concept of ranking aggregation plays a central role in preference analysis, and numerous algorithms for calculating median rankings, often originating in social choice theory, have been documented in the literature, offering theoretical guarantees in a centralized setting, \\textit{i.e.}, when all the ranking data to be aggregated can be brought together in a single computing unit. For many technologies (\\textit{e.g.} peer-to-peer networks, IoT, multi-agent systems), extending the ability to calculate consensus rankings with guarantees of convergence and resilience to potential contamination in a decentralized setting, when preference data is initially distributed across a communicating network, remains a major methodological challenge. Indeed, in recent years, the literature on decentralized computation has mainly focused on computing or optimizing statistics such as arithmetic means using gossip algorithms. The purpose of ","title":"Decentralized Ranking Aggregation via Gossip: Convergence and Robustness","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-14T04:43:36Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2602.22847"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:cd5d1d144cf63fe9388783ba97e8ff0f5b40f239706f2e9982f4e7a393319633ed2a105116364d910b60ab3ac1c43424bde38d6c784b10bb37516e4e424dd902","signer":"crovia.substrate","subject":{"observed_at":"2026-05-14T04:43:36Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2602.22847"},"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":"ee00e53921506bef62983e1dec02cffdd38296b4dd94c686f5e2a286fccb5123","leaf_index":132794,"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":"f8e4e2e7b1cf4d6fadba8d063145909a699b5caa63f0dd225abcd7f1040e85be","side":"right"},{"sibling":"a1eec14f87f6a83638c86d7646057635647d58805ca879895adb9823a86ad7aa","side":"left"},{"sibling":"876cd1c277e62bd09d6717ddb118980add4f296d3e37b16701b0fa4a02de538d","side":"right"},{"sibling":"1e8299ca26b5445757ca7f2cc4013c2d451c5e8d8155ad1da731292389a118fb","side":"left"},{"sibling":"4c3d66db1f93ba8d22aead8f3b98163b53c43faaa0b5854f698d4797a7f1aa65","side":"left"},{"sibling":"695a4c4d44cd61cced2c94a1e621686058c017437bf0fdcf86516ffa6e66c772","side":"left"},{"sibling":"082bee6702d02c968f73550f57d052606dc8732cddb9a8af38542747b47966a4","side":"right"},{"sibling":"d390ceb521d99fbee195843b8c087d5b6d6b3c13cc9f5d0b36a1c937a84cb77a","side":"left"},{"sibling":"2ae8cbb1d93652ee36f693c3d63e733765fbafcd7765d6d596692bf393ce0a1d","side":"right"},{"sibling":"a957418f640d5dc3181a7628c2646bb86c6da0ea6888670b451e534693a0c7cb","side":"left"},{"sibling":"c03f0a468f574a08ffe8b17e1a17bd88216e1359f0e33a54447e160cd8675da0","side":"left"},{"sibling":"038ff12da6f55509125ef0d96e1e57dda29a2fe63bf03fba2af4cf7cbcd88b36","side":"right"},{"sibling":"b0419206fe62ef216df3900ca93cffd44df267435a4643dda354c1310079cf91","side":"right"},{"sibling":"0d4a9c03674f9d0ce64df15c15e9f656a54b41f93c428aac8e615fda26291956","side":"right"},{"sibling":"7856d920f3f1f1d2194c1ed7351bf0d674440df3cb423a6911f89cb3e9578c0b","side":"right"},{"sibling":"6ac6396bdd2e9df315427a46155531476e7f9012b4bd962e0d2d6d1209b11723","side":"right"},{"sibling":"7c8dc85cbfe43e19ac759ad176cfa11dba2467ae17927c471d5c55663c4f490d","side":"right"},{"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":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_a22a5e2f655d02edc74137eca76ec66f38d841c397c76953a6ba1ac43942bb82"}}