{"id":"W1760381732","doi":"10.1007/978-3-642-17679-1_18","title":"Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scalability; Asynchronous communication; Constant (computer programming); Fraction (chemistry); Byzantine fault tolerance; Quantum Byzantine agreement; Distributed computing; Set (abstract data type); Binary logarithm; Parallel computing; Theoretical computer science; Computer network; Discrete mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001386234,0.0006591716,0.001557054,0.0007196821,0.00164047,0.001871089,0.002044976,0.0009996397,0.005060635],"category_scores_gemma":[0.002638065,0.0004007201,0.0003683757,0.00116663,0.0007823876,0.003487308,0.003012239,0.001147011,0.001366179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006730346,"about_ca_system_score_gemma":0.001159254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008373209,"about_ca_topic_score_gemma":0.00153367,"domain_scores_codex":[0.9986867,0.0003186415,0.00007864644,0.0002409314,0.0005009721,0.0001740575],"domain_scores_gemma":[0.9983404,0.0005581927,0.0001125367,0.0006367211,0.0002741824,0.00007795848],"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.002431279,0.0005278211,0.0006838324,0.0007996039,0.0001637124,0.0003528726,0.0008881976,0.1615143,0.120588,0.1791914,0.02143331,0.5114258],"study_design_scores_gemma":[0.0002332473,0.0003293705,0.0002641863,0.00004526692,0.0000501061,0.0001593608,0.0001449315,0.8372969,0.0353606,0.1143217,0.01174642,0.00004786144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04857208,0.0008140067,0.9353818,0.0004644732,0.0003179182,0.0003644266,0.0003703887,0.002054814,0.01166001],"genre_scores_gemma":[0.6580291,0.0003909082,0.3239282,0.0001995597,0.0002009642,0.0004625013,0.0005033516,0.0002180102,0.01606731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005060635,"threshold_uncertainty_score":0.01692957,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01137290983214445,"score_gpt":0.2202480344864702,"score_spread":0.2088751246543258,"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."}}