{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:S2EB464QPBSTACRYRQPUOE2CEZ","short_pith_number":"pith:S2EB464Q","schema_version":"1.0","canonical_sha256":"96881e7b907865300a388c1f47134226668e8ea206598e3303b7df394f48098b","source":{"kind":"arxiv","id":"1901.00342","version":1},"attestation_state":"computed","paper":{"title":"Leader Election in Well-Connected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Peter Robinson, Seth Gilbert, Suman Sourav","submitted_at":"2019-01-02T12:42:39Z","abstract_excerpt":"In this paper, we look at the problem of randomized leader election in synchronous distributed networks with a special focus on the message complexity. We provide an algorithm that solves the implicit version of leader election (where non-leader nodes need not be aware of the identity of the leader) in any general network with $O(\\sqrt{n} \\log^{7/2} n \\cdot t_{mix})$ messages and in $O(t_{mix}\\log^2 n)$ time, where $n$ is the number of nodes and $t_{mix}$ refers to the mixing time of a random walk in the network graph $G$. For several classes of well-connected networks (that have a large condu"},"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":"1901.00342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-02T12:42:39Z","cross_cats_sorted":[],"title_canon_sha256":"a35fc1ff484fa9c8bf8f23f38ce041c112bfe075c6beb9af30997548b20bb7d0","abstract_canon_sha256":"417849498cfa524a7b87cbb3c17415be1bf26336f39db36a9fe265633a93cf3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:06.297392Z","signature_b64":"xbtCdByCSEF03b/uSobOdLNoTfR+HnRlxq0063PsZhGF5QGDfVWu8JT91MR1UdbyYtU6tuiK+ykm6A2DuED7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96881e7b907865300a388c1f47134226668e8ea206598e3303b7df394f48098b","last_reissued_at":"2026-05-17T23:57:06.296751Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:06.296751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Leader Election in Well-Connected Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Peter Robinson, Seth Gilbert, Suman Sourav","submitted_at":"2019-01-02T12:42:39Z","abstract_excerpt":"In this paper, we look at the problem of randomized leader election in synchronous distributed networks with a special focus on the message complexity. We provide an algorithm that solves the implicit version of leader election (where non-leader nodes need not be aware of the identity of the leader) in any general network with $O(\\sqrt{n} \\log^{7/2} n \\cdot t_{mix})$ messages and in $O(t_{mix}\\log^2 n)$ time, where $n$ is the number of nodes and $t_{mix}$ refers to the mixing time of a random walk in the network graph $G$. For several classes of well-connected networks (that have a large condu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00342","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":""},"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":"1901.00342","created_at":"2026-05-17T23:57:06.296872+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.00342v1","created_at":"2026-05-17T23:57:06.296872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00342","created_at":"2026-05-17T23:57:06.296872+00:00"},{"alias_kind":"pith_short_12","alias_value":"S2EB464QPBST","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"S2EB464QPBSTACRY","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"S2EB464Q","created_at":"2026-05-18T12:33:27.125529+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/S2EB464QPBSTACRYRQPUOE2CEZ","json":"https://pith.science/pith/S2EB464QPBSTACRYRQPUOE2CEZ.json","graph_json":"https://pith.science/api/pith-number/S2EB464QPBSTACRYRQPUOE2CEZ/graph.json","events_json":"https://pith.science/api/pith-number/S2EB464QPBSTACRYRQPUOE2CEZ/events.json","paper":"https://pith.science/paper/S2EB464Q"},"agent_actions":{"view_html":"https://pith.science/pith/S2EB464QPBSTACRYRQPUOE2CEZ","download_json":"https://pith.science/pith/S2EB464QPBSTACRYRQPUOE2CEZ.json","view_paper":"https://pith.science/paper/S2EB464Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.00342&json=true","fetch_graph":"https://pith.science/api/pith-number/S2EB464QPBSTACRYRQPUOE2CEZ/graph.json","fetch_events":"https://pith.science/api/pith-number/S2EB464QPBSTACRYRQPUOE2CEZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S2EB464QPBSTACRYRQPUOE2CEZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S2EB464QPBSTACRYRQPUOE2CEZ/action/storage_attestation","attest_author":"https://pith.science/pith/S2EB464QPBSTACRYRQPUOE2CEZ/action/author_attestation","sign_citation":"https://pith.science/pith/S2EB464QPBSTACRYRQPUOE2CEZ/action/citation_signature","submit_replication":"https://pith.science/pith/S2EB464QPBSTACRYRQPUOE2CEZ/action/replication_record"}},"created_at":"2026-05-17T23:57:06.296872+00:00","updated_at":"2026-05-17T23:57:06.296872+00:00"}