{"id":"W3009926847","doi":"10.1109/access.2020.2990155","title":"Maximum Feasible Subsystem Algorithms for Recovery of Compressively Sensed Speech","year":2020,"lang":"en","type":"preprint","venue":"IEEE Access","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Computer science; Signal recovery; SIGNAL (programming language); Speech recognition; TIMIT; Algorithm; Compression (physics); Quality (philosophy); Hidden Markov model","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001237633,0.0004627595,0.0009117629,0.0001992706,0.0000466087,0.0001855793,0.001013191,0.0004455807,0.00001238086],"category_scores_gemma":[0.0000328618,0.0005007681,0.0003365266,0.0001760319,0.00004544772,0.0001578529,0.0003738919,0.0005074884,0.000007691562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009783292,"about_ca_system_score_gemma":0.00007211177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001747152,"about_ca_topic_score_gemma":0.00001569308,"domain_scores_codex":[0.9981506,0.00004925301,0.0006071706,0.0005444949,0.0002925859,0.0003559141],"domain_scores_gemma":[0.9984007,0.0001342861,0.0003043596,0.000768171,0.0002838178,0.0001086575],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004011034,0.0002262407,0.0004030403,0.009676686,0.002463147,0.0004322494,0.0005784105,0.1939548,0.2915006,0.0001468534,0.4304991,0.06971775],"study_design_scores_gemma":[0.0004656783,0.00006579666,0.0001709014,0.001111656,0.0001454585,0.00001958467,0.00001385573,0.1695529,0.8158201,0.009555297,0.002366642,0.000712154],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2744015,0.001736747,0.7007504,0.0001989508,0.009212999,0.003431614,0.001145417,0.003241357,0.005881021],"genre_scores_gemma":[0.9754722,0.0002345191,0.02264336,0.00009452974,0.001028132,0.0001529192,0.0001346014,0.0001784614,0.00006127435],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7010707,"threshold_uncertainty_score":0.9997444,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1070657736775267,"score_gpt":0.3230070308887786,"score_spread":0.2159412572112519,"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."}}