{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001314665,0.000149493,0.0001266366,0.0001179407,0.0002510529,0.000215678,0.000307437,0.00007901488,0.00003566044],"category_scores_gemma":[0.000005832305,0.0001229153,0.00003153078,0.0003396366,0.00004718131,0.001113136,0.000007448446,0.0003028224,0.00006946213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001781261,"about_ca_system_score_gemma":0.00004082089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008501959,"about_ca_topic_score_gemma":0.0001327442,"domain_scores_codex":[0.9990579,0.00001572641,0.0002116033,0.0002306889,0.0002603826,0.0002236253],"domain_scores_gemma":[0.999178,0.00002559085,0.00008009972,0.000510926,0.0001130028,0.00009239032],"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.00001687644,0.00009248512,0.0000226605,0.00001329371,0.00002757236,0.000002418141,0.0004203891,0.000315585,0.0009103324,0.0004970579,0.00009529811,0.997586],"study_design_scores_gemma":[0.01144678,0.005571713,0.02774808,0.0003293493,0.000164815,0.002467877,0.001536557,0.6627895,0.05643116,0.001356419,0.227021,0.003136709],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01224782,0.00001338802,0.9849361,0.001338581,0.0005125112,0.0002122732,0.00001919505,0.0001383426,0.0005818452],"genre_scores_gemma":[0.907352,0.00001671919,0.09212033,0.0002104011,0.00006224782,0.0000591699,0.00001172978,0.000007335948,0.0001600301],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9944493,"threshold_uncertainty_score":0.5012342,"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."}}