{"id":"W3085262258","doi":"10.1109/tit.2020.3023962","title":"On List Recovery of High-Rate Tensor Codes","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Google; Simons Foundation; United States-Israel Binational Science Foundation; European Research Council; National Science Foundation","keywords":"Decoding methods; List decoding; Probabilistic logic; Tensor product; Mathematics; Linear code; Upper and lower bounds; Discrete mathematics; Code (set theory); Algorithm; Computer science; Block code; Concatenated error correction code; Statistics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002825249,0.0009483778,0.000911158,0.001285912,0.001216207,0.00178638,0.001551145,0.0009940525,0.00382725],"category_scores_gemma":[0.01734186,0.0004069419,0.0008478836,0.00153622,0.003494955,0.005931702,0.002718362,0.003474702,0.001302131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002715576,"about_ca_system_score_gemma":0.00171183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003207745,"about_ca_topic_score_gemma":0.001476642,"domain_scores_codex":[0.9967894,0.0008569398,0.0001418857,0.0004544461,0.001181921,0.0005753608],"domain_scores_gemma":[0.9862238,0.00696956,0.001487276,0.003089861,0.00189309,0.0003366201],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000636942,0.00007652387,0.0009752301,0.0002709056,0.00002953639,0.0002318605,0.0006436479,0.2780288,0.01539961,0.6526014,0.002948605,0.04815705],"study_design_scores_gemma":[0.00003671214,0.0001796387,0.0002526455,0.00005158808,0.00002169082,0.0002057081,0.0001021229,0.7122281,0.01871421,0.2645405,0.003605535,0.00006154321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0889751,0.001119739,0.8954793,0.0009023858,0.0000901184,0.0001078124,0.0002449634,0.001051334,0.01202928],"genre_scores_gemma":[0.8202704,0.001175265,0.1650146,0.0003631385,0.0001838954,0.0002416133,0.0005066903,0.0004500985,0.01179427],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00382725,"threshold_uncertainty_score":0.01970297,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01516762955581668,"score_gpt":0.2153799879103764,"score_spread":0.2002123583545597,"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."}}