{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PUPDAHOP4PKW75IXKPOZI4RYNH","short_pith_number":"pith:PUPDAHOP","schema_version":"1.0","canonical_sha256":"7d1e301dcfe3d56ff51753dd94723869e9f4f4e0ccd418a8dc2e61f49979d44c","source":{"kind":"arxiv","id":"1805.05660","version":2},"attestation_state":"computed","paper":{"title":"Selecting a Leader in a Network of Finite State Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Noa Kolikant, Yehuda Afek, Yuval Emek","submitted_at":"2018-05-15T09:28:37Z","abstract_excerpt":"This paper studies a variant of the \\emph{leader election} problem under the \\emph{stone age} model (Emek and Wattenhofer, PODC 2013) that considers a network of $n$ randomized finite automata with very weak communication capabilities (a multi-frequency asynchronous generalization of the \\emph{beeping} model's communication scheme). Since solving the classic leader election problem is impossible even in more powerful models, we consider a relaxed variant, referred to as \\emph{$k$-leader selection}, in which a leader should be selected out of at most $k$ initial candidates. Our main contributio"},"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":"1805.05660","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-15T09:28:37Z","cross_cats_sorted":[],"title_canon_sha256":"3dd4b2b982f71cd56d9d387aa14116d37a6f0d817aee96aec3ee7c88ad7c7bde","abstract_canon_sha256":"e76d83d85b89826413444506f42ec0d3f7b7b28c8069a4d78aecff4b921c8b88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:52.255533Z","signature_b64":"9ynjvgCH0zJ23FRhs66Ya/g0E9BsmugQnx88mvou1iJRXPcGsawqXpL0U+/HtrGaxeVmO8tE4xExlEXfgeK/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d1e301dcfe3d56ff51753dd94723869e9f4f4e0ccd418a8dc2e61f49979d44c","last_reissued_at":"2026-05-18T00:09:52.254832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:52.254832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Selecting a Leader in a Network of Finite State Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Noa Kolikant, Yehuda Afek, Yuval Emek","submitted_at":"2018-05-15T09:28:37Z","abstract_excerpt":"This paper studies a variant of the \\emph{leader election} problem under the \\emph{stone age} model (Emek and Wattenhofer, PODC 2013) that considers a network of $n$ randomized finite automata with very weak communication capabilities (a multi-frequency asynchronous generalization of the \\emph{beeping} model's communication scheme). Since solving the classic leader election problem is impossible even in more powerful models, we consider a relaxed variant, referred to as \\emph{$k$-leader selection}, in which a leader should be selected out of at most $k$ initial candidates. Our main contributio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05660","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":"1805.05660","created_at":"2026-05-18T00:09:52.254954+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.05660v2","created_at":"2026-05-18T00:09:52.254954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05660","created_at":"2026-05-18T00:09:52.254954+00:00"},{"alias_kind":"pith_short_12","alias_value":"PUPDAHOP4PKW","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PUPDAHOP4PKW75IX","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PUPDAHOP","created_at":"2026-05-18T12:32:46.962924+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/PUPDAHOP4PKW75IXKPOZI4RYNH","json":"https://pith.science/pith/PUPDAHOP4PKW75IXKPOZI4RYNH.json","graph_json":"https://pith.science/api/pith-number/PUPDAHOP4PKW75IXKPOZI4RYNH/graph.json","events_json":"https://pith.science/api/pith-number/PUPDAHOP4PKW75IXKPOZI4RYNH/events.json","paper":"https://pith.science/paper/PUPDAHOP"},"agent_actions":{"view_html":"https://pith.science/pith/PUPDAHOP4PKW75IXKPOZI4RYNH","download_json":"https://pith.science/pith/PUPDAHOP4PKW75IXKPOZI4RYNH.json","view_paper":"https://pith.science/paper/PUPDAHOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.05660&json=true","fetch_graph":"https://pith.science/api/pith-number/PUPDAHOP4PKW75IXKPOZI4RYNH/graph.json","fetch_events":"https://pith.science/api/pith-number/PUPDAHOP4PKW75IXKPOZI4RYNH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PUPDAHOP4PKW75IXKPOZI4RYNH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PUPDAHOP4PKW75IXKPOZI4RYNH/action/storage_attestation","attest_author":"https://pith.science/pith/PUPDAHOP4PKW75IXKPOZI4RYNH/action/author_attestation","sign_citation":"https://pith.science/pith/PUPDAHOP4PKW75IXKPOZI4RYNH/action/citation_signature","submit_replication":"https://pith.science/pith/PUPDAHOP4PKW75IXKPOZI4RYNH/action/replication_record"}},"created_at":"2026-05-18T00:09:52.254954+00:00","updated_at":"2026-05-18T00:09:52.254954+00:00"}