{"id":"W2546190674","doi":"10.1109/glocom.2016.7842079","title":"Optimal Control for Network Coding Broadcast","year":2016,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Linear network coding; Multicast; Markov decision process; Computer network; Network packet; Coding (social sciences); Intuition; Computational complexity theory; Markov process; Distributed computing; Scheduling (production processes); Algorithm; Mathematical optimization","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.0003408167,0.00008008625,0.0001072681,0.00002361824,0.0002164036,0.00009015391,0.0006866431,0.00002592907,0.00007330946],"category_scores_gemma":[0.00005346629,0.00005052769,0.00005497923,0.0001407501,0.00002671891,0.0002731876,0.0001713054,0.00003410519,0.00004787365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002506071,"about_ca_system_score_gemma":0.00002629795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.585564e-7,"about_ca_topic_score_gemma":0.000003801352,"domain_scores_codex":[0.9992766,0.00005637161,0.0001487394,0.0001943644,0.00007296716,0.0002509346],"domain_scores_gemma":[0.9988421,0.000489131,0.00004267046,0.0004520398,0.0001097845,0.00006432997],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000009726317,0.00001201012,0.0001859829,0.000001226603,0.0000132545,3.833582e-7,0.00005175827,0.0003457895,0.001656573,0.6489304,0.01880848,0.3299844],"study_design_scores_gemma":[0.003131248,0.0001685096,0.0008384007,0.00008913287,0.00000753766,0.000009302628,0.000008624454,0.4775433,0.001403423,0.002233419,0.5141606,0.0004064988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002959764,0.0002258052,0.9889594,0.005762684,0.000213572,0.0001912328,0.000001050871,0.0001647207,0.004185501],"genre_scores_gemma":[0.8821009,0.0002082637,0.1137994,0.00126255,0.0001961726,0.00004857278,4.636063e-7,0.000006238177,0.0023774],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8818049,"threshold_uncertainty_score":0.206046,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03744334014911874,"score_gpt":0.2789508655703171,"score_spread":0.2415075254211983,"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."}}