{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007030923,0.0001603242,0.0002932146,0.0000503577,0.0001687015,0.0001666886,0.0009255169,0.00006614732,0.00000284659],"category_scores_gemma":[0.00003782941,0.0001277363,0.00009482711,0.001009957,0.0001165498,0.0001801676,0.0001743953,0.0002852173,0.00001674194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008308463,"about_ca_system_score_gemma":0.00003843728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001794352,"about_ca_topic_score_gemma":0.00004410184,"domain_scores_codex":[0.9981827,0.0001718111,0.0005413213,0.0003676029,0.0002559632,0.000480658],"domain_scores_gemma":[0.9986483,0.0002568892,0.0002802607,0.0006305468,0.0001307554,0.0000532822],"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.00006710992,0.0004004088,0.1184613,0.0001214248,0.0001254602,0.00002092228,0.0007938811,0.3296097,0.002591549,0.3952849,0.003524454,0.1489989],"study_design_scores_gemma":[0.000556505,0.00004486847,0.03852477,0.00008206654,0.000002036004,0.000008380523,0.00007739733,0.957866,0.0003878149,0.0008558197,0.001435351,0.0001589616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1008234,0.0002562325,0.8970634,0.0003059648,0.0007151585,0.0002563745,0.00001648734,0.00009504627,0.0004680058],"genre_scores_gemma":[0.9987308,0.00000445357,0.001088643,0.00004609433,0.00006227472,0.000004047303,0.00004219719,0.000007274213,0.00001421813],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8979074,"threshold_uncertainty_score":0.5208934,"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."}}