{"id":"W2050313358","doi":"10.1145/2379790.2379798","title":"Algorithms for stochastic optimization of multicast content delivery with network coding","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","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; Mathematical optimization; Probabilistic logic; Service provider; Optimization problem; Linear network coding; Content delivery network; Stochastic optimization; Approximation algorithm; Heuristics; Provisioning; Distributed computing; Computer network; Service (business); 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004711542,0.0002041942,0.0002567651,0.000148709,0.001194157,0.00007565589,0.001431095,0.00007107112,0.000005502773],"category_scores_gemma":[0.00004137363,0.0001943305,0.0000746224,0.0006597595,0.000245977,0.000329257,0.0001621959,0.0002538062,0.000003730889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005057885,"about_ca_system_score_gemma":0.00005279109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001006826,"about_ca_topic_score_gemma":0.00001330362,"domain_scores_codex":[0.9986236,0.0001389035,0.0004551003,0.0002858733,0.0001564946,0.0003400312],"domain_scores_gemma":[0.9948062,0.002142911,0.0002503023,0.002202859,0.0004316695,0.0001660515],"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.00002334626,0.0008196095,0.000199507,0.00003080512,0.0001371275,3.952394e-8,0.001644663,0.2412482,0.0004014696,0.02569279,0.00003057083,0.7297719],"study_design_scores_gemma":[0.0007519088,0.00009519116,0.0004466851,0.0001033371,0.00005914519,0.00000836385,0.0001999041,0.9964414,0.0001634188,0.00009261613,0.001399839,0.0002381563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003755388,0.0009334888,0.9961898,0.001047776,0.00007089914,0.001129195,0.00002063888,0.0001567582,0.00007588444],"genre_scores_gemma":[0.4947332,0.0005752102,0.5042019,0.00008290893,0.00004242148,0.0003107513,0.00002748629,0.00001339026,0.00001273117],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7551932,"threshold_uncertainty_score":0.9184611,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08668518469541037,"score_gpt":0.3061312561095786,"score_spread":0.2194460714141682,"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."}}