{"id":"W2166416865","doi":"10.1109/icdcs.1994.302398","title":"An efficient method for mutual exclusion in truly distributed systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mutual exclusion; Computer science; Correctness; Tree (set theory); Distributed algorithm; Overhead (engineering); Distributed computing; Suzuki-Kasami algorithm; Mutual information; Voting; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Programming language","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.0007347598,0.0001646609,0.0002901714,0.00009981658,0.00012298,0.0002475435,0.0007706418,0.0001000716,0.00001571092],"category_scores_gemma":[0.00003770013,0.0001391332,0.00007119247,0.0005586619,0.00001496269,0.0002652328,0.00008863703,0.00008783312,0.00004262994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009235905,"about_ca_system_score_gemma":0.00001577776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001727188,"about_ca_topic_score_gemma":0.00002288435,"domain_scores_codex":[0.9981658,0.0001522091,0.0004395604,0.0005381574,0.0002865577,0.0004177079],"domain_scores_gemma":[0.9988905,0.0001334654,0.00009694776,0.0006281071,0.000105003,0.0001460412],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005612993,0.002191198,0.000772958,0.0002661495,0.0000330773,0.0000939575,0.003441348,0.3644973,0.003907285,0.4910445,0.03070622,0.1029899],"study_design_scores_gemma":[0.0007602268,0.0001183494,0.000492534,0.0000354324,0.00000209458,0.00001878579,0.0001002555,0.9812055,0.0001246614,0.00007644536,0.01686641,0.0001992718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00774948,0.0002119987,0.9891084,0.0002595372,0.0006410247,0.0005823284,0.00009999583,0.000206326,0.001140912],"genre_scores_gemma":[0.9573996,0.000002576364,0.04193457,0.00007300104,0.00008036991,0.0001060314,0.00003524964,0.000009533414,0.0003590513],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9496501,"threshold_uncertainty_score":0.5673687,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02318509445989404,"score_gpt":0.2860185086874513,"score_spread":0.2628334142275573,"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."}}