{"id":"W2034109654","doi":"10.1007/s00446-008-0069-x","title":"Lower bound for scalable Byzantine Agreement","year":2008,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria; University of Waterloo","funders":"","keywords":"Computer science; Scalability; Omega; Upper and lower bounds; Binary logarithm; String (physics); Parallel computing; Combinatorics; Discrete mathematics; Mathematics; Physics; Operating system","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.01237664,0.003858949,0.006260192,0.003341338,0.006522413,0.01034369,0.009901251,0.005197372,0.02906808],"category_scores_gemma":[0.04960419,0.001677825,0.002378206,0.005768336,0.0052918,0.02610046,0.01337742,0.01328741,0.006193316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007163005,"about_ca_system_score_gemma":0.009600716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003151412,"about_ca_topic_score_gemma":0.004814119,"domain_scores_codex":[0.9851075,0.002831099,0.0005373533,0.001950132,0.006178004,0.00339595],"domain_scores_gemma":[0.9471688,0.03472018,0.00173221,0.01030394,0.003782459,0.002292474],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002637557,0.0005048899,0.0009802984,0.0009901389,0.0002311147,0.0002132548,0.0007869541,0.1273451,0.006403559,0.7350034,0.05452098,0.07038272],"study_design_scores_gemma":[0.0002261168,0.000155097,0.0002231847,0.00009743672,0.0001137019,0.00009399379,0.0001202788,0.2900317,0.002388302,0.7004599,0.006042546,0.000047727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06011786,0.004335816,0.8134137,0.01649726,0.001570881,0.0006397493,0.002394816,0.006090998,0.09493899],"genre_scores_gemma":[0.7645482,0.003193957,0.1790758,0.003288412,0.002010622,0.001607113,0.003445656,0.002893444,0.0399368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02906808,"threshold_uncertainty_score":0.09724241,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02167600237742189,"score_gpt":0.2504902375396287,"score_spread":0.2288142351622068,"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."}}