{"id":"W2101515343","doi":"10.1109/icc.2011.5963123","title":"Completion Delay Minimization for Instantly Decodable Network Coding with Limited Feedback","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Computer science; Coding (social sciences); Minification; Path (computing); Decoding methods; Mathematical optimization; Algorithm; Mathematics; Computer network","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.001763852,0.0008302207,0.0007858816,0.0004048682,0.0003773166,0.0007170157,0.001170241,0.0008105696,0.001065924],"category_scores_gemma":[0.004426188,0.0003202,0.0002952832,0.0005178331,0.001152924,0.001295761,0.0009799774,0.000968326,0.0001430696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001986257,"about_ca_system_score_gemma":0.002949309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004051189,"about_ca_topic_score_gemma":0.003155905,"domain_scores_codex":[0.9992902,0.0002547689,0.00002438239,0.000128805,0.0001960785,0.0001057111],"domain_scores_gemma":[0.9977663,0.0015051,0.0002571983,0.000127113,0.0002433104,0.0001009664],"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.00009915511,0.00002784978,0.0001237508,0.00006450528,0.00001288854,0.0000312281,0.00006434044,0.9655239,0.002797324,0.01941122,0.0004086534,0.01143507],"study_design_scores_gemma":[0.00001963372,0.00004641413,0.00005050661,0.00000520412,0.000003457605,0.00001249369,0.00001335496,0.9905828,0.001347384,0.007717322,0.0001940562,0.000007265821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05223082,0.000208861,0.9458643,0.0001889668,0.00002018418,0.00004597235,0.00005773212,0.0001120518,0.001271135],"genre_scores_gemma":[0.8100621,0.0002723389,0.1854969,0.00008121024,0.00004152396,0.0001777349,0.0001380679,0.00009435964,0.003635746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004051189,"threshold_uncertainty_score":0.01441133,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08065078401681544,"score_gpt":0.2579649174252455,"score_spread":0.17731413340843,"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."}}