{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001042551,0.0009489452,0.001212023,0.0003877711,0.0007367493,0.004366401,0.002018034,0.001077499,0.00004174654],"category_scores_gemma":[0.0001208801,0.0009622872,0.001140486,0.0004546836,0.0001523375,0.002850958,0.001162008,0.001165537,0.00006905197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006470432,"about_ca_system_score_gemma":0.0005273807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007961051,"about_ca_topic_score_gemma":0.0001208677,"domain_scores_codex":[0.9944145,0.00006646694,0.002265389,0.001007959,0.0009250712,0.00132058],"domain_scores_gemma":[0.9946031,0.0001480199,0.001372573,0.001925203,0.001635277,0.0003158209],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002992347,0.01061976,0.002957641,0.05815821,0.01193899,0.0001735097,0.07818507,0.02115238,0.00324751,0.2209323,0.4278991,0.1617432],"study_design_scores_gemma":[0.01245829,0.000901045,0.001481828,0.003780187,0.000349814,0.0002954764,0.005157685,0.6612002,0.001956546,0.007860858,0.3004228,0.004135364],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03136757,0.0004242948,0.9496707,0.0008510854,0.00969667,0.003419116,0.002151341,0.000521931,0.001897282],"genre_scores_gemma":[0.9343922,0.00011939,0.03937796,0.003333957,0.00122971,0.002452801,0.01375257,0.0002010777,0.005140369],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9102927,"threshold_uncertainty_score":0.9992828,"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."}}