{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002597209,0.001102604,0.001244086,0.0008252835,0.0008752221,0.001420564,0.002187813,0.002253469,0.004117996],"category_scores_gemma":[0.01350056,0.0005960254,0.0008660152,0.001440833,0.00236241,0.004261776,0.002109287,0.002717238,0.000629123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001722849,"about_ca_system_score_gemma":0.001391706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002116422,"about_ca_topic_score_gemma":0.002972933,"domain_scores_codex":[0.9974301,0.001240062,0.00007042751,0.0004943528,0.0005224101,0.0002425874],"domain_scores_gemma":[0.9925211,0.005161067,0.0006937846,0.0006157659,0.0006130009,0.0003952023],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003850998,0.0002560079,0.0009637775,0.0002908917,0.00009399673,0.0002458478,0.0002746653,0.548479,0.003925395,0.384286,0.01036893,0.05043038],"study_design_scores_gemma":[0.00004279572,0.0000628922,0.0002059375,0.00002067874,0.00001031352,0.00009728113,0.00007318194,0.7999505,0.001399405,0.196032,0.002084663,0.00002039075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03602349,0.0004384482,0.9532258,0.001640287,0.00006794462,0.0001042589,0.0003045061,0.0002550643,0.007940236],"genre_scores_gemma":[0.488167,0.0007164275,0.4972894,0.0007369582,0.0002401437,0.0005205052,0.00118523,0.0003287551,0.0108156],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004117996,"threshold_uncertainty_score":0.01377606,"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."}}