{"id":"W7109943489","doi":"10.4230/lipics.disc.2025.3","title":"An Almost-Logarithmic Lower Bound for Leader Election with Bounded Value Contention","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Nvidia","keywords":"Upper and lower bounds; Bounded function; Asynchronous communication; Communication complexity; Binary logarithm; Value (mathematics); Leader election; Key (lock); Time complexity","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040458,0.001609075,0.00168677,0.001160106,0.001807594,0.004890998,0.004257772,0.00189207,0.01140266],"category_scores_gemma":[0.02685966,0.0006307687,0.002240205,0.001443057,0.003160399,0.012428,0.004473293,0.006064401,0.002628183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00342776,"about_ca_system_score_gemma":0.003343376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001553976,"about_ca_topic_score_gemma":0.001971367,"domain_scores_codex":[0.9931636,0.001665477,0.0002380061,0.001257419,0.001732493,0.001943162],"domain_scores_gemma":[0.9583437,0.03231544,0.001639644,0.00489023,0.001327163,0.001483812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003992397,0.001205239,0.008767878,0.001479641,0.0004250068,0.0006970866,0.001307341,0.3714529,0.04674827,0.3755313,0.03701371,0.1513793],"study_design_scores_gemma":[0.0001652595,0.0002839509,0.0008811904,0.00006820987,0.0001055541,0.0001990101,0.0001220715,0.728507,0.0109994,0.2539998,0.004614222,0.00005437418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.147667,0.003068494,0.7915364,0.01018405,0.0005849793,0.0004025879,0.00104939,0.003507263,0.04199987],"genre_scores_gemma":[0.8250372,0.001111419,0.153267,0.001602621,0.0005539351,0.000670252,0.001174772,0.001273375,0.01530945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01140266,"threshold_uncertainty_score":0.03814572,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01009319923544329,"score_gpt":0.2679484564725383,"score_spread":0.257855257237095,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}