{"id":"W1936234780","doi":"10.1007/s10107-013-0733-1","title":"Convex optimization for the planted k-disjoint-clique problem","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Disjoint sets; Mathematics; Combinatorics; Clique; Cluster analysis; Partition (number theory); Discrete mathematics","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.0001229197,0.0001264039,0.0001515688,0.00002851823,0.00008684217,0.0001350152,0.0001356073,0.00006918565,0.0001150348],"category_scores_gemma":[0.00005892085,0.00008401171,0.00006072382,0.00008022906,0.00004515296,0.00008918858,0.00002575987,0.0001061517,0.00004180556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001694363,"about_ca_system_score_gemma":0.000004595287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005530804,"about_ca_topic_score_gemma":6.860181e-7,"domain_scores_codex":[0.9993228,0.00001114961,0.000219321,0.0001085039,0.00009413744,0.0002441159],"domain_scores_gemma":[0.9994141,0.0002511254,0.00002996069,0.0001949709,0.00006567619,0.00004415926],"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.00003506379,0.000415037,0.00006082822,0.001993203,0.0006088013,0.00001059385,0.002775693,0.186506,0.008945514,0.1106021,0.04347454,0.6445727],"study_design_scores_gemma":[0.0001108827,0.00003019852,0.000004227613,0.0001117416,0.0000230838,0.00001060729,0.00009063938,0.9740744,0.004170225,0.01785327,0.003385768,0.0001349195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001529104,0.00009547771,0.9937694,0.0002766815,0.00004826107,0.001454211,0.000001059985,0.001063488,0.001762322],"genre_scores_gemma":[0.5135566,0.0000114495,0.4852526,0.00007313133,0.00007419876,0.0008931449,0.000009369924,0.00005110127,0.00007838647],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7875684,"threshold_uncertainty_score":0.3425898,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01551004089108949,"score_gpt":0.2234298615200835,"score_spread":0.207919820628994,"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."}}