{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002813854,0.0003380313,0.0003844936,0.0002189175,0.0003461413,0.0004148804,0.001205883,0.0003461977,0.000005461529],"category_scores_gemma":[0.0000141369,0.0003557579,0.0001967611,0.0005699029,0.0001084014,0.0006954714,0.0002564365,0.0003922475,0.0000111902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003386426,"about_ca_system_score_gemma":0.000410577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004658333,"about_ca_topic_score_gemma":0.0002788466,"domain_scores_codex":[0.9978136,0.0001244038,0.0002340356,0.001300973,0.0001170644,0.000409942],"domain_scores_gemma":[0.9979661,0.00005263535,0.0002801581,0.001096579,0.0004739101,0.000130578],"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.0007027005,0.0008855594,0.001755022,0.0005661701,0.0006301207,0.0002419158,0.000455571,0.1559294,0.0005163285,0.8311366,0.003295366,0.003885154],"study_design_scores_gemma":[0.002053314,0.0005085143,0.0009511574,0.0003861387,0.0001463326,0.00001321811,0.0001459893,0.9560732,0.0003715662,0.02712438,0.0114262,0.0007999535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1070788,0.00004389875,0.8889506,0.0001489313,0.001252552,0.0008347362,0.00008758649,0.0002694519,0.00133339],"genre_scores_gemma":[0.9909934,0.00001738011,0.002023695,0.0001582816,0.00008592729,0.0000109782,0.0001175623,0.0000140856,0.006578642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8869269,"threshold_uncertainty_score":0.9998894,"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."}}