{"id":"W2621329446","doi":"","title":"Fast asynchronous byzantine agreement and leader election with full information","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Leader election; Asynchronous communication; Quantum Byzantine agreement; Computer science; Protocol (science); Adversary; Constant (computer programming); Computation; Byzantine architecture; Theoretical computer science; Distributed computing; Computer network; Byzantine fault tolerance; Computer security; Algorithm; Fault tolerance","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.00006240267,0.00007603624,0.0000808482,0.00004146604,0.0001248159,0.00007929488,0.0001077305,0.00002534162,0.00001058605],"category_scores_gemma":[0.000002401734,0.00005482175,0.00001058841,0.0001860647,0.00002499301,0.001023836,0.00002981347,0.00004684448,0.00006384758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001230894,"about_ca_system_score_gemma":0.00002804741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007286072,"about_ca_topic_score_gemma":0.00002990641,"domain_scores_codex":[0.9994202,0.000009440681,0.0001421961,0.0001182705,0.0001692137,0.0001406987],"domain_scores_gemma":[0.9996612,0.000005240314,0.00005800935,0.0001558576,0.00007540994,0.00004429954],"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.0001252151,0.000341091,0.01715687,0.0001947182,0.0001329244,0.0000590328,0.008916833,0.001389596,0.002258429,0.07369006,0.03713988,0.8585954],"study_design_scores_gemma":[0.006635845,0.002900452,0.1795074,0.0001807283,0.00002149079,0.004178983,0.000955103,0.474399,0.01111227,0.000167654,0.3182713,0.001669693],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05874442,0.0000378055,0.9304599,0.0004236827,0.00007059812,0.0001136862,0.000001360087,0.00008425597,0.01006434],"genre_scores_gemma":[0.9909173,0.00001353167,0.008480264,0.0001977698,0.00002599716,0.000009026682,0.000007025343,0.000001688748,0.0003473744],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9321729,"threshold_uncertainty_score":0.2235566,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007174048911562459,"score_gpt":0.1880584237868906,"score_spread":0.1808843748753282,"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."}}