{"id":"W2090354123","doi":"10.1016/j.dam.2008.08.020","title":"Finding a maximum-weight induced <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-partite subgraph of an <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>i</mml:mi></mml:math>-triangulated graph","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Clique graph; Block graph; Complete bipartite graph; Discrete mathematics; Graph; Line graph; Induced subgraph isomorphism problem; Induced subgraph; Cograph; Split graph; Algorithm; Pathwidth; Graph power; Voltage graph; Vertex (graph theory)","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":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.003127032,0.001991285,0.001491967,0.001121744,0.00234697,0.001218262,0.004718272,0.002106845,0.0001181045],"category_scores_gemma":[0.001020398,0.002328522,0.002067982,0.003144522,0.001930188,0.002524408,0.00311412,0.002589516,0.001569594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009110833,"about_ca_system_score_gemma":0.001158748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002684254,"about_ca_topic_score_gemma":0.0002021232,"domain_scores_codex":[0.9855136,0.0003787484,0.003501689,0.003028392,0.004081245,0.003496269],"domain_scores_gemma":[0.9876871,0.001925909,0.003189339,0.005343521,0.0003877395,0.001466461],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001101436,0.001055938,0.00002116955,0.001469863,0.001201712,0.001043231,0.004969268,0.002023301,0.01869962,0.9666998,0.0004055456,0.001309121],"study_design_scores_gemma":[0.003280842,0.001217463,0.0000985455,0.00115495,0.0007018605,0.0009871499,0.001325865,0.920936,0.05049576,0.01692239,0.0008316389,0.002047529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9733472,0.0005266832,0.0196536,0.0002594052,0.001189363,0.0005617134,0.0005081231,0.0009154497,0.003038414],"genre_scores_gemma":[0.9544057,0.0007348263,0.04019074,0.0006572672,0.0008204988,0.001319027,0.0009172203,0.0008157726,0.0001389632],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9497774,"threshold_uncertainty_score":0.9998186,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02428673182251163,"score_gpt":0.2640691380083284,"score_spread":0.2397824061858168,"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."}}