{"id":"W162658627","doi":"10.1007/978-3-642-41527-2_4","title":"An $O(\\sqrt n)$ Space Bound for Obstruction-Free Leader Election","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Leader election; Upper and lower bounds; Combinatorics; Binary logarithm; Randomized algorithm; Mathematics; Asynchronous communication; Discrete mathematics; Time complexity; Algorithm; Computer science; Theoretical computer science; 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.0006859975,0.0006167719,0.0006110444,0.0005575342,0.0005201413,0.001556481,0.00419662,0.0004879139,0.00002931784],"category_scores_gemma":[0.0000967083,0.0005778088,0.000180729,0.0006152812,0.0005074433,0.001729673,0.0004670834,0.0006532178,0.00006749317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004134661,"about_ca_system_score_gemma":0.0004811368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001036725,"about_ca_topic_score_gemma":0.0001628495,"domain_scores_codex":[0.9956026,0.00003457609,0.0006166628,0.001935406,0.0009345344,0.0008762259],"domain_scores_gemma":[0.9960737,0.0002438304,0.0003968412,0.002428655,0.0005967941,0.0002602119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000150955,0.00007743512,0.00003850773,0.0001402168,0.00003369528,0.00002229045,0.0008399757,0.02372517,0.001305429,0.1638752,0.001836551,0.8080904],"study_design_scores_gemma":[0.0006585723,0.0004606019,0.0001672465,0.000306206,0.00001263379,0.0001507446,8.102793e-7,0.681633,0.001971536,0.2828883,0.03059893,0.00115138],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001615234,0.0003558938,0.990431,0.00116626,0.004704604,0.0009196362,0.00002696345,0.0002837283,0.001950466],"genre_scores_gemma":[0.1638355,0.00004234913,0.8268698,0.001569986,0.003333332,0.0001711465,0.00005869232,0.0001300185,0.003989162],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8069391,"threshold_uncertainty_score":0.9996673,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01574022883031462,"score_gpt":0.2469428003752739,"score_spread":0.2312025715449593,"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."}}