{"id":"W3210337868","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":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Leader election; Computer science; Bounded function; Asynchronous communication; Logarithm; Concurrency; Upper and lower bounds; Parallel computing; Shared memory; Randomized algorithm; Theoretical computer science; Distributed computing; Algorithm; Computer network; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"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.003893018,0.001583567,0.001700558,0.001151095,0.001818953,0.004793859,0.004335827,0.001908667,0.01095451],"category_scores_gemma":[0.02774596,0.0006260274,0.002169744,0.001436494,0.003164906,0.01229043,0.004403678,0.006074717,0.002400986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003459856,"about_ca_system_score_gemma":0.003294081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001613511,"about_ca_topic_score_gemma":0.001990032,"domain_scores_codex":[0.9934836,0.001581884,0.0002255209,0.001250392,0.001654844,0.001803797],"domain_scores_gemma":[0.957129,0.03327625,0.001710804,0.00500965,0.00135822,0.00151606],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003686325,0.001184281,0.00904352,0.001377369,0.0004158857,0.0006672119,0.001283988,0.3860846,0.04416957,0.3775959,0.03615801,0.1383334],"study_design_scores_gemma":[0.0001574096,0.0002527673,0.0008871158,0.00006508894,0.000097525,0.0001864363,0.0001239394,0.7219451,0.01060593,0.2611801,0.004445855,0.00005276308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.152457,0.002926657,0.7865151,0.01051819,0.0005721939,0.0003818859,0.001033563,0.003398461,0.04219691],"genre_scores_gemma":[0.830166,0.001021515,0.1485641,0.001672394,0.0005457947,0.0006557434,0.001121743,0.001271745,0.01498087],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01095451,"threshold_uncertainty_score":0.03664643,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05092475706012354,"score_gpt":0.2093341791849102,"score_spread":0.1584094221247867,"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."}}