{"id":"W2801400867","doi":"10.1109/tit.2019.2912165","title":"Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natur og Univers, Det Frie Forskningsråd","keywords":"Linear network coding; Decoding methods; Network packet; Channel code; Information-theoretic security; Secrecy; Coding (social sciences); Code (set theory); Shannon–Fano coding; Computational complexity theory","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.0007153822,0.0001390449,0.0001676559,0.0001451289,0.0004824388,0.0002579503,0.0003469849,0.00008930029,0.00008881123],"category_scores_gemma":[0.000008324831,0.000141733,0.00005287379,0.0004220491,0.00004618593,0.001947353,0.00001253658,0.0003038985,0.0001132483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006000588,"about_ca_system_score_gemma":0.00004506041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006356841,"about_ca_topic_score_gemma":0.000006985645,"domain_scores_codex":[0.9989971,0.0001288413,0.0003374694,0.0001524856,0.0001674122,0.0002167083],"domain_scores_gemma":[0.9989374,0.0002281881,0.0001368788,0.0004915601,0.0001352682,0.00007075795],"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.0002392233,0.00009556221,0.0001335709,0.0000932657,0.0001135874,0.000001036024,0.009470331,0.6206104,0.002248391,0.1580734,0.0004293017,0.2084919],"study_design_scores_gemma":[0.0007726055,0.00007133773,0.00007460493,0.0001373508,0.0000117321,0.00001567042,0.0001972713,0.9915155,0.002756821,0.001163132,0.003045798,0.0002381643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.012078,0.00008834824,0.9842665,0.0001133226,0.0006079887,0.0003013439,0.000004175771,0.0001838441,0.002356517],"genre_scores_gemma":[0.9774112,0.000439154,0.02107779,0.0007738683,0.00002589795,0.0000159254,0.000004936048,0.000007860247,0.0002433877],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9653332,"threshold_uncertainty_score":0.5779706,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01899466051068887,"score_gpt":0.2509348176087943,"score_spread":0.2319401570981054,"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."}}