{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3SPVZ4JRBN7DDFYJN44PFWUOKY","short_pith_number":"pith:3SPVZ4JR","schema_version":"1.0","canonical_sha256":"dc9f5cf1310b7e3197096f38f2da8e5602765c0c6793f1e1a97ecaf93e326926","source":{"kind":"arxiv","id":"1809.00273","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Leader Election: A Chasm at Diameter Two","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gopal Pandurangan, Peter Robinson, Soumyottam Chatterjee","submitted_at":"2018-09-02T00:30:27Z","abstract_excerpt":"This paper focuses on studying the message complexity of implicit leader election in synchronous distributed networks of diameter two. Kutten et al.\\ [JACM 2015] showed a fundamental lower bound of $\\Omega(m)$ ($m$ is the number of edges in the network) on the message complexity of (implicit) leader election that applied also to Monte Carlo randomized algorithms with constant success probability; this lower bound applies for graphs that have diameter at least three. On the other hand, for complete graphs (i.e., graphs with diameter one), Kutten et al.\\ [TCS 2015] established a tight bound of $"},"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":"1809.00273","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-09-02T00:30:27Z","cross_cats_sorted":[],"title_canon_sha256":"2868716b5d76ebe8f1a0d6f95a0ccaa1edb74ccd942c0a1ffa740a07b11dc5dc","abstract_canon_sha256":"fbbbe447e7b3e3d1fb204b15ec417fc887658997f6e38b3394db21724b0e6127"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:35.614407Z","signature_b64":"BfU6aPO5CSkRBeDpHb16o3jpfngXO422RKa/oaasckWBbr4xXCwvAFxH814myuuOleVyyC6O+d67vWiIg2miCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc9f5cf1310b7e3197096f38f2da8e5602765c0c6793f1e1a97ecaf93e326926","last_reissued_at":"2026-05-18T00:06:35.613995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:35.613995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Leader Election: A Chasm at Diameter Two","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gopal Pandurangan, Peter Robinson, Soumyottam Chatterjee","submitted_at":"2018-09-02T00:30:27Z","abstract_excerpt":"This paper focuses on studying the message complexity of implicit leader election in synchronous distributed networks of diameter two. Kutten et al.\\ [JACM 2015] showed a fundamental lower bound of $\\Omega(m)$ ($m$ is the number of edges in the network) on the message complexity of (implicit) leader election that applied also to Monte Carlo randomized algorithms with constant success probability; this lower bound applies for graphs that have diameter at least three. On the other hand, for complete graphs (i.e., graphs with diameter one), Kutten et al.\\ [TCS 2015] established a tight bound of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00273","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":"1809.00273","created_at":"2026-05-18T00:06:35.614054+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.00273v1","created_at":"2026-05-18T00:06:35.614054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00273","created_at":"2026-05-18T00:06:35.614054+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SPVZ4JRBN7D","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SPVZ4JRBN7DDFYJ","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SPVZ4JR","created_at":"2026-05-18T12:32:05.422762+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/3SPVZ4JRBN7DDFYJN44PFWUOKY","json":"https://pith.science/pith/3SPVZ4JRBN7DDFYJN44PFWUOKY.json","graph_json":"https://pith.science/api/pith-number/3SPVZ4JRBN7DDFYJN44PFWUOKY/graph.json","events_json":"https://pith.science/api/pith-number/3SPVZ4JRBN7DDFYJN44PFWUOKY/events.json","paper":"https://pith.science/paper/3SPVZ4JR"},"agent_actions":{"view_html":"https://pith.science/pith/3SPVZ4JRBN7DDFYJN44PFWUOKY","download_json":"https://pith.science/pith/3SPVZ4JRBN7DDFYJN44PFWUOKY.json","view_paper":"https://pith.science/paper/3SPVZ4JR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.00273&json=true","fetch_graph":"https://pith.science/api/pith-number/3SPVZ4JRBN7DDFYJN44PFWUOKY/graph.json","fetch_events":"https://pith.science/api/pith-number/3SPVZ4JRBN7DDFYJN44PFWUOKY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SPVZ4JRBN7DDFYJN44PFWUOKY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SPVZ4JRBN7DDFYJN44PFWUOKY/action/storage_attestation","attest_author":"https://pith.science/pith/3SPVZ4JRBN7DDFYJN44PFWUOKY/action/author_attestation","sign_citation":"https://pith.science/pith/3SPVZ4JRBN7DDFYJN44PFWUOKY/action/citation_signature","submit_replication":"https://pith.science/pith/3SPVZ4JRBN7DDFYJN44PFWUOKY/action/replication_record"}},"created_at":"2026-05-18T00:06:35.614054+00:00","updated_at":"2026-05-18T00:06:35.614054+00:00"}