Pith Number

pith:7G2RQ2IQ

pith:2026:7G2RQ2IQDPXVJF6QP6OZD4K2SH

not attested not anchored not stored refs resolved

Decentralized Ranking Aggregation via Gossip: Convergence and Robustness

Anna van Elst, Igor Colin, Kerrian Le Caillec, Stephan Cl\'emen\c{c}on

Autonomous agents reach a global ranking consensus from distributed preferences using only local random gossip interactions, without any central coordinator.

arxiv:2602.22847 v2 · 2026-02-26 · cs.LG · cs.AI · stat.ML

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{7G2RQ2IQDPXVJF6QP6OZD4K2SH}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest 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.

C2weakest 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.

C3one 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.

References

29 extracted · 29 resolved · 1 Pith anchors

[1] Leonidas Akritidis, Miltiadis Alamaniotis, and Panayiotis Bozanis, ‘Flagr: A flexible high-performance library for rank aggregation’,Soft- wareX,21, (2023) 2023

[2] Kenneth J Arrow, ‘Social choice and individual values.’,Cowles Mono- graph No. 12, (1951) 1951

[3] 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, ( 2021

[4] 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, ( 2010

[5] Jean-Charles de Borda, ‘M´emoire sur les ´elections au scrutin’,Histoire de l’Acad´emie Royale des Sciences, (1781)

Formal links

2 machine-checked theorem links

Receipt and verification

First computed	2026-05-18T02:44:31.006257Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

f9b51869101bef5497d07f9d91f15a91f76e467ca6d8da7acc384da01714f00e

Aliases

arxiv: 2602.22847 · arxiv_version: 2602.22847v2 · doi: 10.48550/arxiv.2602.22847 · pith_short_12: 7G2RQ2IQDPXV · pith_short_16: 7G2RQ2IQDPXVJF6Q · pith_short_8: 7G2RQ2IQ

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/7G2RQ2IQDPXVJF6QP6OZD4K2SH \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: f9b51869101bef5497d07f9d91f15a91f76e467ca6d8da7acc384da01714f00e

Canonical record JSON

{
  "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
  }
}