Pith. sign in

REVIEW 1 cited by

Leader Election Requires Logarithmic Time in Population Protocols

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1906.11121 v4 pith:7OQ7IOPF submitted 2019-06-25 cs.DC

Yuichi Sudo , Toshimitsu Masuzawa This is my paper · ORCID
classification cs.DC
keywords populationprotocolagentboundelectionexpectationleaderlogarithmic
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

This paper shows that every leader election protocol requires logarithmic stabilization time both in expectation and with high probability in the population protocol model. This lower bound holds even if each agent has knowledge of the exact size of a population and is allowed to use an arbitrarily large number of agent states. This lower bound concludes that the protocol given in [Sudo et al., SSS 2019] is time-optimal in expectation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Sharp Thresholds for Temporal Motifs and Doubling Time in Random Temporal Graphs

    cs.DM 2026-02 conditional novelty 6.0 of 10

    In two random temporal graph models, each fixed δ-temporal motif has an existence threshold determined by the sparsity min |V|/(|E|−1) over subgraphs.

Pith tools