{"id":"W2116616571","doi":"10.1007/s10107-011-0459-x","title":"Nuclear norm minimization for the planted clique and biclique problems","year":2011,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":119,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Complete bipartite graph; Mathematics; Combinatorics; Bipartite graph; Clique problem; Clique; Matrix norm; Generalization; Discrete mathematics; Minification; Graph; Mathematical optimization; Line graph; Pathwidth","routes":{"ca_aff":true,"ca_fund":false,"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":[],"consensus_categories":[],"category_scores_codex":[0.0001250732,0.0001065952,0.0001210867,0.00002910233,0.00008325454,0.00004926909,0.00009418496,0.00006990187,0.00001575415],"category_scores_gemma":[0.00004948785,0.00007330186,0.00003563434,0.00006117276,0.00005505911,0.00005667123,0.00002848675,0.00008898535,0.000005603719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008942496,"about_ca_system_score_gemma":0.000002585735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004556476,"about_ca_topic_score_gemma":0.000002925863,"domain_scores_codex":[0.9994783,0.000009454603,0.0001712371,0.000103363,0.00005914685,0.0001784857],"domain_scores_gemma":[0.9996283,0.0001294337,0.00002601122,0.000148266,0.00002981241,0.00003814928],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001620364,0.0006014747,0.0003601443,0.002726824,0.0006100397,0.00002779776,0.02751406,0.0007226024,0.01569671,0.3870978,0.004752451,0.5597281],"study_design_scores_gemma":[0.0004618214,0.0002546109,0.0001793578,0.000523244,0.0001279586,0.00009100972,0.0005505171,0.867628,0.0178882,0.08646192,0.025305,0.0005283513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.054249,0.0002825663,0.9379282,0.0001387828,0.00009216948,0.001735807,0.0000028568,0.0018251,0.003745526],"genre_scores_gemma":[0.8846297,0.00003204309,0.1150798,0.00004284789,0.000035667,0.000116447,0.00000203032,0.00004328945,0.00001816134],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8669054,"threshold_uncertainty_score":0.2989163,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04039522035801042,"score_gpt":0.2216688850264545,"score_spread":0.1812736646684441,"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."}}