{"id":"W1994064073","doi":"10.1016/j.parco.2006.08.007","title":"Quasi-atomic recovery for distributed agents","year":2006,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Correctness; Distributed computing; Asynchronous communication; Protocol (science); Overhead (engineering); Two-phase commit protocol; Simple (philosophy); Locality; Computer network; Algorithm; Operating system; Distributed transaction; Transaction processing; Database transaction; Programming language","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.0003770552,0.0002029666,0.0002912481,0.0000586641,0.0002917218,0.0002919519,0.0007891442,0.00008019467,0.000002632253],"category_scores_gemma":[0.00003775909,0.0002036857,0.0001632594,0.0003185539,0.00002256492,0.0002637028,0.0001757305,0.0001032051,0.00005171145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008439652,"about_ca_system_score_gemma":0.00003736286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001285169,"about_ca_topic_score_gemma":0.00001111113,"domain_scores_codex":[0.998193,0.0000571452,0.0004783078,0.0005129747,0.0002204704,0.0005381492],"domain_scores_gemma":[0.998955,0.0001680335,0.0002245283,0.0004620058,0.0001127059,0.00007775579],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001709731,0.001729061,0.01433414,0.0004957834,0.0001959656,0.00009323308,0.000513608,0.2270794,0.000725831,0.2537564,0.357627,0.1432786],"study_design_scores_gemma":[0.001068276,0.0001174915,0.008652646,0.00005851294,0.000006614216,0.00002067388,0.00001108315,0.9288746,0.00008663593,0.006651141,0.05408894,0.0003634021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03296838,0.0002156236,0.9638891,0.0004139568,0.001016484,0.0003548172,0.00006068176,0.00031226,0.000768666],"genre_scores_gemma":[0.9482287,0.000001738734,0.05089821,0.0002083155,0.000314346,0.00002020024,0.0001421163,0.00001430372,0.0001720204],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9152604,"threshold_uncertainty_score":0.8306062,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01765791351258682,"score_gpt":0.2589437906140779,"score_spread":0.2412858771014911,"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."}}