{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001610917,0.0003418752,0.0004367716,0.0002541839,0.00034601,0.0002329958,0.00478101,0.0001863201,0.00002608715],"category_scores_gemma":[0.0001364558,0.0003237341,0.0001033143,0.001936444,0.0002738541,0.0006010272,0.001154663,0.0007395023,0.0001184936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002173436,"about_ca_system_score_gemma":0.0001120625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000930523,"about_ca_topic_score_gemma":0.01757044,"domain_scores_codex":[0.9969578,0.0003068274,0.0009769191,0.0005793296,0.0003270617,0.0008520024],"domain_scores_gemma":[0.9924974,0.001886756,0.000299168,0.004887074,0.0001909583,0.0002385787],"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.0002048885,0.003726417,0.05162071,0.00002515218,0.0001493804,0.0003923028,0.003617315,0.01450466,0.003217875,0.09873307,0.01802017,0.805788],"study_design_scores_gemma":[0.0008740813,0.00008299871,0.03765581,0.0001675761,0.00001506051,0.00004291336,0.00009624106,0.9552283,0.00006271208,0.00007574446,0.005286594,0.0004119391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02163821,0.0003760413,0.9653544,0.001630798,0.0007896742,0.00119648,0.000009541837,0.0005199404,0.008484891],"genre_scores_gemma":[0.9632999,0.0005271891,0.03480827,0.0003693286,0.0002130565,0.000150881,0.00003903446,0.000041937,0.0005504063],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9416617,"threshold_uncertainty_score":0.9999215,"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."}}