{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004631169,0.0007277518,0.001650971,0.001026412,0.002578016,0.005187476,0.002765178,0.002845907,0.006044928],"category_scores_gemma":[0.02855426,0.0006979965,0.001228112,0.001593582,0.005526633,0.02125068,0.007254755,0.006435995,0.000745485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003752954,"about_ca_system_score_gemma":0.004065422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003059976,"about_ca_topic_score_gemma":0.002132238,"domain_scores_codex":[0.9919761,0.002147889,0.0002746464,0.000755275,0.004085675,0.0007604297],"domain_scores_gemma":[0.9604365,0.02919187,0.001198633,0.006360447,0.001945417,0.0008671447],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004144782,0.00008642584,0.000665582,0.0002076466,0.0000473236,0.0001020525,0.0005296917,0.04012436,0.00161715,0.8994859,0.004850097,0.05186936],"study_design_scores_gemma":[0.00005913375,0.00004485387,0.0002860832,0.00003767246,0.00002646558,0.0001321295,0.0001182978,0.1301836,0.001741239,0.8554233,0.01191676,0.00003038663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07617928,0.003789555,0.8651083,0.01736369,0.0008324564,0.0001161423,0.0002064144,0.0007784577,0.03562574],"genre_scores_gemma":[0.8504859,0.002317554,0.1344388,0.001728239,0.001760693,0.0002475568,0.000249118,0.0004022664,0.00837002],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006044928,"threshold_uncertainty_score":0.02722967,"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."}}