{"id":"W2978598014","doi":"10.1002/jgt.22499","title":"The class of (P7,C4,C5)‐free graphs: Decomposition, algorithms, and χ‐boundedness","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University","funders":"FP7 Ideas: European Research Council; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Split graph; Chordal graph; Induced path; Discrete mathematics; Cograph; Induced subgraph; Independent set; Indifference graph; Pathwidth; Block graph; Perfect graph; Modular decomposition; 1-planar graph; Graph; Longest path problem; Line graph; Vertex (graph theory)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003978955,0.000189717,0.0003731655,0.0005210926,0.0002912032,0.000166092,0.002360195,0.00008322504,0.00001349669],"category_scores_gemma":[0.0002111395,0.0001246186,0.0002659114,0.0008637083,0.0006725258,0.0008468077,0.0004188558,0.0004968916,0.000005814185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003035506,"about_ca_system_score_gemma":0.0001184468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001897206,"about_ca_topic_score_gemma":0.000003462138,"domain_scores_codex":[0.9972875,0.0006674379,0.0006562179,0.0002495788,0.0007527268,0.0003865833],"domain_scores_gemma":[0.9959543,0.001602011,0.0006364158,0.0009569512,0.0006707632,0.0001795857],"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.0002450595,0.00007551679,0.001664144,0.00002463743,0.0001410663,0.00002010864,0.0003617178,0.00004113766,0.003303888,0.9765621,0.0002716937,0.01728887],"study_design_scores_gemma":[0.0009887,0.0004646192,0.003476475,0.00008426204,0.00001801742,0.0003113055,0.0003142858,0.000339768,0.002760679,0.9897335,0.00135794,0.0001505025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7129414,0.008484902,0.2724456,0.001753649,0.001831269,0.0004750712,0.00001083124,0.00005364362,0.002003586],"genre_scores_gemma":[0.9872806,0.0009959408,0.01125958,0.0001616339,0.00006629687,0.000004325174,4.650881e-7,0.00002303464,0.0002081133],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2743392,"threshold_uncertainty_score":0.5081799,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01021312439609918,"score_gpt":0.2832368930464169,"score_spread":0.2730237686503177,"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."}}