{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001588315,0.0007154216,0.00116931,0.0009511381,0.0008525212,0.001532379,0.001554806,0.001357591,0.001162477],"category_scores_gemma":[0.008685489,0.0004646571,0.0007426172,0.0008614262,0.001769513,0.002519706,0.001386844,0.001340523,0.0003840247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001338553,"about_ca_system_score_gemma":0.001404321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002436552,"about_ca_topic_score_gemma":0.001102888,"domain_scores_codex":[0.9986261,0.0003399457,0.00005793322,0.0002071173,0.00046693,0.0003019607],"domain_scores_gemma":[0.9929098,0.004474371,0.0008942965,0.0008921605,0.0006773142,0.000152133],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005433955,0.0000750344,0.002680795,0.0003240634,0.00008109448,0.0002832217,0.0005870091,0.7820231,0.03500927,0.09703647,0.001853776,0.07950281],"study_design_scores_gemma":[0.00004605539,0.0001031323,0.0001847723,0.00001641044,0.00002507508,0.0001167596,0.00003225457,0.9608064,0.008042756,0.02919726,0.001417079,0.00001201098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1057983,0.000358617,0.8908591,0.0002586064,0.00003314218,0.00009550586,0.00005200518,0.000731,0.001813655],"genre_scores_gemma":[0.7641826,0.0005670974,0.231224,0.0001348963,0.00009967445,0.0002158723,0.0001661131,0.0002095453,0.003200135],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002436552,"threshold_uncertainty_score":0.009711981,"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."}}