{"id":"W2107208179","doi":"10.1145/777412.777467","title":"Toward a decidable notion of sequential consistency","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Decidability; Undecidable problem; Correctness; Computer science; Upper and lower bounds; Prefix; Consistency (knowledge bases); Sequential consistency; Protocol (science); Theoretical computer science; Conjecture; Discrete mathematics; Counterexample; Reachability problem; Mathematics; Algorithm; Consistency model","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":[],"consensus_categories":[],"category_scores_codex":[0.01294167,0.001075682,0.001196656,0.002182878,0.002788558,0.008184805,0.005957018,0.003349476,0.003232789],"category_scores_gemma":[0.02658788,0.00231478,0.003467931,0.002346332,0.01165375,0.02162425,0.007989095,0.01391498,0.0006475192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00570676,"about_ca_system_score_gemma":0.004778965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003119781,"about_ca_topic_score_gemma":0.00250909,"domain_scores_codex":[0.9871171,0.003977664,0.001126269,0.002977768,0.003587557,0.001213644],"domain_scores_gemma":[0.9653308,0.0226975,0.001789086,0.007161366,0.002132221,0.0008889613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006769563,0.00007251559,0.0003337381,0.00007938754,0.00002277787,0.00009871191,0.000536627,0.01014992,0.001603443,0.980056,0.0008725842,0.006106571],"study_design_scores_gemma":[0.00006112284,0.00003761047,0.00008048127,0.00003792627,0.00002966325,0.00007402081,0.0001461355,0.06280972,0.003849466,0.9264965,0.006354467,0.00002291337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03820131,0.0005100054,0.9423328,0.004132547,0.0001356998,0.0001648117,0.0003671358,0.001222982,0.01293272],"genre_scores_gemma":[0.5709255,0.0006893708,0.4169846,0.00152985,0.0005400366,0.0006990549,0.001068237,0.000543208,0.007020055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01294167,"threshold_uncertainty_score":0.06844294,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0325474592930355,"score_gpt":0.2504543122260805,"score_spread":0.217906852933045,"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."}}