{"id":"W2561500882","doi":"10.1109/edcc.2016.17","title":"A Performance Comparison of Algorithms for Byzantine Agreement in Distributed Systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum Byzantine agreement; Testbed; Computer science; Latency (audio); Algorithm; Byzantine fault tolerance; Distributed algorithm; Randomized algorithm; Key (lock); Algorithm design; Distributed computing; Fault tolerance; Computer network","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.0003904378,0.0001241406,0.0003520586,0.00006868719,0.00003661314,0.00003610563,0.0005580661,0.00005207897,0.000004845904],"category_scores_gemma":[0.00002452248,0.00007742667,0.00005290418,0.0003125679,0.00002875449,0.000286776,0.00008677872,0.0000337589,0.00001411677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003470725,"about_ca_system_score_gemma":0.00003502139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007219709,"about_ca_topic_score_gemma":0.00001396712,"domain_scores_codex":[0.998537,0.00002889372,0.0006012521,0.0002914218,0.0002415198,0.000299894],"domain_scores_gemma":[0.9990801,0.00009384652,0.0001959794,0.0004182789,0.0001541932,0.00005764389],"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.0001521893,0.001567559,0.276562,0.001142633,0.0001283831,0.000008753424,0.000894202,0.003988858,0.01448925,0.1949112,0.02234625,0.4838086],"study_design_scores_gemma":[0.002189304,0.0002721242,0.01486496,0.000423133,0.000003609932,0.000004227815,0.00007520887,0.9491047,0.004826172,0.00002791669,0.02796961,0.0002390608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0631775,0.0001554413,0.9346846,0.0003169155,0.0003926159,0.0004503797,0.0001188979,0.00004893012,0.000654658],"genre_scores_gemma":[0.9952032,0.000009407702,0.004241427,0.000008732409,0.00003251962,0.00008760656,0.00001233066,0.000004302352,0.000400468],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9451158,"threshold_uncertainty_score":0.3157368,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03311945545120502,"score_gpt":0.2890089048919372,"score_spread":0.2558894494407322,"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."}}