{"id":"W4400877879","doi":"10.1109/jsac.2024.3431579","title":"Decoding of Polar Codes Using Quadratic Unconstrained Binary Optimization","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Decoding methods; Binary number; Polar; Sequential decoding; List decoding; Algorithm; Binary code; Quadratic equation; Theoretical computer science; Concatenated error correction code; Block code; Arithmetic; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0008250164,0.0001451567,0.0002136358,0.0008560632,0.0002762643,0.0002376536,0.001613847,0.00008487669,0.000007707436],"category_scores_gemma":[0.0003607658,0.000143541,0.00007232316,0.002311002,0.00008772978,0.0006050236,0.0001472277,0.0007874939,0.000002490821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003112082,"about_ca_system_score_gemma":0.0005112264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005046805,"about_ca_topic_score_gemma":0.00007045636,"domain_scores_codex":[0.9982503,0.0005047646,0.0005920168,0.0001896108,0.0002517838,0.0002114972],"domain_scores_gemma":[0.9974538,0.0009298045,0.0002343009,0.0009617844,0.0003525923,0.00006768567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006038549,0.001579799,0.009882859,0.0002122906,0.0003729579,0.0001875181,0.01020269,0.6841207,0.1736119,0.07583947,0.001516344,0.04241317],"study_design_scores_gemma":[0.0001110096,0.0001091416,0.0001914201,0.0009029816,0.00001439433,0.0003300079,0.00006599096,0.9924325,0.003581173,0.00205933,0.00005102282,0.0001510462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06775355,0.0009600544,0.9282564,0.001117836,0.0004126914,0.000176381,0.000004506044,0.0003994349,0.0009191793],"genre_scores_gemma":[0.6697678,0.0002206707,0.3299235,0.00003794516,0.00002253231,0.000004725611,0.000002866103,0.00001323909,0.000006755597],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6020142,"threshold_uncertainty_score":0.5853431,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05457634294375869,"score_gpt":0.3419000424481128,"score_spread":0.2873236995043541,"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."}}