{"id":"W2741202102","doi":"10.1109/icc.2017.7996438","title":"Delay optimal scheduling for network coding broadcast","year":2017,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Linear network coding; Decoding methods; Network packet; Computer network; Scheduling (production processes); Coding (social sciences); File transfer; Transfer (computing); Algorithm; Parallel computing; 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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004858566,0.00009991154,0.0001229581,0.00002432305,0.001826878,0.000838653,0.001912605,0.00003771844,0.00002656278],"category_scores_gemma":[0.0001195703,0.00009168377,0.00006623727,0.00006756003,0.00004522888,0.0006113514,0.0008374022,0.0001036236,0.00002654978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002147698,"about_ca_system_score_gemma":0.00003760461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002492137,"about_ca_topic_score_gemma":0.00001562846,"domain_scores_codex":[0.9991827,0.00003250939,0.0001635299,0.0002460818,0.00008905993,0.0002861102],"domain_scores_gemma":[0.9983292,0.000143884,0.0001137376,0.001204037,0.0001329853,0.0000761539],"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.000006994956,0.00001871495,0.0005639439,0.000004768789,0.00002016398,0.000001853858,0.0002162356,0.008908872,0.0003316214,0.7212045,0.003808298,0.2649141],"study_design_scores_gemma":[0.0003403588,0.00003130784,0.0006230864,0.00003614509,0.000003106767,0.000005566425,0.000009626264,0.9472029,0.0003617398,0.0006103722,0.05060686,0.000168971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002693274,0.0003295155,0.9823226,0.0021387,0.0003998983,0.0001677255,3.610059e-7,0.0001328365,0.01181509],"genre_scores_gemma":[0.5934207,0.0001865654,0.4050203,0.0003548716,0.0002033543,0.00002101183,0.000001155548,0.000005964547,0.000786151],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.938294,"threshold_uncertainty_score":0.9994726,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0744555899159033,"score_gpt":0.3287778205993552,"score_spread":0.2543222306834519,"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."}}