{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007157405,0.0001570238,0.0001949889,0.0002305605,0.0002544119,0.0001052212,0.0004263388,0.0000734706,0.00004248023],"category_scores_gemma":[0.00001364211,0.0001496012,0.00007221462,0.0007738812,0.00006527793,0.0008745457,0.000005087299,0.0003198923,0.00002227832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000134646,"about_ca_system_score_gemma":0.00005667395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002778362,"about_ca_topic_score_gemma":0.00001609913,"domain_scores_codex":[0.9986632,0.0001611668,0.0005743753,0.0001413641,0.0002054388,0.0002544139],"domain_scores_gemma":[0.9987446,0.0003565577,0.0001929242,0.0005236183,0.0001243823,0.00005793445],"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.0001205333,0.0001596555,0.000002917335,0.000006260165,0.00002082528,6.25928e-7,0.001690254,0.2957247,0.0002182791,0.2313327,0.000111504,0.4706117],"study_design_scores_gemma":[0.002089218,0.0007990248,0.0006563803,0.0004164503,0.00001539566,0.000006213216,0.0002975421,0.9788372,0.007867838,0.007458739,0.001109807,0.0004462147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003203962,0.00004380704,0.9893751,0.0003194216,0.0003991972,0.0003462349,0.000003666298,0.0001240296,0.006184577],"genre_scores_gemma":[0.9959317,0.0003453355,0.002136589,0.001498275,0.00001824821,0.00002520665,0.000003915209,0.000004192457,0.00003653858],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9927278,"threshold_uncertainty_score":0.6100558,"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."}}