{"id":"W2158204198","doi":"10.1109/waina.2009.148","title":"Efficient Heuristic for Multicasting in Arbitrary Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Multicast; Computer science; Network topology; Heuristic; Computer network; Source-specific multicast; Protocol Independent Multicast; Xcast; Distributed computing; Routing (electronic design automation); Distance Vector Multicast Routing Protocol; Pragmatic General Multicast; Artificial intelligence","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.0003354359,0.00007883045,0.0001187787,0.00006690731,0.00006225065,0.00008666483,0.0002431059,0.00004418368,0.00000430607],"category_scores_gemma":[0.00003810647,0.0000663164,0.00005101131,0.0002132525,0.000006254869,0.00004843833,0.0000254821,0.00008624989,0.000006156939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002629866,"about_ca_system_score_gemma":0.00001112454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008095171,"about_ca_topic_score_gemma":0.000008875234,"domain_scores_codex":[0.9991521,0.00002994382,0.0002429325,0.0002356287,0.00007625471,0.0002631],"domain_scores_gemma":[0.999507,0.0001793298,0.00003919691,0.000190666,0.0000373953,0.00004648888],"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.00001109555,0.0001102938,0.0001414309,0.000007117419,0.000003633768,0.0000140068,0.0004074082,0.7994332,0.00003062165,0.1757806,0.001298923,0.02276169],"study_design_scores_gemma":[0.0002483633,0.00007531112,0.0008759321,0.00003089584,6.949826e-7,0.00001095579,0.00002430004,0.9976447,0.00001346359,0.0007280438,0.0002578496,0.00008947967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0158318,0.00006159404,0.9780214,0.0003402522,0.0006047328,0.0002164392,1.121861e-7,0.0001044477,0.004819157],"genre_scores_gemma":[0.9767382,5.724525e-7,0.02217684,0.0006991046,0.0001700836,0.00001193223,3.990547e-7,0.000003154557,0.0001997612],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9609063,"threshold_uncertainty_score":0.2704304,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01521436196019243,"score_gpt":0.2495829152052832,"score_spread":0.2343685532450908,"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."}}