{"id":"W1987584238","doi":"10.1007/s00446-010-0096-2","title":"Closing the complexity gap between FCFS mutual exclusion and mutual exclusion","year":2010,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mutual exclusion; Computer science; Asynchronous communication; Class (philosophy); Binary logarithm; Algorithm; Parallel computing; Theoretical computer science; Distributed computing; Discrete mathematics; Mathematics; Computer network; Artificial intelligence","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","sts"],"consensus_categories":[],"category_scores_codex":[0.001247716,0.0003893154,0.0004670812,0.00008149299,0.001764991,0.0007576782,0.001606669,0.0002198073,0.00001166082],"category_scores_gemma":[0.0001550986,0.0003029694,0.0001334421,0.0007884503,0.0004063508,0.0004133171,0.001237769,0.0009093558,0.00004338395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006461598,"about_ca_system_score_gemma":0.00007953659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001335553,"about_ca_topic_score_gemma":0.0000280369,"domain_scores_codex":[0.9968447,0.0002348388,0.000682902,0.0008325517,0.0006292458,0.0007757765],"domain_scores_gemma":[0.997655,0.0004579212,0.0003647909,0.001032871,0.0002197192,0.0002697434],"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.00007996937,0.0005738526,0.06743652,0.0002913616,0.0002701904,0.0002190183,0.008585045,0.001180817,0.06189181,0.375046,0.0187344,0.465691],"study_design_scores_gemma":[0.002024465,0.00019492,0.1438912,0.0003179033,0.00005599076,0.0002963657,0.0004442159,0.7941356,0.003635121,0.009689615,0.04394299,0.001371664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4368544,0.0001077994,0.5595011,0.001382182,0.0008237452,0.0002818209,0.000215852,0.0003294244,0.0005036946],"genre_scores_gemma":[0.9939287,0.00000376048,0.004887434,0.0001787904,0.0006721188,0.00000472685,0.0002889734,0.00002017482,0.00001529779],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7929547,"threshold_uncertainty_score":0.9999422,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03822665741462596,"score_gpt":0.2778016039538242,"score_spread":0.2395749465391983,"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."}}