{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002151471,0.0003472066,0.0007209205,0.0004114835,0.001464913,0.001527895,0.002021833,0.001006749,0.00480054],"category_scores_gemma":[0.006190068,0.0004823952,0.000542424,0.0004698978,0.002038152,0.002626705,0.002657872,0.002419891,0.0006776633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007561726,"about_ca_system_score_gemma":0.001364324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002125843,"about_ca_topic_score_gemma":0.002258133,"domain_scores_codex":[0.9990979,0.0002676413,0.0000465929,0.0001220107,0.0002953317,0.0001704496],"domain_scores_gemma":[0.9965472,0.001202076,0.0002225261,0.001323405,0.0004778875,0.0002269349],"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.0007926669,0.0001483286,0.0006806835,0.0001784221,0.00004795127,0.0002402899,0.0005376394,0.06810389,0.01067241,0.840547,0.006338654,0.07171211],"study_design_scores_gemma":[0.0001230037,0.0001049159,0.0002954376,0.0000140045,0.00003676227,0.00008828925,0.0001003717,0.5226378,0.003653638,0.4678107,0.005112098,0.0000229561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04229778,0.0003319054,0.9480565,0.0008125099,0.0002697996,0.00007218179,0.00003442121,0.0009568969,0.007167852],"genre_scores_gemma":[0.7856138,0.0002799706,0.1967836,0.0002770999,0.000170435,0.0001851052,0.0001207813,0.0002738445,0.01629521],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00480054,"threshold_uncertainty_score":0.01605934,"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."}}