{"id":"W2972671693","doi":"10.1109/twc.2020.3022922","title":"Sublinear Latency for Simplified Successive Cancellation Decoding of Polar Codes","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Wireless Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies; National Science Foundation","keywords":"Sublinear function; Decoding methods; Latency (audio); Algorithm; Computer science; Polar; Mathematics; Upper and lower bounds; Discrete mathematics; Telecommunications; Physics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003745913,0.0003743586,0.0005914919,0.0004283489,0.0005854141,0.0001624123,0.004369589,0.0003663042,0.000005802922],"category_scores_gemma":[0.00005704107,0.0004370678,0.0003646674,0.0006705358,0.0001709176,0.0003045085,0.0001198202,0.001171022,0.000006177809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002273289,"about_ca_system_score_gemma":0.000469269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000717103,"about_ca_topic_score_gemma":0.00100742,"domain_scores_codex":[0.9975867,0.0002795488,0.000838215,0.0006702013,0.0003233629,0.0003019481],"domain_scores_gemma":[0.9932526,0.001486632,0.0007590853,0.003692384,0.0006847136,0.0001245762],"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.0004595384,0.004178077,0.0006186306,0.003650854,0.002040675,0.000009120976,0.02676429,0.2301596,0.1022714,0.1673805,0.002873119,0.4595943],"study_design_scores_gemma":[0.0003556919,0.0001486176,0.00004643984,0.0004771399,0.0001083381,0.000002357882,0.00009223715,0.8959911,0.09282438,0.009011433,0.0003751765,0.0005671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003360639,0.0002078177,0.9884171,0.004573956,0.0006593526,0.001199298,0.0003958329,0.0008949694,0.0002909615],"genre_scores_gemma":[0.8116381,0.0006147929,0.1869536,0.0001084256,0.00002887711,0.0004987758,0.00006795581,0.00004685094,0.00004262297],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8082774,"threshold_uncertainty_score":0.9998081,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0733727783293457,"score_gpt":0.3351965098153082,"score_spread":0.2618237314859625,"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."}}