{"id":"W2952079630","doi":"10.48550/arxiv.1610.06974","title":"Optimal Control for Network Coding Broadcast","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Linear network coding; Multicast; Markov decision process; Network packet; Computer network; Coding (social sciences); Scheduling (production processes); Computational complexity theory; Distributed computing; Markov process; Algorithm; Mathematical optimization; Mathematics","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.00188535,0.001053945,0.0009847995,0.0007399177,0.0005612546,0.001196666,0.0009026784,0.0008995728,0.002933297],"category_scores_gemma":[0.006776449,0.0003949305,0.0003419248,0.0007189332,0.001927304,0.0009419009,0.001302902,0.001496166,0.0002518715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003822231,"about_ca_system_score_gemma":0.002332956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01468517,"about_ca_topic_score_gemma":0.00776116,"domain_scores_codex":[0.998838,0.0003949618,0.00003440283,0.0002107095,0.0002298662,0.0002920002],"domain_scores_gemma":[0.9948599,0.003901935,0.0004774373,0.0001242625,0.0004697263,0.0001666175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001347293,0.00004177447,0.0001972145,0.00006454681,0.00001715845,0.00004369597,0.00006756711,0.9314744,0.001241483,0.05852702,0.001271401,0.006919],"study_design_scores_gemma":[0.00001858989,0.00001540419,0.00004338971,0.000004863666,0.000003025165,0.000003805133,0.000008031182,0.9881074,0.0001755977,0.01139906,0.0002163597,0.000004480017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07151476,0.0006526333,0.9042587,0.001270229,0.000159096,0.0001261211,0.0002173432,0.0003264357,0.02147473],"genre_scores_gemma":[0.9719553,0.000321649,0.02137066,0.0001329662,0.00006166268,0.0001609789,0.00008995376,0.00004397966,0.005862777],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01468517,"threshold_uncertainty_score":0.02919936,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09647865135288608,"score_gpt":0.2165453389113167,"score_spread":0.1200666875584307,"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."}}