{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005469692,0.0001057971,0.0002542762,0.00008358416,0.0001071698,0.0001770813,0.0002902136,0.00005143077,0.00001666372],"category_scores_gemma":[0.00002985762,0.0000865894,0.00007596153,0.0002593209,0.00001910053,0.0002989156,0.00005734127,0.0002337407,0.000003354453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003357654,"about_ca_system_score_gemma":0.00002776053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002621778,"about_ca_topic_score_gemma":0.000006321417,"domain_scores_codex":[0.9987813,0.00008838753,0.0005807948,0.0001459721,0.0001682406,0.000235299],"domain_scores_gemma":[0.9993743,0.0001155325,0.0002366111,0.00009791106,0.00008281781,0.00009282263],"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.00004732133,0.00007823003,0.008669943,0.00001147293,0.00002849158,0.0001996096,0.0009466439,0.8666677,0.00004792981,0.001679875,0.001021293,0.1206015],"study_design_scores_gemma":[0.0009010473,0.0001425495,0.0208151,0.0001681056,0.00000386964,0.0009020066,0.0001894751,0.97368,0.000007489904,0.0002261169,0.002831388,0.0001329212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4929255,0.0002920275,0.5060219,0.0001859892,0.0001615151,0.00002612667,9.281185e-7,0.00001411841,0.000371927],"genre_scores_gemma":[0.9866602,0.00002457781,0.01298098,0.00005539411,0.0002318864,2.610092e-7,0.000001194115,0.000003296969,0.00004224007],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4937347,"threshold_uncertainty_score":0.3531013,"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."}}