{"id":"W2071898078","doi":"10.1142/s0129054106004492","title":"FAST BROADCASTING WITH BYZANTINE FAULTS","year":2006,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Correctness; Broadcasting (networking); Quantum Byzantine agreement; Computer science; Binary logarithm; Byzantine fault tolerance; Robustness (evolution); Log-log plot; Node (physics); Algorithm; Blocking (statistics); Distributed computing; Computer network; Fault tolerance; Theoretical computer science; Discrete mathematics; 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.0006376004,0.0001060904,0.00018073,0.0004324758,0.0001260762,0.0003685376,0.002535133,0.00001979176,0.000005010785],"category_scores_gemma":[0.00003917332,0.00008311281,0.00007106357,0.0008114743,0.0002744925,0.002087331,0.0002068033,0.0001098655,0.000005627378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005326447,"about_ca_system_score_gemma":0.0003931726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004814681,"about_ca_topic_score_gemma":0.000007373745,"domain_scores_codex":[0.9976733,0.00002286839,0.0006379944,0.000212803,0.00126922,0.0001837819],"domain_scores_gemma":[0.9960634,0.00008014338,0.0008068959,0.000259363,0.002721929,0.00006826202],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008623649,0.00100481,0.01983188,0.0000297988,0.0001858256,0.0003228049,0.0009968458,0.1520211,0.01711142,0.4399168,0.001919711,0.3665727],"study_design_scores_gemma":[0.003783362,0.0009661683,0.1577548,0.001058487,0.00002646096,0.00535786,0.00006721242,0.7871905,0.01409601,0.005285088,0.02368897,0.0007250786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08739621,0.00003165545,0.9090262,0.0008243803,0.001285937,0.00004557223,0.000005072772,0.0000180861,0.001366883],"genre_scores_gemma":[0.8068914,0.000001931304,0.1927447,0.00004246578,0.0002801948,5.472072e-7,0.000001723707,0.000002930289,0.000034156],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7194952,"threshold_uncertainty_score":0.4710951,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008157644065646001,"score_gpt":0.2592890208855335,"score_spread":0.2511313768198875,"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."}}