{"id":"W1542807488","doi":"10.1007/978-3-642-04355-0_47","title":"From Almost Everywhere to Everywhere: Byzantine Agreement with $\\tilde{O}(n^{3/2})$ Bits","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scalability; Leader election; Adversary; Set (abstract data type); Byzantine fault tolerance; Theoretical computer science; Distributed computing; Discrete mathematics; Parallel computing; Algorithm; Computer security; Fault tolerance; Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006842424,0.0009734763,0.0008503541,0.0009910017,0.0003661693,0.0009922903,0.005379704,0.0003952851,0.0001071081],"category_scores_gemma":[0.00005052616,0.0008199803,0.0001896056,0.001661556,0.0004722716,0.00108222,0.001895117,0.001015884,0.0001741104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001764861,"about_ca_system_score_gemma":0.0005461709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002605949,"about_ca_topic_score_gemma":0.0008299897,"domain_scores_codex":[0.9933122,0.0000520266,0.0006958656,0.002923837,0.001913552,0.001102515],"domain_scores_gemma":[0.9954947,0.0003570308,0.0003581407,0.002938786,0.000341,0.0005104086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000653195,0.0001578988,0.0002758248,0.00003585358,0.00005293588,0.0004214327,0.00162376,0.005412642,0.0002677026,0.01977493,0.0009579178,0.9709538],"study_design_scores_gemma":[0.004515117,0.005548126,0.008874414,0.007034416,0.0001730223,0.0004707455,0.000004094793,0.1422736,0.0100098,0.5560315,0.2548876,0.01017764],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007477026,0.000740048,0.9903367,0.001964522,0.001211697,0.0007608997,0.0000868535,0.0002472002,0.003904395],"genre_scores_gemma":[0.07713414,0.0001108574,0.913584,0.007396667,0.001303492,0.00001972358,0.0000832469,0.0000664097,0.000301494],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9607762,"threshold_uncertainty_score":0.9996919,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01089534181439466,"score_gpt":0.2263157482643426,"score_spread":0.2154204064499479,"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."}}