{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001174213,0.0003272004,0.0007494318,0.0004973806,0.001248379,0.001016704,0.0010223,0.0007270489,0.001020492],"category_scores_gemma":[0.00588965,0.0002461153,0.0004232897,0.001259012,0.001161404,0.002832209,0.001233983,0.0007191652,0.0002521004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001469999,"about_ca_system_score_gemma":0.0009622566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003155489,"about_ca_topic_score_gemma":0.002818257,"domain_scores_codex":[0.9990531,0.0002223209,0.00006339391,0.0001489901,0.0002201582,0.000292036],"domain_scores_gemma":[0.9961838,0.002020746,0.0005424315,0.0007039732,0.0003645052,0.0001845091],"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.0009753898,0.00009167576,0.002669497,0.0004464106,0.00007870055,0.0004546124,0.001548694,0.5173787,0.0527663,0.2942084,0.003088563,0.126293],"study_design_scores_gemma":[0.00007617765,0.0003110027,0.0006975899,0.00003553282,0.00006616333,0.0004408015,0.0002462471,0.7713975,0.02031467,0.1988017,0.007575485,0.00003723672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2809376,0.000819082,0.7115583,0.0005595008,0.00004151408,0.0001256219,0.0001980881,0.0008017436,0.004958649],"genre_scores_gemma":[0.8484434,0.0005814708,0.1483404,0.00009887487,0.00003727328,0.00008591373,0.0001688458,0.00006394547,0.002179928],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003155489,"threshold_uncertainty_score":0.01066566,"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."}}