{"id":"W2774323520","doi":"10.1109/tit.2017.2779851","title":"Streaming Codes for Multiplicative-Matrix Channels With Burst Rank Loss","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Erasure code; Computer science; Rank (graph theory); Multiplicative function; Channel (broadcasting); Binary erasure channel; Erasure; Communication source; Matrix (chemical analysis); Algorithm; Discrete mathematics; Mathematics; Channel capacity; Decoding methods; Combinatorics; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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.0004990864,0.0001563885,0.0001507059,0.0001510685,0.0017959,0.0005594327,0.001055804,0.00005587275,0.00002111659],"category_scores_gemma":[0.00002725867,0.0001315835,0.00007487414,0.0001195013,0.000141118,0.002890554,0.000008640995,0.0001653676,0.0000641308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005441109,"about_ca_system_score_gemma":0.00005348958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003510744,"about_ca_topic_score_gemma":0.00001206366,"domain_scores_codex":[0.9991508,0.00007500956,0.0002625473,0.0001530485,0.0001606283,0.0001979275],"domain_scores_gemma":[0.9979389,0.0003529273,0.0002612725,0.001093711,0.000280166,0.00007305895],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003028398,0.0001350809,0.00001362288,0.0000502706,0.0001186724,5.862586e-7,0.007239124,0.03085656,0.0002049174,0.2462654,0.0001636914,0.7146492],"study_design_scores_gemma":[0.007782083,0.0008074922,0.0007697873,0.0005007043,0.00008483238,0.00004603024,0.001408136,0.8725255,0.06547996,0.009724529,0.0394526,0.001418379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001824564,0.00002253761,0.9947025,0.0009295061,0.000307299,0.0005074278,0.00002998461,0.0001738381,0.00150235],"genre_scores_gemma":[0.9866505,0.0001279925,0.01221777,0.0002384868,0.00002777941,0.000265475,0.000007388511,0.000008161571,0.0004564964],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9848259,"threshold_uncertainty_score":0.9995036,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02467103453853499,"score_gpt":0.2913047066467689,"score_spread":0.2666336721082339,"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."}}