{"id":"W2160685416","doi":"10.1145/1824777.1824788","title":"Fast asynchronous Byzantine agreement and leader election with full information","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Asynchronous communication; Leader election; Quantum Byzantine agreement; Computer science; Byzantine architecture; Adversary; Protocol (science); Constant (computer programming); Computation; Theoretical computer science; Monte Carlo method; Key (lock); Distributed computing; Computer network; Byzantine fault tolerance; Computer security; Mathematics; Algorithm; Fault tolerance; Statistics","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.003785528,0.0008125292,0.001207542,0.0009053994,0.00167302,0.002413447,0.003298542,0.001845114,0.002382356],"category_scores_gemma":[0.01267453,0.0005796095,0.001028107,0.001201315,0.00340792,0.009725669,0.003930505,0.003648277,0.0007975868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001487828,"about_ca_system_score_gemma":0.001529855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009719432,"about_ca_topic_score_gemma":0.000808258,"domain_scores_codex":[0.9961171,0.001276654,0.0001770224,0.0006330102,0.001225492,0.0005706939],"domain_scores_gemma":[0.9893296,0.00558199,0.001096574,0.002965948,0.000679276,0.0003465696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003579267,0.00009957227,0.0003927235,0.0001432587,0.00003246581,0.000196629,0.0005413103,0.1395553,0.006475946,0.8124792,0.00259265,0.03713309],"study_design_scores_gemma":[0.0001004319,0.0001204393,0.00009643323,0.00002131222,0.00002035528,0.0001084513,0.00005009564,0.4795454,0.007846803,0.5057704,0.006281017,0.00003883079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02558795,0.0002083057,0.9689881,0.0006446706,0.0000847557,0.00008824721,0.00005050156,0.0003883585,0.003959175],"genre_scores_gemma":[0.6287782,0.0005859769,0.3595151,0.0003852743,0.0003144827,0.0005265126,0.0001484758,0.0002853482,0.009460616],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003785528,"threshold_uncertainty_score":0.02002001,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006362793586701465,"score_gpt":0.2146225370539929,"score_spread":0.2082597434672915,"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."}}