{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:373BOWAIRUOXOLUTLEADSVJMJ2","short_pith_number":"pith:373BOWAI","schema_version":"1.0","canonical_sha256":"dff61758088d1d772e93590039552c4e887af4c972873fb7f64e173a3b4285fd","source":{"kind":"arxiv","id":"1812.11309","version":3},"attestation_state":"computed","paper":{"title":"Logarithmic Expected-Time Leader Election in Population Protocol Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fukuhito Ooshita, Hirotsugu Kakugawa, Taisuke Izumi, Toshimitsu Masuzawa, Yuichi Sudo","submitted_at":"2018-12-29T08:02:41Z","abstract_excerpt":"In this paper, the leader election problem in the population protocol model is considered. A leader election protocol with logarithmic stabilization time is given. Given a rough knowledge m of the population size n such that m >= \\log_2 n and m=O(log n), the proposed protocol guarantees that exactly one leader is elected from n agents within O(log n) parallel time in expectation and the unique leader is kept forever thereafter. The number of states per agent of the protocol is O(log n)."},"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":"1812.11309","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-12-29T08:02:41Z","cross_cats_sorted":[],"title_canon_sha256":"a577bedf90a463f02f19bb8e85dd726b6ff79cb43b1bd9d75a8f666a3d67337e","abstract_canon_sha256":"6ae815bcbca08db3ab97cdb71dc9c059ec149acf0b093034da019d8454b0d823"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:02.667101Z","signature_b64":"LSH7XQ14/vN66NhP88IcD5mE/BQ3EQKbehqMf8ChJzO+VbCzlU6Y6OpzH+Dy2melxE/GrhSl/ofNQDiDg3U9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dff61758088d1d772e93590039552c4e887af4c972873fb7f64e173a3b4285fd","last_reissued_at":"2026-05-17T23:42:02.666267Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:02.666267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logarithmic Expected-Time Leader Election in Population Protocol Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fukuhito Ooshita, Hirotsugu Kakugawa, Taisuke Izumi, Toshimitsu Masuzawa, Yuichi Sudo","submitted_at":"2018-12-29T08:02:41Z","abstract_excerpt":"In this paper, the leader election problem in the population protocol model is considered. A leader election protocol with logarithmic stabilization time is given. Given a rough knowledge m of the population size n such that m >= \\log_2 n and m=O(log n), the proposed protocol guarantees that exactly one leader is elected from n agents within O(log n) parallel time in expectation and the unique leader is kept forever thereafter. The number of states per agent of the protocol is O(log n)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11309","kind":"arxiv","version":3},"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":"1812.11309","created_at":"2026-05-17T23:42:02.666389+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.11309v3","created_at":"2026-05-17T23:42:02.666389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11309","created_at":"2026-05-17T23:42:02.666389+00:00"},{"alias_kind":"pith_short_12","alias_value":"373BOWAIRUOX","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"373BOWAIRUOXOLUT","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"373BOWAI","created_at":"2026-05-18T12:32:02.567920+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/373BOWAIRUOXOLUTLEADSVJMJ2","json":"https://pith.science/pith/373BOWAIRUOXOLUTLEADSVJMJ2.json","graph_json":"https://pith.science/api/pith-number/373BOWAIRUOXOLUTLEADSVJMJ2/graph.json","events_json":"https://pith.science/api/pith-number/373BOWAIRUOXOLUTLEADSVJMJ2/events.json","paper":"https://pith.science/paper/373BOWAI"},"agent_actions":{"view_html":"https://pith.science/pith/373BOWAIRUOXOLUTLEADSVJMJ2","download_json":"https://pith.science/pith/373BOWAIRUOXOLUTLEADSVJMJ2.json","view_paper":"https://pith.science/paper/373BOWAI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.11309&json=true","fetch_graph":"https://pith.science/api/pith-number/373BOWAIRUOXOLUTLEADSVJMJ2/graph.json","fetch_events":"https://pith.science/api/pith-number/373BOWAIRUOXOLUTLEADSVJMJ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/373BOWAIRUOXOLUTLEADSVJMJ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/373BOWAIRUOXOLUTLEADSVJMJ2/action/storage_attestation","attest_author":"https://pith.science/pith/373BOWAIRUOXOLUTLEADSVJMJ2/action/author_attestation","sign_citation":"https://pith.science/pith/373BOWAIRUOXOLUTLEADSVJMJ2/action/citation_signature","submit_replication":"https://pith.science/pith/373BOWAIRUOXOLUTLEADSVJMJ2/action/replication_record"}},"created_at":"2026-05-17T23:42:02.666389+00:00","updated_at":"2026-05-17T23:42:02.666389+00:00"}