{"id":"W3109578553","doi":"10.1109/isit45174.2021.9517887","title":"Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller Codes","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Redundancy (engineering); Computation; Computer science; Soft-decision decoder; Algorithm; Decoding methods; Cyclic redundancy check; Projection (relational algebra)","routes":{"ca_aff":true,"ca_fund":true,"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.0006142301,0.000713351,0.0007218196,0.0006261536,0.0005739596,0.0006678454,0.0007395353,0.0004452044,0.001209646],"category_scores_gemma":[0.001520268,0.0002952272,0.0004796871,0.000810585,0.0004206247,0.000698682,0.001117536,0.000811876,0.0005556713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005453276,"about_ca_system_score_gemma":0.001257656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002359167,"about_ca_topic_score_gemma":0.004205563,"domain_scores_codex":[0.9990665,0.0002342956,0.00004941032,0.000130187,0.0004158225,0.0001037663],"domain_scores_gemma":[0.9990005,0.0003331319,0.0001105844,0.0002554835,0.0002557745,0.00004441585],"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.0006116012,0.0001328812,0.001675248,0.0002056402,0.0001205958,0.0005179248,0.0002654652,0.289724,0.1185372,0.0370684,0.00331263,0.5478284],"study_design_scores_gemma":[0.00002165559,0.0001489126,0.0004568812,0.00001425521,0.00002672865,0.0002893002,0.00001749751,0.9322013,0.05793924,0.006153123,0.002709924,0.00002117554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04914351,0.0003584863,0.9462208,0.00009344426,0.00003202579,0.00006765282,0.00008394923,0.001878822,0.002121273],"genre_scores_gemma":[0.4559702,0.000232031,0.5401162,0.00008114399,0.00005501935,0.0001035741,0.0002598639,0.00009175328,0.003090321],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002359167,"threshold_uncertainty_score":0.004690826,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06993549167368075,"score_gpt":0.3316836919859912,"score_spread":0.2617482003123105,"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."}}