{"id":"W7092316957","doi":"","title":"Decoding Balanced Linear Codes With Preprocessing","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation Singapore; National Research Foundation","keywords":"Decoding methods; Hamming code; Linear code; Error detection and correction; Preprocessor; Decodes; Code (set theory); Set (abstract data type); Cryptography; Hamming distance","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.0005534759,0.0004643284,0.0005459617,0.0002963668,0.001100577,0.0004794116,0.001658497,0.0001651453,0.00007169269],"category_scores_gemma":[0.0001611381,0.000434189,0.0001594701,0.002308515,0.0004693761,0.0009304691,0.0008704701,0.0006101405,0.00009561391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009090609,"about_ca_system_score_gemma":0.0005109186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000587591,"about_ca_topic_score_gemma":0.00005435786,"domain_scores_codex":[0.9966763,0.000130195,0.0006029783,0.001328654,0.0004203765,0.0008414905],"domain_scores_gemma":[0.9976403,0.000303792,0.0002642498,0.001288672,0.0003227354,0.0001802789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001236206,0.0004158627,0.8361715,0.0005515026,0.0002924054,0.0001092651,0.002271784,0.001175548,0.001379469,0.01325495,0.000425775,0.1438283],"study_design_scores_gemma":[0.002392124,0.000422329,0.2477282,0.003796587,0.0001718965,0.00005384243,0.0004097967,0.7043121,0.02440687,0.006369574,0.008504431,0.001432246],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5044953,0.001383484,0.4860023,0.001277753,0.001349827,0.000256379,0.000004891099,0.0002520962,0.004977958],"genre_scores_gemma":[0.9473933,0.0001604196,0.04925682,0.001064736,0.0002591422,0.00002351682,0.00000325137,0.0000221278,0.001816674],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7031366,"threshold_uncertainty_score":0.999811,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0417784958985733,"score_gpt":0.2943941229819348,"score_spread":0.2526156270833615,"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."}}