{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DMZLEXM27XNH457GG2BRFYSXFZ","short_pith_number":"pith:DMZLEXM2","canonical_record":{"source":{"id":"1411.1001","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-04T18:57:28Z","cross_cats_sorted":[],"title_canon_sha256":"bc87d3d2fb2d36716815cd4889a91eae2b6c1a06b41bf7cd5c9f8eb427c6723d","abstract_canon_sha256":"cf6be3d3ca511272782e58589afa9ca438501a87980845dd1a1ebabffb78ea19"},"schema_version":"1.0"},"canonical_sha256":"1b32b25d9afdda7e77e6368312e2572e4e304304488f637374328f96da25b1f0","source":{"kind":"arxiv","id":"1411.1001","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1001","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1001v2","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1001","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"DMZLEXM27XNH","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DMZLEXM27XNH457G","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DMZLEXM2","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DMZLEXM27XNH457GG2BRFYSXFZ","target":"record","payload":{"canonical_record":{"source":{"id":"1411.1001","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-04T18:57:28Z","cross_cats_sorted":[],"title_canon_sha256":"bc87d3d2fb2d36716815cd4889a91eae2b6c1a06b41bf7cd5c9f8eb427c6723d","abstract_canon_sha256":"cf6be3d3ca511272782e58589afa9ca438501a87980845dd1a1ebabffb78ea19"},"schema_version":"1.0"},"canonical_sha256":"1b32b25d9afdda7e77e6368312e2572e4e304304488f637374328f96da25b1f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:05.130692Z","signature_b64":"4mCZtvHWlfkfU6Be2TG5iSgUXZyhM+czhSF3ZLbOWE6CmBgxQA0oMMZCTLk/0pTMBzZkkWwiVj+sHW8SkD0YBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b32b25d9afdda7e77e6368312e2572e4e304304488f637374328f96da25b1f0","last_reissued_at":"2026-05-18T02:27:05.130273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:05.130273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.1001","source_version":2,"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:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LmzzpRq+gDkRGqg+qOiICN5dUOs511JgPVHlCPSyHNxvxcysVPLfO2yNlp+ZUMrM5qAsNezk2mUeuO9apzE1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:13:55.545480Z"},"content_sha256":"8e68dd91561d90c21f51e8ec3ca2c418fb07c332c7f35c150d295c82adf3617d","schema_version":"1.0","event_id":"sha256:8e68dd91561d90c21f51e8ec3ca2c418fb07c332c7f35c150d295c82adf3617d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DMZLEXM27XNH457GG2BRFYSXFZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to Elect a Leader Faster than a Tournament","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Adrian Vladu, Dan Alistarh, Rati Gelashvili","submitted_at":"2014-11-04T18:57:28Z","abstract_excerpt":"The problem of electing a leader from among $n$ contenders is one of the fundamental questions in distributed computing. In its simplest formulation, the task is as follows: given $n$ processors, all participants must eventually return a win or lose indication, such that a single contender may win. Despite a considerable amount of work on leader election, the following question is still open: can we elect a leader in an asynchronous fault-prone system faster than just running a $\\Theta(\\log n)$-time tournament, against a strong adaptive adversary?\n  In this paper, we answer this question in th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1001","kind":"arxiv","version":2},"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:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZFmYvIANR5vxOEExqrFJeDnIDOeSEDOzTgOGbYikUgJaIHLjY/rBSyDy/e/20gNyiCG3msYT7xDyHHb/1Ie1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:13:55.545833Z"},"content_sha256":"eea3e0f128130b8f617e389439373c30525979ee4857bbef611da7b44e2c9cc3","schema_version":"1.0","event_id":"sha256:eea3e0f128130b8f617e389439373c30525979ee4857bbef611da7b44e2c9cc3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMZLEXM27XNH457GG2BRFYSXFZ/bundle.json","state_url":"https://pith.science/pith/DMZLEXM27XNH457GG2BRFYSXFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMZLEXM27XNH457GG2BRFYSXFZ/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-03T02:13:55Z","links":{"resolver":"https://pith.science/pith/DMZLEXM27XNH457GG2BRFYSXFZ","bundle":"https://pith.science/pith/DMZLEXM27XNH457GG2BRFYSXFZ/bundle.json","state":"https://pith.science/pith/DMZLEXM27XNH457GG2BRFYSXFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMZLEXM27XNH457GG2BRFYSXFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DMZLEXM27XNH457GG2BRFYSXFZ","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":"cf6be3d3ca511272782e58589afa9ca438501a87980845dd1a1ebabffb78ea19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-04T18:57:28Z","title_canon_sha256":"bc87d3d2fb2d36716815cd4889a91eae2b6c1a06b41bf7cd5c9f8eb427c6723d"},"schema_version":"1.0","source":{"id":"1411.1001","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1001","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1001v2","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1001","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"DMZLEXM27XNH","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DMZLEXM27XNH457G","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DMZLEXM2","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:eea3e0f128130b8f617e389439373c30525979ee4857bbef611da7b44e2c9cc3","target":"graph","created_at":"2026-05-18T02:27:05Z","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":"The problem of electing a leader from among $n$ contenders is one of the fundamental questions in distributed computing. In its simplest formulation, the task is as follows: given $n$ processors, all participants must eventually return a win or lose indication, such that a single contender may win. Despite a considerable amount of work on leader election, the following question is still open: can we elect a leader in an asynchronous fault-prone system faster than just running a $\\Theta(\\log n)$-time tournament, against a strong adaptive adversary?\n  In this paper, we answer this question in th","authors_text":"Adrian Vladu, Dan Alistarh, Rati Gelashvili","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-04T18:57:28Z","title":"How to Elect a Leader Faster than a Tournament"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1001","kind":"arxiv","version":2},"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:8e68dd91561d90c21f51e8ec3ca2c418fb07c332c7f35c150d295c82adf3617d","target":"record","created_at":"2026-05-18T02:27:05Z","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":"cf6be3d3ca511272782e58589afa9ca438501a87980845dd1a1ebabffb78ea19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-11-04T18:57:28Z","title_canon_sha256":"bc87d3d2fb2d36716815cd4889a91eae2b6c1a06b41bf7cd5c9f8eb427c6723d"},"schema_version":"1.0","source":{"id":"1411.1001","kind":"arxiv","version":2}},"canonical_sha256":"1b32b25d9afdda7e77e6368312e2572e4e304304488f637374328f96da25b1f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b32b25d9afdda7e77e6368312e2572e4e304304488f637374328f96da25b1f0","first_computed_at":"2026-05-18T02:27:05.130273Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:05.130273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4mCZtvHWlfkfU6Be2TG5iSgUXZyhM+czhSF3ZLbOWE6CmBgxQA0oMMZCTLk/0pTMBzZkkWwiVj+sHW8SkD0YBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:05.130692Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.1001","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e68dd91561d90c21f51e8ec3ca2c418fb07c332c7f35c150d295c82adf3617d","sha256:eea3e0f128130b8f617e389439373c30525979ee4857bbef611da7b44e2c9cc3"],"state_sha256":"89033b360c4fabf09bfb860f06c18bd8f5de984a7253027ca2c86a98ff008646"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1A4AJb4VbsWeKMp4jHMP95qIG43FH/lzYYqssM4PMSZ5tiCqW2TkVn1qA9eahT42/Fyg3GRocD7hD7RZ1EtdDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:13:55.547875Z","bundle_sha256":"2c9d1efd2f386bb0e43c7506318601fcab5634413572dd02298b0d81e5f68e9e"}}