{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002388235,0.001005765,0.001509158,0.0008667434,0.0009905311,0.001338776,0.002599785,0.001827053,0.002938504],"category_scores_gemma":[0.0214901,0.0008437193,0.000591385,0.001157701,0.001803782,0.003537726,0.002680729,0.001448078,0.000493906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001878826,"about_ca_system_score_gemma":0.001539308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001915977,"about_ca_topic_score_gemma":0.002706426,"domain_scores_codex":[0.9984182,0.0005474807,0.00008360444,0.0003851475,0.0002615173,0.0003041365],"domain_scores_gemma":[0.979471,0.01546541,0.0009168722,0.002625652,0.001064715,0.0004563016],"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.002337013,0.0001807058,0.001505436,0.0004850486,0.0001003958,0.0002227489,0.0003469046,0.8301213,0.01835439,0.0615513,0.00520387,0.07959083],"study_design_scores_gemma":[0.0001721097,0.00009152705,0.0002345292,0.00001898009,0.00004452181,0.00007830822,0.00005847957,0.9476047,0.003803173,0.04717788,0.0007012631,0.0000144315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1477618,0.0006377999,0.8423121,0.001458404,0.000157394,0.0001288456,0.0002259358,0.0008914368,0.006426389],"genre_scores_gemma":[0.8604137,0.000375846,0.1330999,0.000233079,0.0001485329,0.0002169717,0.0001912935,0.0001588118,0.005161883],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002938504,"threshold_uncertainty_score":0.01363194,"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."}}