{"id":"W1501306102","doi":"10.1007/3-540-40026-5_3","title":"Bounds for Mutual Exclusion with only Processor Consistency","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mutual exclusion; Consistency (knowledge bases); Sequential consistency; Computer science; Consistency model; Upper and lower bounds; Weak consistency; Type (biology); Corollary; Algorithm; Strong consistency; Data consistency; Discrete mathematics; Mathematics; Theoretical computer science; Artificial intelligence; Distributed computing; Statistics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006168752,0.0006428575,0.0007231434,0.000468995,0.0005389781,0.0008595161,0.003056344,0.000353856,0.00001924817],"category_scores_gemma":[0.00004223842,0.0005084307,0.0001474044,0.0006517837,0.0007828569,0.0007237316,0.0004800125,0.0005383414,0.00003852116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002440605,"about_ca_system_score_gemma":0.001733094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002120762,"about_ca_topic_score_gemma":0.0001712782,"domain_scores_codex":[0.9955284,0.00002123689,0.000630996,0.001882061,0.00109635,0.0008409785],"domain_scores_gemma":[0.9973134,0.0003074471,0.000356831,0.001340742,0.0004633506,0.0002181916],"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.00005946104,0.00007405332,0.00004073717,0.0001700186,0.00002253655,0.0001162174,0.0008982625,0.006638653,0.00004085732,0.05347551,0.0001670308,0.9382967],"study_design_scores_gemma":[0.002480892,0.002060657,0.0001943889,0.003287249,0.00004219263,0.001026726,9.550793e-7,0.6485589,0.0006104836,0.2125024,0.1262455,0.002989721],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001303659,0.0006427214,0.9869314,0.0006385263,0.0009509866,0.0009374871,0.00004926768,0.0001966009,0.009522616],"genre_scores_gemma":[0.4120246,0.00009001733,0.5786617,0.003182642,0.001359886,0.0001272825,0.00007162125,0.0001316284,0.004350597],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.935307,"threshold_uncertainty_score":0.9997367,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0128336601059376,"score_gpt":0.2377280046285009,"score_spread":0.2248943445225633,"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."}}