{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IVNXXICEBQVWCKDQLFUARAGXKW","short_pith_number":"pith:IVNXXICE","schema_version":"1.0","canonical_sha256":"455b7ba0440c2b61287059680880d755b36860ff6f90162d787af98a7a10ae2d","source":{"kind":"arxiv","id":"2605.19131","version":1},"attestation_state":"computed","paper":{"title":"Limit Laws for Consensus Protocols on the Complete Graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Julian Becker, Konstantinos Panagiotou","submitted_at":"2026-05-18T21:31:12Z","abstract_excerpt":"We study a distributed consensus problem on a complete communication network of $n$ vertices, each holding one of two opinions. The vertices communicate in rounds, possibly in the presence of adversarial noise, and exchange information until they all agree on a single opinion. We consider a general class of protocols, where the vertices randomly sample neighbors and update their own opinion according to an update function $f$ depending on the sampled opinions. A prominent example is the $k$-maj protocol, where every vertex adopts the majority opinion of $k$ randomly sampled neighbors.\n  We con"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.19131","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T21:31:12Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"74a861f4a13df01ff79b94204b719f2a24a8e46b46a6478a4354f4a0018e3375","abstract_canon_sha256":"f3cc8b509a8f4d5c2b9e265e0b1c4abaa69037305f98ec303f6cc2220a5da431"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:28.784118Z","signature_b64":"zDtgBAhxu0RLYneX9T2LhTZyX3kwG4r9jR54OjKBFnocd9J+HJjK5eMhJA1naf8CnTe+Qdgvw0uuic7KZc91Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"455b7ba0440c2b61287059680880d755b36860ff6f90162d787af98a7a10ae2d","last_reissued_at":"2026-05-20T01:05:28.783378Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:28.783378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Limit Laws for Consensus Protocols on the Complete Graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Julian Becker, Konstantinos Panagiotou","submitted_at":"2026-05-18T21:31:12Z","abstract_excerpt":"We study a distributed consensus problem on a complete communication network of $n$ vertices, each holding one of two opinions. The vertices communicate in rounds, possibly in the presence of adversarial noise, and exchange information until they all agree on a single opinion. We consider a general class of protocols, where the vertices randomly sample neighbors and update their own opinion according to an update function $f$ depending on the sampled opinions. A prominent example is the $k$-maj protocol, where every vertex adopts the majority opinion of $k$ randomly sampled neighbors.\n  We con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19131","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.19131/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.19131","created_at":"2026-05-20T01:05:28.783513+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19131v1","created_at":"2026-05-20T01:05:28.783513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19131","created_at":"2026-05-20T01:05:28.783513+00:00"},{"alias_kind":"pith_short_12","alias_value":"IVNXXICEBQVW","created_at":"2026-05-20T01:05:28.783513+00:00"},{"alias_kind":"pith_short_16","alias_value":"IVNXXICEBQVWCKDQ","created_at":"2026-05-20T01:05:28.783513+00:00"},{"alias_kind":"pith_short_8","alias_value":"IVNXXICE","created_at":"2026-05-20T01:05:28.783513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IVNXXICEBQVWCKDQLFUARAGXKW","json":"https://pith.science/pith/IVNXXICEBQVWCKDQLFUARAGXKW.json","graph_json":"https://pith.science/api/pith-number/IVNXXICEBQVWCKDQLFUARAGXKW/graph.json","events_json":"https://pith.science/api/pith-number/IVNXXICEBQVWCKDQLFUARAGXKW/events.json","paper":"https://pith.science/paper/IVNXXICE"},"agent_actions":{"view_html":"https://pith.science/pith/IVNXXICEBQVWCKDQLFUARAGXKW","download_json":"https://pith.science/pith/IVNXXICEBQVWCKDQLFUARAGXKW.json","view_paper":"https://pith.science/paper/IVNXXICE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19131&json=true","fetch_graph":"https://pith.science/api/pith-number/IVNXXICEBQVWCKDQLFUARAGXKW/graph.json","fetch_events":"https://pith.science/api/pith-number/IVNXXICEBQVWCKDQLFUARAGXKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IVNXXICEBQVWCKDQLFUARAGXKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IVNXXICEBQVWCKDQLFUARAGXKW/action/storage_attestation","attest_author":"https://pith.science/pith/IVNXXICEBQVWCKDQLFUARAGXKW/action/author_attestation","sign_citation":"https://pith.science/pith/IVNXXICEBQVWCKDQLFUARAGXKW/action/citation_signature","submit_replication":"https://pith.science/pith/IVNXXICEBQVWCKDQLFUARAGXKW/action/replication_record"}},"created_at":"2026-05-20T01:05:28.783513+00:00","updated_at":"2026-05-20T01:05:28.783513+00:00"}