{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006469769,0.0004031173,0.0004824232,0.0002719486,0.0006961886,0.001264708,0.001020576,0.0002558217,0.000004998658],"category_scores_gemma":[0.0000473063,0.0003434945,0.0002244603,0.0005653526,0.0001300126,0.002887144,0.0001026517,0.0002858749,0.00002476899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002397694,"about_ca_system_score_gemma":0.0002167242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005777849,"about_ca_topic_score_gemma":0.00008917235,"domain_scores_codex":[0.99734,0.00003568371,0.0009655754,0.0004535258,0.0004160616,0.000789198],"domain_scores_gemma":[0.9977394,0.00008732986,0.0004144229,0.0008991706,0.000699952,0.0001597307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003234777,0.00443476,0.008706571,0.004535452,0.002120998,0.00002618442,0.01447001,0.002373626,0.003421407,0.7562157,0.0747636,0.1256969],"study_design_scores_gemma":[0.01146356,0.0020874,0.001800683,0.0006675462,0.0001178952,0.0001137379,0.001544071,0.6037809,0.00389378,0.005482049,0.3678648,0.001183557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07868365,0.00004793167,0.9141892,0.0006714544,0.001834926,0.002144254,0.0003077294,0.0002993559,0.001821468],"genre_scores_gemma":[0.9701849,0.000008508502,0.0244187,0.002027919,0.0001453891,0.0006274515,0.0007545486,0.00003878405,0.001793762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8915013,"threshold_uncertainty_score":0.9999017,"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."}}