{"id":"W2103265299","doi":"10.1109/icpads.1997.652622","title":"Universally fault-tolerant broadcasting in trees","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Fault tolerance; Computer science; Vulnerability (computing); Upper and lower bounds; Tree (set theory); Binary logarithm; Constant (computer programming); Time complexity; Scheme (mathematics); Distributed computing; Node (physics); Computer network; Combinatorics; Theoretical computer science; Discrete mathematics; Mathematics; Algorithm; Computer security; Physics","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.0001216068,0.00006208642,0.00008869606,0.00008517054,0.00004427219,0.00008690411,0.0002985952,0.00003221337,0.0001532896],"category_scores_gemma":[0.000007450065,0.00005234764,0.00003188869,0.0002650441,0.000007860401,0.0002820299,0.00005617352,0.00007101326,0.0001190309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003057933,"about_ca_system_score_gemma":0.000004251121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001916449,"about_ca_topic_score_gemma":0.0007941798,"domain_scores_codex":[0.9993596,0.00004028107,0.0001544195,0.0001799252,0.00009793247,0.0001678074],"domain_scores_gemma":[0.9996857,0.00004423293,0.00002978558,0.0001814696,0.00002559015,0.0000332212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009853616,0.0003277746,0.01655638,0.00002562466,0.00004063044,0.0004637356,0.01584306,0.07268856,0.001011041,0.4398873,0.04098572,0.4121603],"study_design_scores_gemma":[0.0001953091,0.00002706609,0.0009591511,0.0000230394,3.332661e-7,0.00002302159,0.0001281045,0.9892327,0.00003361829,0.00007932044,0.009216056,0.00008225278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07383052,0.0001213781,0.7280163,0.0009892135,0.0008076497,0.0001029268,1.845233e-7,0.00023258,0.1958992],"genre_scores_gemma":[0.9910232,0.000003916966,0.002111359,0.0001691297,0.00005989792,0.000001568942,8.967309e-8,0.000002929683,0.006627903],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9171927,"threshold_uncertainty_score":0.2134675,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02445253549101838,"score_gpt":0.2054253432772544,"score_spread":0.180972807786236,"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."}}