{"id":"W2094443059","doi":"10.1155/2013/101974","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"M1\"><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:math>-Goodness for Low-Rank Matrix Recovery","year":2013,"lang":"en","type":"article","venue":"Abstract and Applied Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Office of Naval Research; National Natural Science Foundation of China","keywords":"Algorithm; Artificial intelligence; Rank (graph theory); Computer science; Mathematics; Combinatorics","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.004044851,0.001601429,0.001209232,0.002655692,0.001433095,0.005316541,0.00309039,0.003801703,0.06148408],"category_scores_gemma":[0.01620681,0.0009980563,0.00147897,0.004871574,0.002513796,0.007178642,0.004592396,0.003389493,0.06227511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002108175,"about_ca_system_score_gemma":0.00278447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007685669,"about_ca_topic_score_gemma":0.009035197,"domain_scores_codex":[0.9943013,0.00141229,0.0006099861,0.0008511966,0.002448758,0.0003765484],"domain_scores_gemma":[0.9935961,0.002091444,0.0006223531,0.002075269,0.001352524,0.0002623565],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003291044,0.0001773914,0.000687256,0.0006020818,0.00004549044,0.0002807044,0.0002908876,0.01794648,0.009486504,0.3624823,0.2541993,0.3534725],"study_design_scores_gemma":[0.00006976975,0.0001362019,0.001102608,0.0002200182,0.00002908275,0.0006112988,0.0001864479,0.1063366,0.01406827,0.3334115,0.5437013,0.0001270058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003743232,0.00125073,0.8905489,0.005610315,0.0009958227,0.0004949293,0.006599372,0.008737801,0.0820189],"genre_scores_gemma":[0.08091004,0.006484195,0.7434386,0.005108316,0.001309994,0.001502054,0.02426523,0.009348613,0.127633],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.06148408,"threshold_uncertainty_score":0.2056847,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01244491763012212,"score_gpt":0.2271365137099731,"score_spread":0.2146915960798509,"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."}}