{"id":"W7110215014","doi":"10.4230/lipics.stacs.2025.64","title":"Cluster Editing on Cographs and Related Classes","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Parameterized complexity; Time complexity; Permutation (music); Upper and lower bounds; Connected component; Computational complexity theory; Cograph","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.001241943,0.001041041,0.001313609,0.001870241,0.003234659,0.003446322,0.002842019,0.002000902,0.009127474],"category_scores_gemma":[0.008436296,0.0006033271,0.001562861,0.003519919,0.002265955,0.007839876,0.002734846,0.002549404,0.001147212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003657764,"about_ca_system_score_gemma":0.001678434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005447012,"about_ca_topic_score_gemma":0.004323409,"domain_scores_codex":[0.9971636,0.00037629,0.0001204124,0.001329123,0.000531518,0.0004790526],"domain_scores_gemma":[0.9905019,0.004911635,0.00099495,0.002152407,0.0007084591,0.0007306634],"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.0003344894,0.0002906237,0.002881563,0.0006210364,0.00008233922,0.0005109831,0.001218935,0.07990434,0.005046687,0.762904,0.02510935,0.1210956],"study_design_scores_gemma":[0.00006369855,0.0000511962,0.001392818,0.0000479778,0.00004109833,0.0005449722,0.0002996723,0.1421366,0.002696559,0.8206153,0.032063,0.0000471361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2344384,0.001547669,0.7120156,0.003859907,0.0003192858,0.000649098,0.003998314,0.003792281,0.03937941],"genre_scores_gemma":[0.6948088,0.001520229,0.2677998,0.001321694,0.0006871804,0.000538248,0.006733396,0.0009596547,0.02563095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009127474,"threshold_uncertainty_score":0.03053445,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01084141654841659,"score_gpt":0.2879487968008924,"score_spread":0.2771073802524758,"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."}}