{"id":"W2118966480","doi":"10.1109/icdcs.2009.29","title":"Stochastic Multicast with Network Coding","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Multicast; Linear network coding; Service provider; Mathematical optimization; Exploit; Optimization problem; Purchasing; Network planning and design; Heuristic; Stochastic optimization; Stochastic programming; Service (business); Distributed computing; Computer network; Algorithm; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002497764,0.0006222759,0.0008706806,0.0007901028,0.000596785,0.0009256486,0.001209697,0.001201783,0.001451611],"category_scores_gemma":[0.00938694,0.0003647025,0.0006694028,0.001257279,0.001132598,0.001400287,0.001909113,0.0009910908,0.0002393936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001953738,"about_ca_system_score_gemma":0.001411425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004836299,"about_ca_topic_score_gemma":0.003823875,"domain_scores_codex":[0.998166,0.0009771532,0.00004795953,0.000125257,0.0004710518,0.0002126107],"domain_scores_gemma":[0.9958286,0.003087889,0.0003083063,0.0003274872,0.0003449923,0.0001027571],"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.00006911551,0.00001751627,0.0002680539,0.0000300802,0.00001378894,0.0000549106,0.00004287549,0.8906703,0.0005647229,0.09457227,0.0007349431,0.01296145],"study_design_scores_gemma":[0.00001140369,0.00001255945,0.00003768288,0.000003655307,0.000002379965,0.00001693814,0.000004844032,0.9699374,0.0001256578,0.02953624,0.0003075378,0.000003642834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02553606,0.000314072,0.96799,0.0003434117,0.00004019228,0.00006120974,0.00007466589,0.000160343,0.005479984],"genre_scores_gemma":[0.8253133,0.0005303327,0.1692713,0.0002072147,0.00008766264,0.000319381,0.0001578755,0.00004790871,0.004064967],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004836299,"threshold_uncertainty_score":0.01417542,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03069937269010298,"score_gpt":0.2690255002901051,"score_spread":0.2383261276000021,"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."}}