{"id":"W2032692626","doi":"10.1145/2332432.2332479","title":"Brief announcement","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Mutual exclusion; Computer science; Upper and lower bounds; Deadlock; Adversary model; Schedule; Critical section; Distributed shared memory; Shared memory; Cache; Binary logarithm; Adversary; Theoretical computer science; Distributed computing; Parallel computing; Memory management; Mathematics; Discrete mathematics; Uniform memory access; Overlay; Operating system; Computer security","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002075625,0.0009540984,0.0007896233,0.001411967,0.001994107,0.003684219,0.00196812,0.005931004,0.268687],"category_scores_gemma":[0.008486977,0.0003327959,0.0007142873,0.001006401,0.0006581534,0.002864195,0.00224532,0.004164595,0.1591188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002097921,"about_ca_system_score_gemma":0.003439444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001772501,"about_ca_topic_score_gemma":0.003229412,"domain_scores_codex":[0.9983836,0.0001937568,0.0001216235,0.0003736622,0.0006665573,0.0002607179],"domain_scores_gemma":[0.9946387,0.0006356089,0.0002060709,0.0003888248,0.002096334,0.002034472],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009300738,0.00004368082,0.0001940697,0.0002021652,0.000005814181,0.0001896274,0.00003291964,0.00003295919,0.0004035744,0.004560565,0.9386085,0.05563317],"study_design_scores_gemma":[0.000007805756,0.00002710405,0.0002438678,0.00007336128,0.000004406607,0.000182686,0.00003623555,0.00001550975,0.000147763,0.0009493646,0.9983075,0.000004546723],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"other","genre_scores_codex":[0.001734644,0.03239254,0.003068201,0.1609851,0.5226851,0.0003964293,0.005014671,0.001006318,0.2727171],"genre_scores_gemma":[0.01227274,0.0241441,0.001863258,0.06645529,0.1298617,0.0002990868,0.004154223,0.0003496354,0.7605999],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.731313,"threshold_uncertainty_score":0.8988476,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01595816704439158,"score_gpt":0.2402757508029217,"score_spread":0.2243175837585301,"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."}}