{"id":"W2733710724","doi":"10.1109/ipdps.2017.36","title":"Corrected Gossip Algorithms for Fast Reliable Broadcast on Unreliable Systems","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Ontario Council on Graduate Studies, Council of Ontario Universities","keywords":"Gossip; Computer science; Latency (audio); Broadcasting (networking); Distributed computing; Gossip protocol; Algorithm; Las vegas; Reliability (semiconductor); Computer network; Scalability; Telecommunications","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004242761,0.0002412215,0.0003653725,0.00006011143,0.0009883966,0.001860886,0.001929971,0.0001318229,0.00001151308],"category_scores_gemma":[0.0001176507,0.0001965429,0.0001087532,0.0001359141,0.00005360123,0.0007311973,0.0001987272,0.0001342694,0.0002818153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007375863,"about_ca_system_score_gemma":0.0000849834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009894045,"about_ca_topic_score_gemma":0.00001319278,"domain_scores_codex":[0.9980291,0.00002441288,0.0003767398,0.0006578342,0.000347946,0.0005640112],"domain_scores_gemma":[0.9972077,0.00009441456,0.0003057524,0.001912109,0.0003001694,0.0001798316],"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.00007380301,0.0004118687,0.0008040284,0.0002403636,0.000100215,0.00005118471,0.0002941786,0.005118036,0.0007131264,0.2831132,0.604861,0.104219],"study_design_scores_gemma":[0.001006395,0.0002228432,0.0006612361,0.0002208759,0.000005378515,0.00002238817,0.0000570204,0.600942,0.0006762774,0.0002021466,0.3956388,0.0003446633],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008596097,0.000182241,0.9243412,0.0005431993,0.007482733,0.0008135985,0.00009688189,0.0004126684,0.06526789],"genre_scores_gemma":[0.8573018,0.00002568927,0.02470944,0.0003805522,0.0007574587,0.0004106515,0.00004458407,0.0000498729,0.1163199],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8996317,"threshold_uncertainty_score":0.9991753,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03612847852043521,"score_gpt":0.2904677314147319,"score_spread":0.2543392528942967,"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."}}