{"id":"W3204736704","doi":"10.1109/tvlsi.2022.3223692","title":"List-GRAND: A Practical Way to Achieve Maximum Likelihood Decoding","year":2022,"lang":"en","type":"preprint","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Reliability (semiconductor); List decoding; Grand strategy; Maximum likelihood; Algorithm; Parallel computing; Mathematics; Statistics; Concatenated error correction code","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":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002540057,0.0009577913,0.001062115,0.001337692,0.001030685,0.001380643,0.00211776,0.0007618722,0.0001891133],"category_scores_gemma":[0.0001146433,0.0009817791,0.0007288238,0.001259698,0.00005452627,0.0009654224,0.0001377129,0.003802034,0.0002305553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001537296,"about_ca_system_score_gemma":0.0005280911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009254004,"about_ca_topic_score_gemma":0.002138439,"domain_scores_codex":[0.9924636,0.001247093,0.001506032,0.002123733,0.001621007,0.001038546],"domain_scores_gemma":[0.9950048,0.0006956423,0.0006550901,0.002603368,0.0005427597,0.0004983494],"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.003651957,0.01679125,0.0003548775,0.003751438,0.0030307,0.001384356,0.0994969,0.1724731,0.02653763,0.01815435,0.1168076,0.5375659],"study_design_scores_gemma":[0.002408599,0.003681376,0.00007974039,0.004609388,0.0005680753,0.0008994986,0.006727605,0.86677,0.04330554,0.007184185,0.05782853,0.005937462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005085464,0.0001033076,0.9674632,0.001972447,0.01711712,0.002490216,0.0003268222,0.002667766,0.002773667],"genre_scores_gemma":[0.934591,0.00007856124,0.05986488,0.0005840204,0.0003712953,0.002850533,0.00006033159,0.0001491681,0.001450231],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9295055,"threshold_uncertainty_score":0.999656,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0280340564968689,"score_gpt":0.3054145827928697,"score_spread":0.2773805262960008,"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."}}