{"id":"W4393241092","doi":"10.1109/tcomm.2024.3382328","title":"Exploiting Parity-Polytope Geometry in Approximate and Randomized Scheduled ADMM-LP Decoding","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Polytope; Decoding methods; Parity (physics); Mathematics; Computer science; Combinatorics; Algorithm; Mathematical optimization; Physics","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.0008246641,0.0001700754,0.0003233146,0.0004912128,0.0002525109,0.0001319651,0.0003066651,0.00009717351,0.00003786179],"category_scores_gemma":[0.00001642681,0.0001722559,0.0001251593,0.000636987,0.0001388566,0.000264287,0.000004743222,0.0005722034,0.00003278021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005546458,"about_ca_system_score_gemma":0.00001505844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003420735,"about_ca_topic_score_gemma":0.0001300437,"domain_scores_codex":[0.9988463,0.0002603514,0.0004118434,0.0001758649,0.00009147239,0.0002141717],"domain_scores_gemma":[0.9981337,0.001043267,0.00002194286,0.0007131592,0.00001832693,0.00006956975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003644531,0.001581526,0.0003289765,0.004373773,0.003314463,0.00006420472,0.03009876,0.1938664,0.05093319,0.4082486,0.0004683442,0.3030772],"study_design_scores_gemma":[0.01256131,0.00002186635,0.00002990137,0.001064164,0.0001624442,0.00004878005,0.00171797,0.9669302,0.008822325,0.006883825,0.001209657,0.0005476255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2574587,0.008912373,0.7223964,0.0005098842,0.0009004315,0.000908517,0.00005185559,0.001325157,0.007536683],"genre_scores_gemma":[0.9946725,0.002293451,0.002425474,0.00001969995,0.00001551395,0.0004462129,0.000006382,0.00004043871,0.00008036535],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7730637,"threshold_uncertainty_score":0.7024391,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02213257250626631,"score_gpt":0.2540489958127179,"score_spread":0.2319164233064516,"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."}}