{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003415541,0.0001175749,0.000115187,0.00004167053,0.0004083091,0.0004906665,0.0008068642,0.0000385536,0.000009489816],"category_scores_gemma":[0.00004708068,0.00007287501,0.0001268716,0.0002137851,0.00009044983,0.0002743741,0.0001806989,0.00007783828,0.00006114647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009515141,"about_ca_system_score_gemma":0.0000133008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006805989,"about_ca_topic_score_gemma":0.000006707766,"domain_scores_codex":[0.9990599,0.00002518997,0.0002522855,0.0001823102,0.0001995623,0.0002807304],"domain_scores_gemma":[0.9987838,0.0004121326,0.0001040996,0.000524051,0.0001207133,0.00005525361],"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.000001139045,0.00003783011,0.00001168669,0.00006874216,0.0000236458,1.722339e-7,0.0009914055,0.00001449795,0.00005174515,0.9593653,0.007612344,0.03182146],"study_design_scores_gemma":[0.000156587,0.00004483734,0.00004755192,0.00002329975,0.000005805148,0.000005517715,0.0001278087,0.3137774,0.0001239715,0.6760795,0.009492679,0.0001151468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001579861,0.00006656656,0.9910912,0.003111097,0.0001700854,0.0008592619,0.000003270423,0.0001255893,0.002993082],"genre_scores_gemma":[0.05280503,0.00002868911,0.9451045,0.000403556,0.00008583624,0.000619024,0.000006336179,0.0000200269,0.0009270416],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3137628,"threshold_uncertainty_score":0.4731508,"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."}}