{"id":"W1564201006","doi":"10.1007/978-3-642-02138-1_5","title":"On Model-Checking Optimistic Replication Algorithms","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Convergence (economics); Exploit; Model checking; Counterexample; Collaborative editing; Replication (statistics); Algorithm; Property (philosophy); Theoretical computer science; Distributed computing; Computer security; World Wide Web","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.0009322932,0.0005464023,0.0005438619,0.0005128023,0.0002809894,0.0006568424,0.003324135,0.0003483536,0.000005317764],"category_scores_gemma":[0.000113452,0.0005061427,0.0001391732,0.0005411747,0.000257836,0.0004667684,0.0004607846,0.0007742723,0.00005395828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004259638,"about_ca_system_score_gemma":0.0003905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000928053,"about_ca_topic_score_gemma":0.000006165797,"domain_scores_codex":[0.9953233,0.00002313924,0.0006167851,0.002261613,0.001129559,0.0006456139],"domain_scores_gemma":[0.9960746,0.0002162729,0.0003791793,0.00286989,0.0002705313,0.0001895038],"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.000002172336,0.00001900529,5.736194e-7,0.00001072374,0.00000299161,0.00002908353,0.0001152876,0.3820489,0.00002836662,0.05664868,0.00004074557,0.5610535],"study_design_scores_gemma":[0.0001441881,0.0001156465,0.00001357334,0.0004086113,0.00000348287,0.00003649939,2.271316e-8,0.8102146,0.0002101689,0.1876072,0.0007898912,0.0004560908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001281541,0.0002347972,0.9864736,0.0006860083,0.0008330821,0.0003871273,0.00001215086,0.0002383472,0.01112204],"genre_scores_gemma":[0.1956341,0.00004732554,0.7984479,0.003370374,0.0005728272,0.00002411659,0.00002791654,0.00005319695,0.001822217],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5605974,"threshold_uncertainty_score":0.999739,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02399841025047516,"score_gpt":0.2661182656709419,"score_spread":0.2421198554204667,"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."}}