{"id":"W2020165959","doi":"10.1142/s0129626406002782","title":"A HIGHLY CONCURRENT GROUP MUTUAL l-EXCLUSION ALGORITHM","year":2006,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mutual exclusion; Concurrency; Computer science; Asynchronous communication; Generalization; Critical section; Algorithm; Group (periodic table); Process (computing); Suzuki-Kasami algorithm; Extension (predicate logic); Theoretical computer science; Distributed computing; Mathematics; Programming language; 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":[],"consensus_categories":[],"category_scores_codex":[0.0002251633,0.0002399191,0.0002469978,0.00008445384,0.0003121095,0.0004695698,0.0007625065,0.0000691429,0.000004167806],"category_scores_gemma":[0.000005870998,0.0002153441,0.00008526182,0.0003991445,0.00008045135,0.0006880551,0.0001676753,0.0001788626,0.0001017095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000770208,"about_ca_system_score_gemma":0.00004017647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001212364,"about_ca_topic_score_gemma":0.00000578742,"domain_scores_codex":[0.9980168,0.00005751313,0.0003916392,0.0005689031,0.0004679715,0.0004971473],"domain_scores_gemma":[0.9992933,0.00002621986,0.0001944903,0.0003301677,0.0000644012,0.00009140685],"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.00001432234,0.0004806895,0.0009631183,0.000248006,0.00003041675,0.0002831241,0.0009245571,0.003256389,0.01656764,0.01866094,0.1025696,0.8560012],"study_design_scores_gemma":[0.002200446,0.00009406789,0.006000645,0.0003369412,0.00001732138,0.0001271657,0.00002990556,0.795316,0.0003791561,0.001039688,0.1933537,0.001104932],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007709323,0.0009301304,0.9861407,0.003229415,0.0006237848,0.0001629793,0.000007883133,0.0003650295,0.0008307668],"genre_scores_gemma":[0.9245591,0.000004694101,0.07292926,0.001736949,0.0004483018,0.0000456431,0.00004579129,0.000018768,0.0002114826],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9168498,"threshold_uncertainty_score":0.8781478,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008804448669416143,"score_gpt":0.2258978333368807,"score_spread":0.2170933846674646,"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."}}