{"id":"W2052326735","doi":"10.1006/jpdc.2000.1625","title":"Optimal Broadcasting in Faulty Trees","year":2000,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Computer science; Fault tolerance; Vulnerability (computing); Tree (set theory); Distributed computing; Algorithm; Upper and lower bounds; Computer network; Computer security; Mathematics; Combinatorics","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.001766509,0.000550763,0.002023561,0.00134323,0.002107148,0.002182618,0.001797743,0.001637109,0.0042607],"category_scores_gemma":[0.01676505,0.0009776801,0.000499366,0.002169279,0.002271036,0.003043588,0.001992374,0.001573635,0.0003996773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003100892,"about_ca_system_score_gemma":0.002044232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005091954,"about_ca_topic_score_gemma":0.007448672,"domain_scores_codex":[0.9990073,0.0003336467,0.00004726362,0.0001289856,0.0002280952,0.0002548301],"domain_scores_gemma":[0.9859044,0.01065376,0.0008117398,0.001116412,0.0008975108,0.0006160814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002044567,0.0002003733,0.002363189,0.0004853187,0.00009640044,0.0002938221,0.0006713595,0.5376086,0.009206243,0.3673132,0.01772631,0.0619907],"study_design_scores_gemma":[0.000196544,0.00007239536,0.0004309041,0.00003432834,0.00005225833,0.0000907572,0.0001640552,0.6247976,0.001891003,0.370601,0.001651537,0.00001769559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5878224,0.003193022,0.3687994,0.005114756,0.0004298225,0.00015241,0.000610689,0.001141231,0.03273625],"genre_scores_gemma":[0.943496,0.001166256,0.04618124,0.0002751823,0.0002126505,0.00007622045,0.0003311844,0.0002549884,0.008006215],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005091954,"threshold_uncertainty_score":0.02249861,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01405509122362477,"score_gpt":0.2458713300918413,"score_spread":0.2318162388682165,"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."}}