{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KBGUNBQH56TIGRJGJPQT3HGB6W","short_pith_number":"pith:KBGUNBQH","canonical_record":{"source":{"id":"1702.03534","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-12T15:46:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"14987a54c7c5be26037bd6a0a849078affb0c22c370951da62f224038577a5b6","abstract_canon_sha256":"bef2496ac351c39af0771a1008705a87e89f831f0c79e03a00af58933fa4393c"},"schema_version":"1.0"},"canonical_sha256":"504d468607efa68345264be13d9cc1f5a686000e92477b3af52361d169b1ffca","source":{"kind":"arxiv","id":"1702.03534","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03534","created_at":"2026-05-18T00:50:35Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03534v1","created_at":"2026-05-18T00:50:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03534","created_at":"2026-05-18T00:50:35Z"},{"alias_kind":"pith_short_12","alias_value":"KBGUNBQH56TI","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KBGUNBQH56TIGRJG","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KBGUNBQH","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KBGUNBQH56TIGRJGJPQT3HGB6W","target":"record","payload":{"canonical_record":{"source":{"id":"1702.03534","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-12T15:46:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"14987a54c7c5be26037bd6a0a849078affb0c22c370951da62f224038577a5b6","abstract_canon_sha256":"bef2496ac351c39af0771a1008705a87e89f831f0c79e03a00af58933fa4393c"},"schema_version":"1.0"},"canonical_sha256":"504d468607efa68345264be13d9cc1f5a686000e92477b3af52361d169b1ffca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:35.034813Z","signature_b64":"/NyPbtlMWgTf9ITVRBXbTeVUX7nieDXZJnAWNpfeNZc6Xl1T0LruKZQyjRUiK2RIwbluhWl0G8Ty4P33nN0rBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"504d468607efa68345264be13d9cc1f5a686000e92477b3af52361d169b1ffca","last_reissued_at":"2026-05-18T00:50:35.034076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:35.034076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.03534","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-18T00:50:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dlb22QblMA4N7WsPMOASBu0w38eftrTMUKxbIDHLtnVkHTUqyEm4h5bVlwkgKMhOmCNBkCAYJ+8tbc4cU7nLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:44:33.992184Z"},"content_sha256":"bbdc2ed5a68c6b7043a92d732ad816f384042b23c2d44746f1f06e17b2ceda55","schema_version":"1.0","event_id":"sha256:bbdc2ed5a68c6b7043a92d732ad816f384042b23c2d44746f1f06e17b2ceda55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KBGUNBQH56TIGRJGJPQT3HGB6W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Leader Election in Trees with Customized Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DC","authors_text":"Andrzej Pelc, Barun Gorain","submitted_at":"2017-02-12T15:46:24Z","abstract_excerpt":"Leader election is a basic symmetry breaking problem in distributed computing. All nodes of a network have to agree on a single node, called the leader. If the nodes of the network have distinct labels, then agreeing on a single node means that all nodes have to output the label of the elected leader.\n  If the nodes are anonymous, the task of leader election is formulated as follows: every node of the network must output a simple path starting at it, which is coded as a sequence of port numbers, such that all these paths end at a common node, the leader. In this paper, we study deterministic l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03534","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-18T00:50:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3nYCDgsXS1OoeEJ4QetajEF6wqgJn6lmiRcobGEgpgqpY5mgrLWwQ/M3VkkwoKpy/YrW4TSYzD7mQmrnlBKgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:44:33.992901Z"},"content_sha256":"c98bfb60c91331bb0e699f7df958f04f25c420237cd4520a832efc20acccb2c0","schema_version":"1.0","event_id":"sha256:c98bfb60c91331bb0e699f7df958f04f25c420237cd4520a832efc20acccb2c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KBGUNBQH56TIGRJGJPQT3HGB6W/bundle.json","state_url":"https://pith.science/pith/KBGUNBQH56TIGRJGJPQT3HGB6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KBGUNBQH56TIGRJGJPQT3HGB6W/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-07T17:44:33Z","links":{"resolver":"https://pith.science/pith/KBGUNBQH56TIGRJGJPQT3HGB6W","bundle":"https://pith.science/pith/KBGUNBQH56TIGRJGJPQT3HGB6W/bundle.json","state":"https://pith.science/pith/KBGUNBQH56TIGRJGJPQT3HGB6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KBGUNBQH56TIGRJGJPQT3HGB6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KBGUNBQH56TIGRJGJPQT3HGB6W","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":"bef2496ac351c39af0771a1008705a87e89f831f0c79e03a00af58933fa4393c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-12T15:46:24Z","title_canon_sha256":"14987a54c7c5be26037bd6a0a849078affb0c22c370951da62f224038577a5b6"},"schema_version":"1.0","source":{"id":"1702.03534","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03534","created_at":"2026-05-18T00:50:35Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03534v1","created_at":"2026-05-18T00:50:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03534","created_at":"2026-05-18T00:50:35Z"},{"alias_kind":"pith_short_12","alias_value":"KBGUNBQH56TI","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KBGUNBQH56TIGRJG","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KBGUNBQH","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:c98bfb60c91331bb0e699f7df958f04f25c420237cd4520a832efc20acccb2c0","target":"graph","created_at":"2026-05-18T00:50:35Z","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":"Leader election is a basic symmetry breaking problem in distributed computing. All nodes of a network have to agree on a single node, called the leader. If the nodes of the network have distinct labels, then agreeing on a single node means that all nodes have to output the label of the elected leader.\n  If the nodes are anonymous, the task of leader election is formulated as follows: every node of the network must output a simple path starting at it, which is coded as a sequence of port numbers, such that all these paths end at a common node, the leader. In this paper, we study deterministic l","authors_text":"Andrzej Pelc, Barun Gorain","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-12T15:46:24Z","title":"Leader Election in Trees with Customized Advice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03534","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:bbdc2ed5a68c6b7043a92d732ad816f384042b23c2d44746f1f06e17b2ceda55","target":"record","created_at":"2026-05-18T00:50:35Z","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":"bef2496ac351c39af0771a1008705a87e89f831f0c79e03a00af58933fa4393c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-12T15:46:24Z","title_canon_sha256":"14987a54c7c5be26037bd6a0a849078affb0c22c370951da62f224038577a5b6"},"schema_version":"1.0","source":{"id":"1702.03534","kind":"arxiv","version":1}},"canonical_sha256":"504d468607efa68345264be13d9cc1f5a686000e92477b3af52361d169b1ffca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"504d468607efa68345264be13d9cc1f5a686000e92477b3af52361d169b1ffca","first_computed_at":"2026-05-18T00:50:35.034076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:35.034076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/NyPbtlMWgTf9ITVRBXbTeVUX7nieDXZJnAWNpfeNZc6Xl1T0LruKZQyjRUiK2RIwbluhWl0G8Ty4P33nN0rBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:35.034813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.03534","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbdc2ed5a68c6b7043a92d732ad816f384042b23c2d44746f1f06e17b2ceda55","sha256:c98bfb60c91331bb0e699f7df958f04f25c420237cd4520a832efc20acccb2c0"],"state_sha256":"5234c6834f751d4c57053f43f4d8786b8c93494d4681ae542bf97244e90cfef2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WuLf6CO8B+g4feZQuF7rXaquqzWEyIx2ude+AE3ur1dETWn4L+hOs9hw8vQTn4sbhAdEuOADK6ttwUQWoALhDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:44:33.996730Z","bundle_sha256":"b44494a609fc79584cb67338004ba076a6564d92853162e013afa56adca110e0"}}