{"id":"W1965556172","doi":"10.1109/icc.2010.5502758","title":"On Minimizing Broadcast Completion Delay for Instantly Decodable Network Coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":141,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Greedy algorithm; Selection (genetic algorithm); Network packet; Computational complexity theory; Coding (social sciences); Selection algorithm; Algorithm; Mathematical optimization; Wireless network; Frame (networking); Wireless; Mathematics; Computer network; 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.0005590015,0.000130694,0.0001524811,0.00006533624,0.000612765,0.0001759547,0.0008059012,0.00005828515,0.00008715588],"category_scores_gemma":[0.0001008773,0.0001189959,0.00006330548,0.000343481,0.00003224309,0.0002948749,0.0002436839,0.0002337703,0.00004363574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002814634,"about_ca_system_score_gemma":0.00004027519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003016668,"about_ca_topic_score_gemma":0.0001484404,"domain_scores_codex":[0.9989551,0.0000585508,0.0002354628,0.0002951826,0.0001362063,0.000319548],"domain_scores_gemma":[0.9984499,0.0005764986,0.00008116696,0.0006467068,0.0001570771,0.00008869305],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000012307,0.00003586598,0.0001011034,0.000003457105,0.000008187453,7.109597e-7,0.0001480177,0.0008514757,0.0031631,0.8899282,0.0155943,0.09015332],"study_design_scores_gemma":[0.0006725487,0.0001243226,0.0004383286,0.00004853898,0.000004120418,0.00001172892,0.00001517543,0.7696909,0.001165487,0.005206286,0.2223247,0.000297853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01038246,0.00009102689,0.9652506,0.001148544,0.0007937031,0.0002861455,0.000001139617,0.0002201154,0.02182632],"genre_scores_gemma":[0.7939485,0.0001096205,0.2036656,0.001613623,0.0001631104,0.00003871472,0.000007698958,0.00001106509,0.00044204],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8847219,"threshold_uncertainty_score":0.4852512,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04145693096827495,"score_gpt":0.290546781536613,"score_spread":0.249089850568338,"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."}}