{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4BBASTGJUOGMF4D2YXGDRQK3LP","short_pith_number":"pith:4BBASTGJ","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"},"canonical_sha256":"e042094cc9a38cc2f07ac5cc38c15b5bca8c7281fc2d28eb92f553cc617a83e9","source":{"kind":"arxiv","id":"1411.1319","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1319","created_at":"2026-05-18T02:38:30Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1319v1","created_at":"2026-05-18T02:38:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1319","created_at":"2026-05-18T02:38:30Z"},{"alias_kind":"pith_short_12","alias_value":"4BBASTGJUOGM","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4BBASTGJUOGMF4D2","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4BBASTGJ","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4BBASTGJUOGMF4D2YXGDRQK3LP","target":"record","payload":{"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"},"canonical_sha256":"e042094cc9a38cc2f07ac5cc38c15b5bca8c7281fc2d28eb92f553cc617a83e9","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"},"source_kind":"arxiv","source_id":"1411.1319","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:38:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZqz6FahmO7b7+wC/yYzQ36OO0OnFHa61W0sKTwM+Vv8zvrzsZBFNJtY6mXiPhlygAgN5xVKYlSzaQSk73XLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:55:35.760065Z"},"content_sha256":"24b8b559cd10d33a5356afbb57d04198adda069515644187326526ce3d4e5e44","schema_version":"1.0","event_id":"sha256:24b8b559cd10d33a5356afbb57d04198adda069515644187326526ce3d4e5e44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4BBASTGJUOGMF4D2YXGDRQK3LP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:38:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HkpEklyWY1PhX8NXaDMFT2vWFeyGAHoCRv1uL/bq7bd6JfDUS158JYkWOtzVFx55I4OR9Ov8jKv16GUPvCUjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:55:35.760429Z"},"content_sha256":"fb07707670d495cc3e7afac0df606ad922fee868f0b666fb0ca8db2fd2c7df45","schema_version":"1.0","event_id":"sha256:fb07707670d495cc3e7afac0df606ad922fee868f0b666fb0ca8db2fd2c7df45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4BBASTGJUOGMF4D2YXGDRQK3LP/bundle.json","state_url":"https://pith.science/pith/4BBASTGJUOGMF4D2YXGDRQK3LP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4BBASTGJUOGMF4D2YXGDRQK3LP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T10:55:35Z","links":{"resolver":"https://pith.science/pith/4BBASTGJUOGMF4D2YXGDRQK3LP","bundle":"https://pith.science/pith/4BBASTGJUOGMF4D2YXGDRQK3LP/bundle.json","state":"https://pith.science/pith/4BBASTGJUOGMF4D2YXGDRQK3LP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4BBASTGJUOGMF4D2YXGDRQK3LP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4BBASTGJUOGMF4D2YXGDRQK3LP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aee57a27c09a878a1d853c426842f133a0a8ff32afeeeec1286af0e64d9e4ccd","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-05T16:48:34Z","title_canon_sha256":"11c9c8f56ccea75ad6e8c8be91af6b42e94d53cc5d23470e236bf6dd0abf487b"},"schema_version":"1.0","source":{"id":"1411.1319","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1319","created_at":"2026-05-18T02:38:30Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1319v1","created_at":"2026-05-18T02:38:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1319","created_at":"2026-05-18T02:38:30Z"},{"alias_kind":"pith_short_12","alias_value":"4BBASTGJUOGM","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4BBASTGJUOGMF4D2","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4BBASTGJ","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:fb07707670d495cc3e7afac0df606ad922fee868f0b666fb0ca8db2fd2c7df45","target":"graph","created_at":"2026-05-18T02:38:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Andrzej Pelc, Avery Miller","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-05T16:48:34Z","title":"Election vs. Selection: Two Ways of Finding the Largest Node in a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1319","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:24b8b559cd10d33a5356afbb57d04198adda069515644187326526ce3d4e5e44","target":"record","created_at":"2026-05-18T02:38:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aee57a27c09a878a1d853c426842f133a0a8ff32afeeeec1286af0e64d9e4ccd","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-05T16:48:34Z","title_canon_sha256":"11c9c8f56ccea75ad6e8c8be91af6b42e94d53cc5d23470e236bf6dd0abf487b"},"schema_version":"1.0","source":{"id":"1411.1319","kind":"arxiv","version":1}},"canonical_sha256":"e042094cc9a38cc2f07ac5cc38c15b5bca8c7281fc2d28eb92f553cc617a83e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e042094cc9a38cc2f07ac5cc38c15b5bca8c7281fc2d28eb92f553cc617a83e9","first_computed_at":"2026-05-18T02:38:30.322588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:30.322588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ToRJDIek9yTtkaRIT3FV+rX0pn2M5M5+fuiKuLSXQozxa4VVIQvXQie34JHEqvmAM5bZ7bPaOG/67qc0Y1zhBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:30.323212Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.1319","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24b8b559cd10d33a5356afbb57d04198adda069515644187326526ce3d4e5e44","sha256:fb07707670d495cc3e7afac0df606ad922fee868f0b666fb0ca8db2fd2c7df45"],"state_sha256":"e0444880659472bee719b0ddb771c0c31b4ffbdbe0dfd92bcf33af91dbedc69c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bw9QvCOY+hCXSpC9oEj0IEYaf9Uy74uYXfV7kK0CjIQjdtCFepXNy5vu/BnVdqv7cC+ULfBcKGztgUsIyZorBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T10:55:35.762437Z","bundle_sha256":"1c60b67cf085a2ac1cd8cc995e5db6f41c1ecb2ac928ef1ad55d11fbf0e91d4c"}}