{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KBGUNBQH56TIGRJGJPQT3HGB6W","short_pith_number":"pith:KBGUNBQH","schema_version":"1.0","canonical_sha256":"504d468607efa68345264be13d9cc1f5a686000e92477b3af52361d169b1ffca","source":{"kind":"arxiv","id":"1702.03534","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.03534","created_at":"2026-05-18T00:50:35.034195+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03534v1","created_at":"2026-05-18T00:50:35.034195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03534","created_at":"2026-05-18T00:50:35.034195+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBGUNBQH56TI","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBGUNBQH56TIGRJG","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBGUNBQH","created_at":"2026-05-18T12:31:24.725408+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/KBGUNBQH56TIGRJGJPQT3HGB6W","json":"https://pith.science/pith/KBGUNBQH56TIGRJGJPQT3HGB6W.json","graph_json":"https://pith.science/api/pith-number/KBGUNBQH56TIGRJGJPQT3HGB6W/graph.json","events_json":"https://pith.science/api/pith-number/KBGUNBQH56TIGRJGJPQT3HGB6W/events.json","paper":"https://pith.science/paper/KBGUNBQH"},"agent_actions":{"view_html":"https://pith.science/pith/KBGUNBQH56TIGRJGJPQT3HGB6W","download_json":"https://pith.science/pith/KBGUNBQH56TIGRJGJPQT3HGB6W.json","view_paper":"https://pith.science/paper/KBGUNBQH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03534&json=true","fetch_graph":"https://pith.science/api/pith-number/KBGUNBQH56TIGRJGJPQT3HGB6W/graph.json","fetch_events":"https://pith.science/api/pith-number/KBGUNBQH56TIGRJGJPQT3HGB6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBGUNBQH56TIGRJGJPQT3HGB6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBGUNBQH56TIGRJGJPQT3HGB6W/action/storage_attestation","attest_author":"https://pith.science/pith/KBGUNBQH56TIGRJGJPQT3HGB6W/action/author_attestation","sign_citation":"https://pith.science/pith/KBGUNBQH56TIGRJGJPQT3HGB6W/action/citation_signature","submit_replication":"https://pith.science/pith/KBGUNBQH56TIGRJGJPQT3HGB6W/action/replication_record"}},"created_at":"2026-05-18T00:50:35.034195+00:00","updated_at":"2026-05-18T00:50:35.034195+00:00"}