{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063213,0.0009513996,0.0009310467,0.000711002,0.0007200821,0.001432649,0.001292908,0.001302027,0.002684848],"category_scores_gemma":[0.01135458,0.0005239195,0.0006839119,0.001149488,0.00140424,0.002634525,0.002305912,0.001918629,0.002031644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001510869,"about_ca_system_score_gemma":0.001914934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001375218,"about_ca_topic_score_gemma":0.001778215,"domain_scores_codex":[0.9976082,0.0005323781,0.0001396205,0.0005155976,0.0009050453,0.0002991596],"domain_scores_gemma":[0.994356,0.002620298,0.000610926,0.001666892,0.0006206734,0.0001251856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001438049,0.000247158,0.002515565,0.0003100564,0.0001060609,0.0002643576,0.0004795576,0.4971138,0.05653375,0.1814031,0.008430295,0.2511582],"study_design_scores_gemma":[0.00008953988,0.0001620945,0.0004157406,0.00003338342,0.00002424493,0.00014348,0.00003272156,0.8279626,0.02692782,0.1413905,0.002785507,0.00003236376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08455611,0.0001999454,0.9049298,0.0006061772,0.00004732419,0.0001002513,0.0004714495,0.00244991,0.006639117],"genre_scores_gemma":[0.6209198,0.0002666973,0.3677229,0.0004118176,0.0001042525,0.000394322,0.00170121,0.0004783954,0.008000582],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002684848,"threshold_uncertainty_score":0.01096219,"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."}}