{"id":"W2775875217","doi":"10.1007/s004530010030","title":"Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes","year":2000,"lang":"en","type":"article","venue":"Algorithmica","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Computer science; Binary logarithm; Bounded function; Parallel computing; Logarithm; Fault tolerance; Constant (computer programming); Fraction (chemistry); Theory of computation; Fault (geology); Log-log plot; Algorithm; Distributed computing; Combinatorics; Computer network; 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.0001458122,0.0001072583,0.0001780852,0.00005064137,0.0001148864,0.00007409378,0.0002491311,0.00005332673,0.00008663377],"category_scores_gemma":[0.00000557763,0.00008656721,0.00004984016,0.0002582994,0.00004205313,0.0003931595,0.00002824201,0.0001219078,0.0000369791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003812327,"about_ca_system_score_gemma":0.00003651295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003135697,"about_ca_topic_score_gemma":0.00000754749,"domain_scores_codex":[0.9990699,0.00005448728,0.0002145552,0.0002603954,0.0002057689,0.0001948552],"domain_scores_gemma":[0.999416,0.00006711148,0.0001055554,0.0002481954,0.0001155768,0.00004757298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002078941,0.0002207612,0.0002355668,0.00002364719,0.0001878103,0.0000510944,0.002490895,0.02181422,0.0006481871,0.01099823,0.001093331,0.9620284],"study_design_scores_gemma":[0.0004122284,0.0003589606,0.0005047897,0.00008149787,0.000007974683,0.0001437643,0.0002368771,0.9922103,0.001921168,0.0002992729,0.003645002,0.0001781869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1601345,0.00003714287,0.8337482,0.0000720178,0.0001307241,0.0001026303,0.000001990845,0.00008985641,0.005682948],"genre_scores_gemma":[0.8848789,0.000003127641,0.1145154,0.00005040222,0.0001463535,0.00001007858,0.000001242034,0.00000744567,0.0003870657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.970396,"threshold_uncertainty_score":0.3530108,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01202143967767633,"score_gpt":0.2213692116342165,"score_spread":0.2093477719565401,"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."}}