{"id":"W2949066063","doi":"10.48550/arxiv.1008.2814","title":"Convex optimization for the planted k-disjoint-clique problem","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; U.S. Air Force; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Disjoint sets; Combinatorics; Clique; Cluster analysis; Mathematics; Partition (number theory); Discrete mathematics; Clique percolation method; Time complexity; Computer science; Theoretical computer science; Complex network","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.0001061924,0.000257362,0.0002367594,0.000108641,0.0001184432,0.00005869627,0.0004788459,0.0004091717,0.00004396838],"category_scores_gemma":[0.00001797796,0.0002407624,0.0001503658,0.000125867,0.00007650234,0.00007269818,0.0002159999,0.000658413,0.000007870281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006297993,"about_ca_system_score_gemma":0.00004365053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005858387,"about_ca_topic_score_gemma":0.00005173888,"domain_scores_codex":[0.9991919,0.00002614785,0.0001473446,0.0003672696,0.00003888198,0.0002284792],"domain_scores_gemma":[0.9989732,0.0001409697,0.00009303487,0.0006008598,0.0001357479,0.00005620852],"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.00002547369,0.00001216187,0.00003620056,0.00005950866,0.0001048973,0.00001433367,0.00004891252,0.9909166,0.00033304,0.006082566,0.002161624,0.0002046998],"study_design_scores_gemma":[0.0002078973,0.00001723591,0.00003361113,0.0001141372,0.000114941,0.000003554941,0.00002913688,0.9859131,0.003392064,0.007443264,0.002436876,0.0002941904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0301838,0.00008323808,0.9647119,0.00005940543,0.0005917181,0.0008778497,0.00005156538,0.001138379,0.002302158],"genre_scores_gemma":[0.9925925,0.0004284133,0.006366726,0.00004850426,0.0001282971,0.000007395835,0.00008253151,0.0000550522,0.0002906447],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9624087,"threshold_uncertainty_score":0.9818006,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05312082031743726,"score_gpt":0.1728325266917433,"score_spread":0.119711706374306,"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."}}