{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000786978,0.0006456936,0.0006590412,0.0003241037,0.0003036672,0.0007838688,0.003157155,0.000300764,0.00004129217],"category_scores_gemma":[0.00003582645,0.0005135711,0.0001070266,0.0007632438,0.000476511,0.002692248,0.0009443062,0.0006439188,0.0001665917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002936685,"about_ca_system_score_gemma":0.0007395343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001705873,"about_ca_topic_score_gemma":0.0001247379,"domain_scores_codex":[0.9955471,0.00002475068,0.0007707974,0.001179034,0.001571057,0.0009073323],"domain_scores_gemma":[0.9968549,0.00008639165,0.0006314335,0.001617319,0.0006388903,0.000171065],"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.00007958294,0.0001144107,0.0002180415,0.000273905,0.00006778938,0.0001268601,0.00363962,0.02335677,0.0002740518,0.2095924,0.0008637198,0.7613928],"study_design_scores_gemma":[0.003299794,0.001985789,0.0005382536,0.004572909,0.00004485509,0.0005618162,0.000001868834,0.5374287,0.005421574,0.1162161,0.3258116,0.00411667],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007508126,0.0003621139,0.97431,0.0004920355,0.001422329,0.0005599342,0.0000201397,0.0001877175,0.02257069],"genre_scores_gemma":[0.213625,0.0001042602,0.7819817,0.002808564,0.0004869057,0.00004598296,0.00003418518,0.00004675622,0.0008666672],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7572762,"threshold_uncertainty_score":0.9997316,"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."}}