{"id":"W1596940311","doi":"10.1109/hicss.1990.205207","title":"An optimistic algorithm for consistent replicated shared data","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Algorithm","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.0002160092,0.0001125253,0.0001634841,0.00002669132,0.0001112662,0.0002971073,0.001916678,0.00004786543,0.0000831187],"category_scores_gemma":[0.0000348617,0.00009663879,0.00003344076,0.0001946517,0.00002358623,0.00059759,0.0001906923,0.00004584169,0.00006732595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001770223,"about_ca_system_score_gemma":0.00001453578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002484253,"about_ca_topic_score_gemma":0.000001966821,"domain_scores_codex":[0.998633,0.00002378441,0.0002566566,0.0006782277,0.0001551584,0.0002531974],"domain_scores_gemma":[0.9971611,0.00005000319,0.00007041453,0.002452073,0.0001261215,0.00014026],"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.000003201968,0.0005040949,0.00003834771,0.00003410023,0.00006084467,0.00003633507,0.0001967882,0.0002654807,0.0005196857,0.01776691,0.262271,0.7183033],"study_design_scores_gemma":[0.0003246364,0.00005844631,0.00007332957,0.00001066593,0.000004604332,0.00002104534,0.00001127596,0.9274968,0.00007228159,0.0001006692,0.07168461,0.000141634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000263476,0.0002098925,0.9951654,0.0005499478,0.0002009052,0.0003015566,0.0003862278,0.0002893687,0.002870352],"genre_scores_gemma":[0.1576386,0.000009171164,0.8380075,0.0007429353,0.0001312599,0.00009098498,0.0005198732,0.00001620919,0.002843403],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9272313,"threshold_uncertainty_score":0.3940815,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1025601907790198,"score_gpt":0.3044313475913842,"score_spread":0.2018711568123644,"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."}}