{"id":"W2950358183","doi":"10.48550/arxiv.0901.3348","title":"Nuclear norm minimization for the planted clique and biclique problems","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Complete bipartite graph; Bipartite graph; Combinatorics; Clique problem; Mathematics; Clique; Generalization; Matrix norm; Minification; Discrete mathematics; Graph; Mathematical optimization; Chordal graph","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":[],"consensus_categories":[],"category_scores_codex":[0.00007533836,0.0002102323,0.000191859,0.0001023574,0.0001064674,0.00005496143,0.0002656757,0.0002649794,0.000005486394],"category_scores_gemma":[0.00001272115,0.0001987361,0.0000823566,0.0001112171,0.00005248861,0.00006821977,0.0001399394,0.0003058161,0.000002743339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005770316,"about_ca_system_score_gemma":0.00001798322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004309898,"about_ca_topic_score_gemma":0.00004002775,"domain_scores_codex":[0.9993312,0.00002647582,0.000120324,0.0003166654,0.00002831841,0.000176979],"domain_scores_gemma":[0.999354,0.00009273848,0.0000679462,0.0003660018,0.00007187855,0.00004741638],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006704198,0.00002848424,0.0001807405,0.0001451484,0.0001635383,0.00002924075,0.0002556384,0.9731207,0.0007839137,0.01937415,0.004366682,0.001484709],"study_design_scores_gemma":[0.0002387342,0.00004634217,0.0004211456,0.0002118628,0.0001067282,0.000005846226,0.00004186063,0.9753488,0.001030687,0.01725489,0.004988673,0.0003044557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4673371,0.0004787325,0.5254298,0.0001957569,0.0003929226,0.001590521,0.00005564728,0.00186646,0.00265305],"genre_scores_gemma":[0.9968728,0.001928058,0.000874073,0.00008348442,0.00006957416,0.000001859793,0.00002736515,0.00003798394,0.0001047657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5295358,"threshold_uncertainty_score":0.8104225,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05416914764997338,"score_gpt":0.1660527267214052,"score_spread":0.1118835790714318,"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."}}