{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7G2RQ2IQDPXVJF6QP6OZD4K2SH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cfd05f0a78b0bf80fd8ef693eefc77955d304d5ee33e4be64f698bf56191d6bd","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-26T10:37:23Z","title_canon_sha256":"f5fbfe31add8182a607335e616288d0f4eaf080980ca68766c068ff91b208f8a"},"schema_version":"1.0","source":{"id":"2602.22847","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.22847","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"arxiv_version","alias_value":"2602.22847v2","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.22847","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"pith_short_12","alias_value":"7G2RQ2IQDPXV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"7G2RQ2IQDPXVJF6Q","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"7G2RQ2IQ","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:170d57cc3ed6575f439c9ad695107ec27c028092a8dc3b55e869db90bd105df5","target":"graph","created_at":"2026-05-18T02:44:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The approach proposed and analyzed here relies on the robustness guarantees offered by random gossip communication, which allows autonomous agents to compute a global ranking consensus using local interactions only, without coordination or a central authority."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That standard random gossip convergence properties for scalar statistics extend directly to the non-convex, discrete setting of ranking aggregation while preserving robustness guarantees against node corruption."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A gossip protocol lets network agents reach consensus on collective rankings using only local exchanges, with proven convergence and resilience to bad nodes."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Autonomous agents reach a global ranking consensus from distributed preferences using only local random gossip interactions, without any central coordinator."}],"snapshot_sha256":"a660dbe22dfc508a9c808bdfa9013474a4610f5d58923e627d5853d69b1e65da"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"6c57dac7da44ca9c6751c899a6bdb08efae6fe2ef0641add6d35e6a03ecc86bb"},"paper":{"abstract_excerpt":"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 contaminatio","authors_text":"Anna van Elst, Igor Colin, Kerrian Le Caillec, Stephan Cl\\'emen\\c{c}on","cross_cats":["cs.AI","stat.ML"],"headline":"Autonomous agents reach a global ranking consensus from distributed preferences using only local random gossip interactions, without any central coordinator.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-26T10:37:23Z","title":"Decentralized Ranking Aggregation via Gossip: Convergence and Robustness"},"references":{"count":29,"internal_anchors":1,"resolved_work":29,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Leonidas Akritidis, Miltiadis Alamaniotis, and Panayiotis Bozanis, ‘Flagr: A flexible high-performance library for rank aggregation’,Soft- wareX,21, (2023)","work_id":"c309202c-844a-4a7f-a0ac-934645b185ce","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Kenneth J Arrow, ‘Social choice and individual values.’,Cowles Mono- graph No. 12, (1951)","work_id":"a2896952-4611-4e74-b975-72475ef4cb14","year":1951},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Lyes Badis, Mourad Amad, Djamil A¨ıssani, and Sofiane Abbar, ‘P2pcf: A collaborative filtering based recommender system for peer to peer social networks’,Journal of High Speed Networks,27(1), 13–31, (","work_id":"22fa235d-ef98-4093-bb40-8a369b752ba1","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Linas Baltrunas, Tadas Makcinskas, and Francesco Ricci, ‘Group rec- ommendations with rank aggregation and collaborative filtering’, inPro- ceedings of the 4th ACM conference on Recommender systems, (","work_id":"bca1a688-0c36-48d6-9260-d21351d3f5be","year":2010},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Jean-Charles de Borda, ‘M´emoire sur les ´elections au scrutin’,Histoire de l’Acad´emie Royale des Sciences, (1781)","work_id":"a4463113-d04a-452a-b095-d60e021ee695","year":null}],"snapshot_sha256":"66dc6ed6d30f6969580b457208c52dddd53e125806dd83b17610b36cf3b96443"},"source":{"id":"2602.22847","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-15T18:58:29.745360Z","id":"e3dce3a2-4c51-4fe8-8f7b-e801da5f07e5","model_set":{"reader":"grok-4.3"},"one_line_summary":"A gossip protocol lets network agents reach consensus on collective rankings using only local exchanges, with proven convergence and resilience to bad nodes.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Autonomous agents reach a global ranking consensus from distributed preferences using only local random gossip interactions, without any central coordinator.","strongest_claim":"The approach proposed and analyzed here relies on the robustness guarantees offered by random gossip communication, which allows autonomous agents to compute a global ranking consensus using local interactions only, without coordination or a central authority.","weakest_assumption":"That standard random gossip convergence properties for scalar statistics extend directly to the non-convex, discrete setting of ranking aggregation while preserving robustness guarantees against node corruption."}},"verdict_id":"e3dce3a2-4c51-4fe8-8f7b-e801da5f07e5"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d360ad8f1d070e872a92486289114f462e5b436eb61da60a90ba01771d6851c1","target":"record","created_at":"2026-05-18T02:44:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cfd05f0a78b0bf80fd8ef693eefc77955d304d5ee33e4be64f698bf56191d6bd","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-02-26T10:37:23Z","title_canon_sha256":"f5fbfe31add8182a607335e616288d0f4eaf080980ca68766c068ff91b208f8a"},"schema_version":"1.0","source":{"id":"2602.22847","kind":"arxiv","version":2}},"canonical_sha256":"f9b51869101bef5497d07f9d91f15a91f76e467ca6d8da7acc384da01714f00e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9b51869101bef5497d07f9d91f15a91f76e467ca6d8da7acc384da01714f00e","first_computed_at":"2026-05-18T02:44:31.006257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:31.006257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Oy+oMHTT/Io7Lwe3NroW53YDjuPk2GX20nv9YLHd7baXIRw9vXwoJv1fbRh0lMBC9KUU73rXq3J3PB5/igEUAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:31.006800Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.22847","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d360ad8f1d070e872a92486289114f462e5b436eb61da60a90ba01771d6851c1","sha256:170d57cc3ed6575f439c9ad695107ec27c028092a8dc3b55e869db90bd105df5"],"state_sha256":"0aab6f36396d2ea454bf84d228f09aa4aad3f59c8e2963a372ff67e4bac3fe2a"}