{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002758653,0.0001176341,0.0001483571,0.0001848009,0.0001627265,0.00008431121,0.0004155481,0.00005412407,0.0001513504],"category_scores_gemma":[0.00002475842,0.0001096351,0.0001089772,0.0004340755,0.00007429225,0.001256505,0.000003060134,0.000194515,0.0002298498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002227126,"about_ca_system_score_gemma":0.00003726452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001334401,"about_ca_topic_score_gemma":0.000001897547,"domain_scores_codex":[0.9991023,0.0001007297,0.0003340969,0.0001232914,0.0002097802,0.0001297949],"domain_scores_gemma":[0.9990281,0.0003663677,0.000134962,0.0003031105,0.00009117743,0.00007621107],"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.0003287829,0.0001514229,5.767189e-7,0.00006682312,0.00006753141,0.000001313072,0.002888622,0.08179493,0.0001886571,0.6631086,0.0008583561,0.2505444],"study_design_scores_gemma":[0.002768956,0.003220863,0.0003354493,0.0002348868,0.00004872005,0.00001854229,0.0008061592,0.301443,0.206164,0.4760089,0.007900948,0.001049533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006863162,0.000004169351,0.9888734,0.0008386665,0.00055689,0.0001300069,0.00008292354,0.0001681163,0.002482616],"genre_scores_gemma":[0.9901597,0.00002527222,0.006731721,0.002967046,0.00002060199,0.00001566775,0.00000478081,0.000004737664,0.00007041639],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9832966,"threshold_uncertainty_score":0.4470788,"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."}}