{"id":"W3196371665","doi":"10.1109/sips52927.2021.00036","title":"High-Throughput VLSI Architecture for GRAND Markov Order","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Interleaving; Throughput; Code word; Soft-decision decoder; BCH code; Parallel computing; Algorithm; Markov chain; Code (set theory); Telecommunications; Wireless","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"],"consensus_categories":[],"category_scores_codex":[0.0005067211,0.0004902566,0.0006002152,0.0002026897,0.0001469416,0.0006572928,0.002360961,0.0004893293,0.00005524055],"category_scores_gemma":[0.0002879011,0.0004446047,0.000312859,0.0003940701,0.0000532456,0.0001604761,0.003782419,0.0009608899,0.000006494292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009519068,"about_ca_system_score_gemma":0.0003842922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004609654,"about_ca_topic_score_gemma":0.0006512412,"domain_scores_codex":[0.9970523,0.0001280214,0.0004385329,0.00147586,0.0003931345,0.000512137],"domain_scores_gemma":[0.9966137,0.0003488267,0.0002292106,0.002206884,0.0004918391,0.000109473],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009037077,0.0006123952,0.0004016878,0.00245443,0.000645212,0.0002115374,0.007728399,0.005559098,0.002402643,0.05913966,0.1810207,0.7397339],"study_design_scores_gemma":[0.002995852,0.0008782734,0.001168412,0.00255169,0.0002981205,0.0004384122,0.0002262971,0.09645731,0.144309,0.6286538,0.1145032,0.007519573],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002836247,0.0002659215,0.9835781,0.003871883,0.003016703,0.0009811621,0.00001186491,0.002214195,0.003223863],"genre_scores_gemma":[0.04863603,0.00004103104,0.9473894,0.001098388,0.0002758083,0.0002353667,0.00005862322,0.00005445122,0.002210891],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7322143,"threshold_uncertainty_score":0.9998006,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01733878739974258,"score_gpt":0.274707906463882,"score_spread":0.2573691190641394,"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."}}