{"id":"W3189431800","doi":"10.4230/lipics.disc.2021.4","title":"Lower Bounds for Shared-Memory Leader Election Under Bounded Write Contention","year":2021,"lang":"en","type":"preprint","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":"","keywords":"Leader election; Computer science; Bounded function; Asynchronous communication; Logarithm; Concurrency; Randomized algorithm; Upper and lower bounds; Shared memory; Parallel computing; Theoretical computer science; Algorithm; Distributed computing; Mathematics; Computer network","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.005963717,0.00256708,0.002571508,0.002290204,0.003016845,0.007567605,0.005495518,0.00243737,0.01417962],"category_scores_gemma":[0.03652096,0.001094326,0.00212243,0.002194821,0.004417968,0.01482618,0.00702953,0.007808622,0.003159345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005112189,"about_ca_system_score_gemma":0.003468857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001217038,"about_ca_topic_score_gemma":0.001969808,"domain_scores_codex":[0.9895961,0.002165843,0.0004264494,0.001556292,0.003029886,0.003225462],"domain_scores_gemma":[0.9356375,0.0486992,0.002637901,0.008565904,0.002494135,0.001965187],"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.004466918,0.001140238,0.006754723,0.001874785,0.0003584043,0.0006966339,0.001501796,0.435481,0.03886373,0.3697743,0.02680263,0.1122847],"study_design_scores_gemma":[0.0001578207,0.0002242421,0.0006906372,0.0001064553,0.0001250604,0.0001917481,0.0001681425,0.7306911,0.01447264,0.2487685,0.004329876,0.00007368363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1005753,0.005233527,0.8384084,0.007272605,0.0006424962,0.000391087,0.00105944,0.004862575,0.04155455],"genre_scores_gemma":[0.8830969,0.001812094,0.09404735,0.00148857,0.0007428442,0.0007276355,0.001194844,0.001860848,0.01502899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01417962,"threshold_uncertainty_score":0.04743552,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02645367772850623,"score_gpt":0.2748358487098276,"score_spread":0.2483821709813213,"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."}}