{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003277177,0.001381983,0.001926695,0.001232781,0.0009968142,0.00229636,0.002968277,0.003147675,0.005903425],"category_scores_gemma":[0.0156144,0.001027201,0.0009008556,0.001982713,0.003294548,0.004220735,0.002882087,0.004238251,0.000676272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002354746,"about_ca_system_score_gemma":0.002162471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004527499,"about_ca_topic_score_gemma":0.006285412,"domain_scores_codex":[0.9984195,0.0008413153,0.00003591126,0.000271857,0.0003166915,0.0001146168],"domain_scores_gemma":[0.9928531,0.005503605,0.0004679832,0.0002950621,0.0005222,0.0003580782],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009414746,0.0001039647,0.0003513764,0.0002450241,0.00004861136,0.00006191099,0.0001294021,0.2594862,0.0007522504,0.7115536,0.007569819,0.01960371],"study_design_scores_gemma":[0.00001809061,0.00002019509,0.0001225488,0.00002278887,0.000006302221,0.00002880749,0.00004119814,0.6255973,0.0001781498,0.3724661,0.001482957,0.00001564409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01711004,0.0006193087,0.9703078,0.002109628,0.00009957933,0.000063375,0.0003365272,0.00007628404,0.009277417],"genre_scores_gemma":[0.4093917,0.002396411,0.5488406,0.001088431,0.0007916455,0.0009752117,0.001737247,0.0005328671,0.03424605],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005903425,"threshold_uncertainty_score":0.01974893,"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."}}