{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01250899,0.003142985,0.004555904,0.002215142,0.004869408,0.007200606,0.007763276,0.004449704,0.02015405],"category_scores_gemma":[0.05059888,0.001296819,0.002632231,0.003526571,0.005577095,0.02525437,0.01169534,0.009324308,0.004527632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005830807,"about_ca_system_score_gemma":0.005973432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002038851,"about_ca_topic_score_gemma":0.00217367,"domain_scores_codex":[0.98216,0.003887931,0.0007703475,0.002902578,0.006502853,0.003776214],"domain_scores_gemma":[0.9394768,0.04087729,0.003161556,0.0105616,0.003524239,0.002398445],"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.002776938,0.0005799588,0.002657603,0.001446161,0.0003204145,0.0005870176,0.0009784406,0.32829,0.01217136,0.5544799,0.0312912,0.06442105],"study_design_scores_gemma":[0.0002826851,0.0002351406,0.0002867234,0.0001225529,0.0001030578,0.0002326008,0.0001386961,0.5212764,0.003908657,0.4674059,0.005958776,0.0000487805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07856243,0.003300161,0.8494763,0.01254574,0.000570118,0.00067054,0.00177747,0.005754535,0.0473427],"genre_scores_gemma":[0.8364215,0.002427658,0.1330984,0.001985196,0.0009646952,0.001485412,0.003052416,0.001791605,0.01877312],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02015405,"threshold_uncertainty_score":0.06742203,"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."}}