{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001119773,0.0008283368,0.0006509961,0.001992205,0.001283269,0.002442054,0.001802263,0.001052145,0.005100537],"category_scores_gemma":[0.004775129,0.0006029969,0.001075011,0.001729558,0.001553046,0.00317127,0.001661062,0.001896866,0.0005431579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002013091,"about_ca_system_score_gemma":0.001326234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004440801,"about_ca_topic_score_gemma":0.003189792,"domain_scores_codex":[0.9990558,0.0001778258,0.00004198196,0.000304385,0.0001893475,0.0002305894],"domain_scores_gemma":[0.9941869,0.003585177,0.000518708,0.0006451439,0.0004442232,0.000619856],"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.0009951593,0.0005539299,0.007151452,0.0004147917,0.0001425807,0.0003764409,0.0006562266,0.1467467,0.01855135,0.6581945,0.02247016,0.1437467],"study_design_scores_gemma":[0.000104639,0.00005784196,0.001119902,0.0000376578,0.00002783977,0.0001974048,0.0001054877,0.3001732,0.005469381,0.6885839,0.004091879,0.00003081599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4254749,0.0004485003,0.556089,0.001640538,0.00006341529,0.0001794745,0.001244408,0.001251177,0.01360865],"genre_scores_gemma":[0.7963875,0.0002737852,0.1918052,0.0003774915,0.000096172,0.0002206728,0.002877278,0.0003752403,0.007586741],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005100537,"threshold_uncertainty_score":0.01706302,"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."}}