{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4BBASTGJUOGMF4D2YXGDRQK3LP","short_pith_number":"pith:4BBASTGJ","schema_version":"1.0","canonical_sha256":"e042094cc9a38cc2f07ac5cc38c15b5bca8c7281fc2d28eb92f553cc617a83e9","source":{"kind":"arxiv","id":"1411.1319","version":1},"attestation_state":"computed","paper":{"title":"Election vs. Selection: Two Ways of Finding the Largest Node in a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Andrzej Pelc, Avery Miller","submitted_at":"2014-11-05T16:48:34Z","abstract_excerpt":"Finding the node with the largest label in a network, modeled as an undirected connected graph, is one of the fundamental problems in distributed computing. This is the way in which $\\textit{leader election}$ is usually solved. We consider two distinct tasks in which the largest-labeled node is found deterministically. In $\\textit{selection}$, this node must output 1 and all other nodes must output 0. In $\\textit{election}$, the other nodes must additionally learn the largest label. Our aim is to compare the difficulty of these two tasks executed under stringent running time constraints. The m"},"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":"1411.1319","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-05T16:48:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"11c9c8f56ccea75ad6e8c8be91af6b42e94d53cc5d23470e236bf6dd0abf487b","abstract_canon_sha256":"aee57a27c09a878a1d853c426842f133a0a8ff32afeeeec1286af0e64d9e4ccd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:30.323212Z","signature_b64":"ToRJDIek9yTtkaRIT3FV+rX0pn2M5M5+fuiKuLSXQozxa4VVIQvXQie34JHEqvmAM5bZ7bPaOG/67qc0Y1zhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e042094cc9a38cc2f07ac5cc38c15b5bca8c7281fc2d28eb92f553cc617a83e9","last_reissued_at":"2026-05-18T02:38:30.322588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:30.322588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Election vs. Selection: Two Ways of Finding the Largest Node in a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Andrzej Pelc, Avery Miller","submitted_at":"2014-11-05T16:48:34Z","abstract_excerpt":"Finding the node with the largest label in a network, modeled as an undirected connected graph, is one of the fundamental problems in distributed computing. This is the way in which $\\textit{leader election}$ is usually solved. We consider two distinct tasks in which the largest-labeled node is found deterministically. In $\\textit{selection}$, this node must output 1 and all other nodes must output 0. In $\\textit{election}$, the other nodes must additionally learn the largest label. Our aim is to compare the difficulty of these two tasks executed under stringent running time constraints. The m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1319","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":"1411.1319","created_at":"2026-05-18T02:38:30.322678+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1319v1","created_at":"2026-05-18T02:38:30.322678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1319","created_at":"2026-05-18T02:38:30.322678+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BBASTGJUOGM","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BBASTGJUOGMF4D2","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BBASTGJ","created_at":"2026-05-18T12:28:14.216126+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/4BBASTGJUOGMF4D2YXGDRQK3LP","json":"https://pith.science/pith/4BBASTGJUOGMF4D2YXGDRQK3LP.json","graph_json":"https://pith.science/api/pith-number/4BBASTGJUOGMF4D2YXGDRQK3LP/graph.json","events_json":"https://pith.science/api/pith-number/4BBASTGJUOGMF4D2YXGDRQK3LP/events.json","paper":"https://pith.science/paper/4BBASTGJ"},"agent_actions":{"view_html":"https://pith.science/pith/4BBASTGJUOGMF4D2YXGDRQK3LP","download_json":"https://pith.science/pith/4BBASTGJUOGMF4D2YXGDRQK3LP.json","view_paper":"https://pith.science/paper/4BBASTGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1319&json=true","fetch_graph":"https://pith.science/api/pith-number/4BBASTGJUOGMF4D2YXGDRQK3LP/graph.json","fetch_events":"https://pith.science/api/pith-number/4BBASTGJUOGMF4D2YXGDRQK3LP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BBASTGJUOGMF4D2YXGDRQK3LP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BBASTGJUOGMF4D2YXGDRQK3LP/action/storage_attestation","attest_author":"https://pith.science/pith/4BBASTGJUOGMF4D2YXGDRQK3LP/action/author_attestation","sign_citation":"https://pith.science/pith/4BBASTGJUOGMF4D2YXGDRQK3LP/action/citation_signature","submit_replication":"https://pith.science/pith/4BBASTGJUOGMF4D2YXGDRQK3LP/action/replication_record"}},"created_at":"2026-05-18T02:38:30.322678+00:00","updated_at":"2026-05-18T02:38:30.322678+00:00"}