{"id":"W4403358062","doi":"10.1007/978-3-031-64948-6_13","title":"Byzantine Protocols with Asymptotically Optimal Communication Complexity","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Byzantine architecture; Computer science; Asymptotically optimal algorithm; History; Algorithm; Ancient history","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.0004354328,0.0003114174,0.0004321079,0.0001406949,0.0007797499,0.0005214488,0.002782936,0.0001898017,8.189584e-7],"category_scores_gemma":[0.00002358254,0.0002226561,0.0001614375,0.000286777,0.0006902199,0.0004162429,0.001061846,0.0005205179,0.000001549763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004626945,"about_ca_system_score_gemma":0.0001931457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002350058,"about_ca_topic_score_gemma":0.00005754589,"domain_scores_codex":[0.9985237,0.00001227628,0.0006815159,0.0002044511,0.0003365022,0.0002415519],"domain_scores_gemma":[0.9980396,0.0001966246,0.0004436227,0.001001859,0.000263116,0.00005518003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002464122,0.00001635802,0.00000172532,0.0003641347,0.0000853801,1.53128e-7,0.0007571459,0.3778306,0.000003261459,0.616315,0.00009402529,0.004529779],"study_design_scores_gemma":[0.0002516737,0.0001191626,0.00003005524,0.001087592,0.00004051449,0.00003035408,0.000003306003,0.9010113,0.00003740312,0.002363371,0.09466697,0.0003582512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003795077,0.0002933778,0.9892584,0.001673505,0.000177889,0.002740481,0.0001131001,0.0001230311,0.005582269],"genre_scores_gemma":[0.007808575,0.00002928374,0.9914182,0.0001082897,0.00008080692,0.0003152439,0.00005864145,0.00002007513,0.0001608744],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6139516,"threshold_uncertainty_score":0.9079651,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02906820777206574,"score_gpt":0.2605725258500938,"score_spread":0.231504318078028,"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."}}