{"id":"W2100677024","doi":"10.1145/945526.945527","title":"Some myths about famous mutual exclusion algorithms","year":2003,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Mutual exclusion; Algorithm; Computer science; Dijkstra's algorithm; Software; Process (computing); Theoretical computer science; Programming language; Shortest path problem","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":[],"consensus_categories":[],"category_scores_codex":[0.0003120243,0.0002408018,0.000293944,0.00007706319,0.0002259611,0.0002636992,0.001489185,0.0001341445,0.00003480854],"category_scores_gemma":[0.0002443289,0.0002102001,0.0001234206,0.0004165386,0.00003975838,0.0008174306,0.00032226,0.0002056271,0.0006170844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006634761,"about_ca_system_score_gemma":0.0001094844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009551427,"about_ca_topic_score_gemma":0.000008965593,"domain_scores_codex":[0.9979689,0.0001242357,0.0003777249,0.0005671378,0.0004373338,0.0005246567],"domain_scores_gemma":[0.9979649,0.0001170239,0.0001427379,0.001485883,0.0000780445,0.0002114628],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002677155,0.0007195297,0.001963474,0.00009375568,0.0001137726,0.0006158747,0.005020359,0.0003276462,0.01755351,0.1935394,0.1518866,0.6281393],"study_design_scores_gemma":[0.001609385,0.0002382355,0.002802554,0.00008923567,0.00001216831,0.0001698956,0.0002480313,0.009062391,0.008062806,0.007745083,0.9690465,0.0009137142],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09737463,0.008035847,0.8420578,0.003593076,0.009193246,0.001246695,0.00007758188,0.001400869,0.03702023],"genre_scores_gemma":[0.9731738,0.0001502597,0.02127056,0.001716328,0.0004982065,0.00003619614,0.00001447683,0.00002847565,0.003111714],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8757991,"threshold_uncertainty_score":0.8571712,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01872739838913388,"score_gpt":0.2595506680645361,"score_spread":0.2408232696754022,"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."}}