{"id":"W2108063243","doi":"10.1002/net.20396","title":"Nonadaptive broadcasting in trees","year":2010,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Broadcasting (networking); Computer science; Upper and lower bounds; Tree (set theory); Combinatorics; Time complexity; Graph; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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.0009776349,0.0005896658,0.0008948373,0.0008044235,0.001525206,0.001885025,0.001720802,0.0008585214,0.004102257],"category_scores_gemma":[0.005781096,0.0004405101,0.0007905102,0.001818282,0.001280797,0.004553495,0.001374518,0.001664526,0.001059477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001273652,"about_ca_system_score_gemma":0.0007670515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001796425,"about_ca_topic_score_gemma":0.002019503,"domain_scores_codex":[0.9989116,0.0003099488,0.00006757426,0.0002352396,0.0002473082,0.0002283713],"domain_scores_gemma":[0.9941539,0.003483558,0.0006861397,0.0009404239,0.0005313221,0.0002046781],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003235371,0.0001762604,0.001516198,0.0008620592,0.00008886985,0.0004354399,0.0009284118,0.2095418,0.02279363,0.6161122,0.01099804,0.1362236],"study_design_scores_gemma":[0.00007907128,0.0002771171,0.0006106826,0.00007257533,0.00008792953,0.0006080437,0.0002550828,0.4734296,0.009019933,0.4800264,0.03549383,0.00003971611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06428947,0.003247703,0.9144222,0.0007072325,0.0001705072,0.0001730812,0.0002679635,0.0005405013,0.0161814],"genre_scores_gemma":[0.6246461,0.006013421,0.3515827,0.0004725215,0.0004023803,0.0004265856,0.0008739632,0.0004038096,0.01517847],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004102257,"threshold_uncertainty_score":0.01372343,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008583573358192428,"score_gpt":0.2169697974588081,"score_spread":0.2083862241006157,"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."}}