{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002334615,0.001923744,0.002008651,0.0007326949,0.0007606416,0.001682953,0.002261861,0.002247276,0.005943432],"category_scores_gemma":[0.009179124,0.0008536621,0.00112113,0.001710334,0.001841655,0.003433911,0.001840041,0.003216342,0.0008450203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002084331,"about_ca_system_score_gemma":0.001480149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004249834,"about_ca_topic_score_gemma":0.005102221,"domain_scores_codex":[0.998068,0.0009333118,0.00005463012,0.0004630904,0.000278414,0.000202571],"domain_scores_gemma":[0.9948096,0.004096572,0.0003029714,0.0002917128,0.000297573,0.0002015724],"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.0001837966,0.0001725134,0.0006407112,0.0003139697,0.00009416712,0.0002118639,0.0001030974,0.8750363,0.001111377,0.08834797,0.01106532,0.02271892],"study_design_scores_gemma":[0.00003673553,0.00003229494,0.0001766916,0.00001661288,0.000009256177,0.00004516936,0.0000344769,0.9189434,0.0002439077,0.07897663,0.001475496,0.000009318867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01936351,0.0006822468,0.9700759,0.00180708,0.00009765734,0.0001388316,0.0008242663,0.0002243178,0.006786266],"genre_scores_gemma":[0.4503443,0.001571493,0.5312937,0.001027209,0.0004405627,0.0007961101,0.003165436,0.0004802159,0.01088096],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005943432,"threshold_uncertainty_score":0.0198828,"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."}}