{"id":"W2047109080","doi":"10.1145/1146381.1146424","title":"Lower bound for scalable Byzantine Agreement","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Scalability; Computer science; Upper and lower bounds; Parallel computing; String (physics); Binary logarithm; Constant (computer programming); Set (abstract data type); Computation; Theoretical computer science; Discrete mathematics; Algorithm; 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":[],"consensus_categories":[],"category_scores_codex":[0.0001675028,0.00008380633,0.0001102394,0.00002299886,0.00009751398,0.0002005248,0.0003581853,0.00003009382,0.00004584257],"category_scores_gemma":[0.000004606114,0.00006747544,0.00005654041,0.0001563136,0.00001425508,0.0002230648,0.00005792884,0.00002488792,0.0001189051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001116078,"about_ca_system_score_gemma":0.00002221863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001772177,"about_ca_topic_score_gemma":0.00004636656,"domain_scores_codex":[0.9991422,0.000007040383,0.0001923504,0.0002481288,0.000154774,0.0002554618],"domain_scores_gemma":[0.9994799,0.00002114238,0.00004450982,0.0003327061,0.00008422343,0.00003749555],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000005427217,0.000190582,0.0004948665,0.00002282643,0.000009264973,0.000005705812,0.00001212271,0.0001681456,0.001233128,0.6734787,0.3180604,0.006318843],"study_design_scores_gemma":[0.0006011405,0.00006972774,0.001437676,0.00001468507,0.00000232511,0.000004808391,0.000003941303,0.05338698,0.00227418,0.002784334,0.9392475,0.0001727343],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004624429,0.000113127,0.9269633,0.0009144913,0.000523188,0.0002129392,0.00001041265,0.0001007263,0.06653743],"genre_scores_gemma":[0.9253971,0.000001231913,0.03161084,0.0003335021,0.0001939365,0.00004627211,0.00001401169,0.000005651542,0.04239746],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9207727,"threshold_uncertainty_score":0.2751569,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01040595482825069,"score_gpt":0.2323617516463279,"score_spread":0.2219557968180772,"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."}}