{"id":"W1967908173","doi":"10.1007/s00446-012-0162-z","title":"The correctness proof of Ben-Or’s randomized consensus algorithm","year":2012,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Correctness; Computer science; Randomized algorithm; Mathematical proof; Algorithm; Asynchronous communication; Adversary model; Message passing; Distributed algorithm; Process (computing); Theoretical computer science; Adversary; Mathematics; Distributed computing; Programming language; Computer security","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.002563889,0.0002604694,0.0007022837,0.00004547714,0.0004819943,0.0001926503,0.001169692,0.0001012148,0.000003880634],"category_scores_gemma":[0.0005024263,0.0001609085,0.0002254524,0.0007842351,0.0002665587,0.0001592736,0.0002762981,0.0002313452,0.000009650431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000059165,"about_ca_system_score_gemma":0.0001211633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006144887,"about_ca_topic_score_gemma":0.00000264003,"domain_scores_codex":[0.9970387,0.0004809118,0.0009087874,0.0003244502,0.0004725972,0.0007745735],"domain_scores_gemma":[0.9961504,0.001909255,0.0006208143,0.000773053,0.0003675393,0.0001788927],"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.002698973,0.0005897211,0.001972621,0.0001547611,0.0005449711,0.00004239227,0.002450969,0.003833033,0.0002041211,0.1380569,0.0109793,0.8384722],"study_design_scores_gemma":[0.02330962,0.00005249243,0.0006711123,0.0001735176,0.00004014913,0.0001464801,0.0003079181,0.9601002,0.003822225,0.0005570307,0.01037856,0.0004406872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008094969,0.001373904,0.9869502,0.0002863564,0.001978626,0.0006244184,0.0001248466,0.0001763224,0.0003903399],"genre_scores_gemma":[0.9914011,0.000006583343,0.008224578,0.00004290297,0.0002020617,0.00002477542,0.0000376649,0.00001243588,0.00004787568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9833062,"threshold_uncertainty_score":0.6561657,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01483399648761171,"score_gpt":0.2609815734317931,"score_spread":0.2461475769441814,"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."}}