{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:J6A7RNNS6P7ZFLOLWK2ZOPKYX2","short_pith_number":"pith:J6A7RNNS","schema_version":"1.0","canonical_sha256":"4f81f8b5b2f3ff92adcbb2b5973d58be9540fe6c1d9943c5515a3bdf00554169","source":{"kind":"arxiv","id":"1310.2858","version":3},"attestation_state":"computed","paper":{"title":"Simple Dynamics for Plurality Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DM","authors_text":"Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Becchetti, Luca Trevisan, Riccardo Silvestri","submitted_at":"2013-10-10T15:43:04Z","abstract_excerpt":"We study a \\emph{Plurality-Consensus} process in which each of $n$ anonymous agents of a communication network initially supports an opinion (a color chosen from a finite set $[k]$). Then, in every (synchronous) round, each agent can revise his color according to the opinions currently held by a random sample of his neighbors. It is assumed that the initial color configuration exhibits a sufficiently large \\emph{bias} $s$ towards a fixed plurality color, that is, the number of nodes supporting the plurality color exceeds the number of nodes supporting any other color by $s$ additional nodes. T"},"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":"1310.2858","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-10T15:43:04Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"28e7fd67606d691d14f7f25b433697c3fe3499bf5b02aebeb7982e18c3de7c4e","abstract_canon_sha256":"ffccb919b37077b6d0c7fc8231df8158b9ca437e1daeb39e9c9c37f747738dbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:20.987084Z","signature_b64":"5u3vGCrvG/VZSr1bcPZAajROdrZgjprf7Bc/qPLm/1xxTxdKRSnOa/F/2Id8439UPFJtXp9XT6220vm8nVltCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f81f8b5b2f3ff92adcbb2b5973d58be9540fe6c1d9943c5515a3bdf00554169","last_reissued_at":"2026-05-18T01:36:20.986526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:20.986526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple Dynamics for Plurality Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DM","authors_text":"Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Becchetti, Luca Trevisan, Riccardo Silvestri","submitted_at":"2013-10-10T15:43:04Z","abstract_excerpt":"We study a \\emph{Plurality-Consensus} process in which each of $n$ anonymous agents of a communication network initially supports an opinion (a color chosen from a finite set $[k]$). Then, in every (synchronous) round, each agent can revise his color according to the opinions currently held by a random sample of his neighbors. It is assumed that the initial color configuration exhibits a sufficiently large \\emph{bias} $s$ towards a fixed plurality color, that is, the number of nodes supporting the plurality color exceeds the number of nodes supporting any other color by $s$ additional nodes. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2858","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1310.2858","created_at":"2026-05-18T01:36:20.986602+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2858v3","created_at":"2026-05-18T01:36:20.986602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2858","created_at":"2026-05-18T01:36:20.986602+00:00"},{"alias_kind":"pith_short_12","alias_value":"J6A7RNNS6P7Z","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"J6A7RNNS6P7ZFLOL","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"J6A7RNNS","created_at":"2026-05-18T12:27:49.015174+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/J6A7RNNS6P7ZFLOLWK2ZOPKYX2","json":"https://pith.science/pith/J6A7RNNS6P7ZFLOLWK2ZOPKYX2.json","graph_json":"https://pith.science/api/pith-number/J6A7RNNS6P7ZFLOLWK2ZOPKYX2/graph.json","events_json":"https://pith.science/api/pith-number/J6A7RNNS6P7ZFLOLWK2ZOPKYX2/events.json","paper":"https://pith.science/paper/J6A7RNNS"},"agent_actions":{"view_html":"https://pith.science/pith/J6A7RNNS6P7ZFLOLWK2ZOPKYX2","download_json":"https://pith.science/pith/J6A7RNNS6P7ZFLOLWK2ZOPKYX2.json","view_paper":"https://pith.science/paper/J6A7RNNS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2858&json=true","fetch_graph":"https://pith.science/api/pith-number/J6A7RNNS6P7ZFLOLWK2ZOPKYX2/graph.json","fetch_events":"https://pith.science/api/pith-number/J6A7RNNS6P7ZFLOLWK2ZOPKYX2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J6A7RNNS6P7ZFLOLWK2ZOPKYX2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J6A7RNNS6P7ZFLOLWK2ZOPKYX2/action/storage_attestation","attest_author":"https://pith.science/pith/J6A7RNNS6P7ZFLOLWK2ZOPKYX2/action/author_attestation","sign_citation":"https://pith.science/pith/J6A7RNNS6P7ZFLOLWK2ZOPKYX2/action/citation_signature","submit_replication":"https://pith.science/pith/J6A7RNNS6P7ZFLOLWK2ZOPKYX2/action/replication_record"}},"created_at":"2026-05-18T01:36:20.986602+00:00","updated_at":"2026-05-18T01:36:20.986602+00:00"}