{"id":"W4287589184","doi":"10.48550/arxiv.2011.12882","title":"Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller\\n Codes","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Redundancy (engineering); Computer science; Computation; Cyclic redundancy check; Soft-decision decoder; Decoding methods; Algorithm; Projection (relational algebra); Selection (genetic algorithm); Code (set theory); Artificial intelligence","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.0005076714,0.0005964084,0.0005810542,0.0005575829,0.0005339039,0.0005879082,0.0006308642,0.0003634722,0.001119656],"category_scores_gemma":[0.001275403,0.0002377187,0.0003559927,0.0006639599,0.0003554159,0.0005707353,0.001020119,0.0007045792,0.0004177361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005254343,"about_ca_system_score_gemma":0.001317155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002727326,"about_ca_topic_score_gemma":0.005305558,"domain_scores_codex":[0.9993105,0.0001596474,0.00003374125,0.0001005919,0.0003148945,0.0000806594],"domain_scores_gemma":[0.9992934,0.0002478228,0.0000816844,0.000160808,0.0001797896,0.00003646932],"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.0006718722,0.0001466666,0.002252419,0.0001709126,0.0001054776,0.0004817132,0.0002762479,0.3023381,0.1098321,0.03269077,0.003049641,0.5479841],"study_design_scores_gemma":[0.00001936822,0.0001298733,0.0005358171,0.00001317961,0.00002002308,0.0002245621,0.00001941074,0.9462354,0.04624214,0.004543478,0.002000714,0.00001599695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07880994,0.000391136,0.9159653,0.0001102942,0.00003344547,0.00006371256,0.00008503994,0.001713867,0.002827228],"genre_scores_gemma":[0.5184134,0.0002186472,0.4771533,0.00007605726,0.00004667662,0.0000828441,0.0002220792,0.00006350575,0.003723593],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002727326,"threshold_uncertainty_score":0.00542289,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1691998762781499,"score_gpt":0.2421492801451077,"score_spread":0.07294940386695772,"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."}}