{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MDEE3WYLLL3FMEV54GBQKARQ5D","short_pith_number":"pith:MDEE3WYL","schema_version":"1.0","canonical_sha256":"60c84ddb0b5af65612bde183050230e8d2f9730ac3242630dd4dec21c22b04c1","source":{"kind":"arxiv","id":"1505.04308","version":2},"attestation_state":"computed","paper":{"title":"Time vs. Information Tradeoffs for Leader Election in Anonymous Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Andrzej Pelc, Avery Miller, Christian Glacet","submitted_at":"2015-05-16T18:41:40Z","abstract_excerpt":"The leader election task calls for all nodes of a network to agree on a single node. If the nodes of the network are anonymous, the task of leader election is formulated as follows: every node $v$ of the network must output a simple path, 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 leader election in anonymous trees.\n  Our aim is to establish tradeoffs between the allocated time $\\tau$ and the amount of information that has to be given $\\textit{a priori}$ to the nodes to enable leader election in time $\\"},"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":"1505.04308","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-16T18:41:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7ee5d89e6b44b3a3a7070b74aceb933358ca1c701bc3329b3546c4f15a0151fb","abstract_canon_sha256":"649760a6f3bfd44d3b6cb4a5cd667fd972182e6b83ccc628f70cee2d843ee17c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:48.798178Z","signature_b64":"ATMe5dXucUUdPgt3j5AqCp9uLestubokQQN3fnQgGXg6wg13WDv7MwnV24JBj1mLe44YGMSFNahiBPx52cCMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60c84ddb0b5af65612bde183050230e8d2f9730ac3242630dd4dec21c22b04c1","last_reissued_at":"2026-05-18T01:37:48.797665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:48.797665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time vs. Information Tradeoffs for Leader Election in Anonymous Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Andrzej Pelc, Avery Miller, Christian Glacet","submitted_at":"2015-05-16T18:41:40Z","abstract_excerpt":"The leader election task calls for all nodes of a network to agree on a single node. If the nodes of the network are anonymous, the task of leader election is formulated as follows: every node $v$ of the network must output a simple path, 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 leader election in anonymous trees.\n  Our aim is to establish tradeoffs between the allocated time $\\tau$ and the amount of information that has to be given $\\textit{a priori}$ to the nodes to enable leader election in time $\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04308","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.04308","created_at":"2026-05-18T01:37:48.797750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04308v2","created_at":"2026-05-18T01:37:48.797750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04308","created_at":"2026-05-18T01:37:48.797750+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDEE3WYLLL3F","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDEE3WYLLL3FMEV5","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDEE3WYL","created_at":"2026-05-18T12:29:32.376354+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/MDEE3WYLLL3FMEV54GBQKARQ5D","json":"https://pith.science/pith/MDEE3WYLLL3FMEV54GBQKARQ5D.json","graph_json":"https://pith.science/api/pith-number/MDEE3WYLLL3FMEV54GBQKARQ5D/graph.json","events_json":"https://pith.science/api/pith-number/MDEE3WYLLL3FMEV54GBQKARQ5D/events.json","paper":"https://pith.science/paper/MDEE3WYL"},"agent_actions":{"view_html":"https://pith.science/pith/MDEE3WYLLL3FMEV54GBQKARQ5D","download_json":"https://pith.science/pith/MDEE3WYLLL3FMEV54GBQKARQ5D.json","view_paper":"https://pith.science/paper/MDEE3WYL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04308&json=true","fetch_graph":"https://pith.science/api/pith-number/MDEE3WYLLL3FMEV54GBQKARQ5D/graph.json","fetch_events":"https://pith.science/api/pith-number/MDEE3WYLLL3FMEV54GBQKARQ5D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDEE3WYLLL3FMEV54GBQKARQ5D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDEE3WYLLL3FMEV54GBQKARQ5D/action/storage_attestation","attest_author":"https://pith.science/pith/MDEE3WYLLL3FMEV54GBQKARQ5D/action/author_attestation","sign_citation":"https://pith.science/pith/MDEE3WYLLL3FMEV54GBQKARQ5D/action/citation_signature","submit_replication":"https://pith.science/pith/MDEE3WYLLL3FMEV54GBQKARQ5D/action/replication_record"}},"created_at":"2026-05-18T01:37:48.797750+00:00","updated_at":"2026-05-18T01:37:48.797750+00:00"}