{"id":"W2946052740","doi":"10.1007/s00446-019-00354-2","title":"The complexity of leader election in diameter-two networks","year":2019,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"Division of Computing and Communication Foundations; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Leader election; Upper and lower bounds; Combinatorics; Constant (computer programming); Randomized algorithm; Monte Carlo method; Monte Carlo algorithm; Theory of computation; Mathematics; Discrete mathematics; Deterministic algorithm; Binary logarithm; Communication complexity; Computer science; Algorithm; Theoretical computer science; Statistics","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.004017615,0.0005875113,0.001890723,0.001037388,0.002306524,0.005034055,0.002974249,0.002906187,0.006112952],"category_scores_gemma":[0.04181897,0.001088025,0.0009495124,0.001839557,0.00281939,0.009181184,0.003535967,0.003086439,0.0006960741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003446394,"about_ca_system_score_gemma":0.002386237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002982789,"about_ca_topic_score_gemma":0.00294102,"domain_scores_codex":[0.9954582,0.001722516,0.0002155069,0.0006794198,0.00123905,0.0006853493],"domain_scores_gemma":[0.9371724,0.05408502,0.00255037,0.003138537,0.001389151,0.001664627],"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.001246188,0.0001846781,0.004190675,0.0003707192,0.0001216343,0.0004289248,0.0007663955,0.5454755,0.003558709,0.3968217,0.01309105,0.03374393],"study_design_scores_gemma":[0.0001282889,0.00004942182,0.0007549059,0.00002179553,0.00004057404,0.0001319402,0.0001833437,0.7036515,0.0007807176,0.292713,0.001518051,0.00002648611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4379986,0.002368874,0.4932095,0.01763625,0.0005840206,0.0003228089,0.001290528,0.0009794493,0.04561004],"genre_scores_gemma":[0.9614315,0.0009002676,0.03024424,0.0004076934,0.0002849874,0.0002082048,0.0004103261,0.0001737812,0.005938951],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006112952,"threshold_uncertainty_score":0.02500552,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.021335128452466,"score_gpt":0.2550519755987303,"score_spread":0.2337168471462643,"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."}}