{"id":"W2072445778","doi":"10.1016/j.disc.2013.08.017","title":"The cluster deletion problem for cographs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Split graph; Time complexity; Partition (number theory); Cograph; Clique graph; Graph; Clique; Discrete mathematics; Chordal graph; Line graph; Graph power; 1-planar graph","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.002026845,0.0008714275,0.002211979,0.001619685,0.004571679,0.004717279,0.005183215,0.003662877,0.0101998],"category_scores_gemma":[0.01531896,0.0009472381,0.001419796,0.003976043,0.003465602,0.01198249,0.004309148,0.004177383,0.001412636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003042492,"about_ca_system_score_gemma":0.002763682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00503335,"about_ca_topic_score_gemma":0.004190623,"domain_scores_codex":[0.9975412,0.0006230899,0.0001306811,0.0007435423,0.0004921418,0.0004693574],"domain_scores_gemma":[0.9863548,0.008274037,0.0009967778,0.002222889,0.001134279,0.001017196],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003921514,0.0001443261,0.002458249,0.0004673018,0.00006784074,0.0003443417,0.0007666431,0.04964438,0.002169814,0.8821141,0.02037685,0.04105405],"study_design_scores_gemma":[0.00006289046,0.00002326814,0.000614868,0.00004250733,0.00003441843,0.0003027241,0.0004882909,0.05095847,0.001734365,0.9365043,0.009206318,0.00002756167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4222078,0.001534129,0.5217515,0.009879804,0.000407806,0.0003013657,0.002696793,0.0009668723,0.04025398],"genre_scores_gemma":[0.7946183,0.001146386,0.1698697,0.001032963,0.0003684488,0.0003394925,0.005580591,0.0006007513,0.02644342],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0101998,"threshold_uncertainty_score":0.03412169,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01541190131085694,"score_gpt":0.2459727440412529,"score_spread":0.230560842730396,"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."}}