{"id":"W2887241500","doi":"10.1109/icc.2018.8422461","title":"Localization-Based Polar Code Construction with Sublinear Complexity","year":2018,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; Huawei Technologies (Canada)","funders":"","keywords":"Sublinear function; Code (set theory); Set (abstract data type); Computer science; Algorithm; Matching (statistics); Polar code; Boundary (topology); Polar; Construct (python library); Theoretical computer science; Topology (electrical circuits); Mathematics; Discrete mathematics; Combinatorics; Decoding methods; Physics; Statistics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005442898,0.0007233598,0.0006702949,0.00108902,0.0006645702,0.0009383032,0.0008533144,0.0005846764,0.003248099],"category_scores_gemma":[0.003535604,0.0003830113,0.0005924329,0.0009550733,0.0009775148,0.001639338,0.002077933,0.001314788,0.001623673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006510274,"about_ca_system_score_gemma":0.001523522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001750383,"about_ca_topic_score_gemma":0.001448926,"domain_scores_codex":[0.9991397,0.0002141814,0.0000391347,0.0001415893,0.0003750907,0.00009033897],"domain_scores_gemma":[0.9980925,0.0008301713,0.0001557046,0.0004085159,0.000422682,0.00009051251],"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.0004801321,0.0001020844,0.001668589,0.0004416503,0.00004579301,0.0002828587,0.0004530569,0.2414941,0.05227425,0.2392653,0.005643488,0.4578486],"study_design_scores_gemma":[0.00004262336,0.00008813541,0.0001747494,0.00002458619,0.00001646788,0.0002614513,0.00006987515,0.9132353,0.03477436,0.045442,0.005831877,0.00003859505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007169639,0.00008904241,0.9903151,0.00006799873,0.00002082674,0.00003477572,0.00004475246,0.000491776,0.001766162],"genre_scores_gemma":[0.1794853,0.0002823408,0.8162922,0.00009932336,0.00003357579,0.000180275,0.0003762805,0.0001962155,0.003054476],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003248099,"threshold_uncertainty_score":0.01086599,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03028749005856178,"score_gpt":0.2705478266403469,"score_spread":0.2402603365817851,"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."}}