{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003764681,0.00005943387,0.0001415046,0.00004972004,0.00002810522,0.00003796775,0.002502213,0.00002478559,0.00002798985],"category_scores_gemma":[0.0002933529,0.00002675225,0.00008394693,0.0001888054,0.00001625961,0.0002431882,0.0004312232,0.00007641063,0.00005421693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003627363,"about_ca_system_score_gemma":0.00005189419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006998934,"about_ca_topic_score_gemma":0.000002988755,"domain_scores_codex":[0.9991369,0.00006617895,0.0003304136,0.00007864789,0.0002494919,0.0001384202],"domain_scores_gemma":[0.9988059,0.00005476582,0.0002844056,0.0007428239,0.0000699958,0.00004209327],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"observational","study_design_scores_codex":[0.0001602847,0.0004738555,0.02528597,0.00001557184,0.0001287716,0.0002172361,0.001426068,0.0001022519,0.3314344,0.002166978,0.5371075,0.1014811],"study_design_scores_gemma":[0.01256079,0.0006817709,0.4818314,0.002184197,0.0000313668,0.001220505,0.00009842794,0.003052542,0.05279157,0.004963133,0.4397582,0.0008261701],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.92224,0.0003719517,0.02241874,0.05116952,0.002075951,0.0001389014,0.000006918746,0.00001804821,0.001559969],"genre_scores_gemma":[0.9964904,0.000006614415,0.001982367,0.0001336455,0.0001993528,6.419326e-7,3.644056e-8,0.000002547273,0.001184363],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4565454,"threshold_uncertainty_score":0.4649777,"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."}}