{"id":"W2160348245","doi":"10.1109/tit.2008.2011516","title":"A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Calgary","funders":"","keywords":"Linear network coding; Multicast; Computer science; Coding (social sciences); Computer network; Upper and lower bounds; Bounded function; Throughput; Theoretical computer science; Mathematics; 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.005672565,0.002486345,0.001598957,0.002106488,0.001466824,0.003230086,0.002650264,0.002046321,0.006044436],"category_scores_gemma":[0.04505597,0.0007452158,0.001200813,0.002544893,0.003915657,0.005885977,0.004159059,0.005019811,0.001474048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003727548,"about_ca_system_score_gemma":0.001705623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001262293,"about_ca_topic_score_gemma":0.0008530542,"domain_scores_codex":[0.9935516,0.002068109,0.0001635963,0.0009869009,0.001706809,0.001523002],"domain_scores_gemma":[0.9586095,0.03447553,0.001775082,0.002942906,0.001527701,0.0006692663],"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.001279255,0.0002345576,0.001279301,0.0009638037,0.0002042047,0.0005413648,0.000569923,0.3755158,0.03507061,0.4427899,0.01424395,0.1273075],"study_design_scores_gemma":[0.00008691657,0.0004059858,0.0009556946,0.0003677245,0.0002375349,0.0007765615,0.0001632413,0.5998129,0.02603015,0.3586764,0.01237968,0.0001072603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08366507,0.01420045,0.8217072,0.00629712,0.0009184292,0.0001443711,0.00054682,0.002331904,0.07018869],"genre_scores_gemma":[0.9028355,0.007590193,0.07974023,0.00176137,0.001023993,0.0003775041,0.0003148809,0.0007874306,0.005568872],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006044436,"threshold_uncertainty_score":0.02999973,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01700696795083134,"score_gpt":0.2562433237211498,"score_spread":0.2392363557703184,"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."}}