{"id":"W2311002194","doi":"10.1145/2837019","title":"Byzantine Agreement in Expected Polynomial Time","year":2016,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Computer science; Asynchronous communication; Adversary; Scheduling (production processes); Time complexity; Computation; Fraction (chemistry); Constant (computer programming); Adversary model; Quantum Byzantine agreement; State (computer science); Polynomial; Theoretical computer science; Byzantine fault tolerance; Algorithm; Distributed computing; Mathematics; Mathematical optimization; Computer network; Fault tolerance; Computer security","routes":{"ca_aff":true,"ca_fund":true,"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.007255043,0.001659464,0.002645,0.001080415,0.002680078,0.004094701,0.003640887,0.002382648,0.005990475],"category_scores_gemma":[0.02415221,0.0007712866,0.001448477,0.002137219,0.004086218,0.01039964,0.004840862,0.004709468,0.001862353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003229814,"about_ca_system_score_gemma":0.004681703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001470496,"about_ca_topic_score_gemma":0.002272729,"domain_scores_codex":[0.9888731,0.003564264,0.000497766,0.002116549,0.002702655,0.002245591],"domain_scores_gemma":[0.9757416,0.01532231,0.001794382,0.004674195,0.001624043,0.0008433473],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009816501,0.0003676557,0.0012215,0.0004266341,0.0001697326,0.0002871141,0.0009914859,0.2173005,0.009075728,0.679177,0.009580135,0.0804208],"study_design_scores_gemma":[0.0001706519,0.0001109444,0.00008606478,0.00002254003,0.00003861939,0.0001049817,0.00007508694,0.4470498,0.004454006,0.543695,0.004167071,0.00002518878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03080481,0.0002254058,0.9581211,0.001432545,0.000127975,0.0002148568,0.0001408305,0.001706326,0.007226223],"genre_scores_gemma":[0.6329104,0.0002892609,0.3518996,0.0005591652,0.0002123895,0.0005822977,0.0004292411,0.000627632,0.01249001],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007255043,"threshold_uncertainty_score":0.03836882,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008841307731756204,"score_gpt":0.2204181357576064,"score_spread":0.2115768280258502,"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."}}