{"id":"W2148514396","doi":"10.1109/mcom.2007.4378324","title":"Multicast Routing in Wireless Mesh Networks: Minimum Cost Trees or Shortest Path Trees?","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Computer science; Computer network; Multicast; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Distributed computing; Xcast; Multicast address; Source-specific multicast; Wireless mesh network; Unicast; Wireless network; Wireless; Telecommunications","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.0008486503,0.0005564301,0.0008583259,0.0007946334,0.0005345143,0.001478327,0.0009723902,0.00192235,0.002916461],"category_scores_gemma":[0.003720918,0.0002845155,0.0003269316,0.002039147,0.0008100896,0.004306571,0.0007910308,0.0009441728,0.0009042525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006448418,"about_ca_system_score_gemma":0.000384074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004745936,"about_ca_topic_score_gemma":0.0004967523,"domain_scores_codex":[0.9993326,0.0002098723,0.00003016757,0.00008704129,0.0002743533,0.00006598434],"domain_scores_gemma":[0.9993972,0.0003112894,0.00008684252,0.00004557387,0.0001311845,0.0000279729],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001838386,0.00008179747,0.001014459,0.001481732,0.00007413595,0.0002613536,0.0002524059,0.04923274,0.004004407,0.3248142,0.04996891,0.56863],"study_design_scores_gemma":[0.00005129165,0.0002025404,0.000832508,0.0004699955,0.0000650642,0.001123477,0.0003920387,0.1491711,0.003393406,0.6404889,0.2037407,0.00006904601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01947128,0.1081016,0.8193806,0.01815373,0.003280156,0.0001384009,0.0004391878,0.0006013924,0.0304337],"genre_scores_gemma":[0.4975497,0.1358862,0.3368927,0.004056094,0.008454092,0.0003781825,0.001107108,0.0003450956,0.01533084],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002916461,"threshold_uncertainty_score":0.009756505,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03735945028488987,"score_gpt":0.2989637978183139,"score_spread":0.261604347533424,"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."}}