{"id":"W2598883699","doi":"10.1002/jgt.22111","title":"Bounding the Clique‐Width of <i>H</i>‐Free Chordal Graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Chordal graph; Combinatorics; Mathematics; Treewidth; Split graph; Clique-sum; Interval graph; Indifference graph; Discrete mathematics; Bounded function; Independence number; Induced subgraph; Pathwidth; Vertex (graph theory); Graph; 1-planar graph; Line graph","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":["open_science"],"consensus_categories":[],"category_scores_codex":[0.007977569,0.0001940971,0.0004033648,0.0004958907,0.0009079562,0.000335592,0.00800689,0.0000795913,0.00001945131],"category_scores_gemma":[0.001537622,0.0001216251,0.0005235448,0.0004058607,0.001179245,0.001413858,0.0008639756,0.000757319,0.000003985951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000284466,"about_ca_system_score_gemma":0.0001518824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004959654,"about_ca_topic_score_gemma":0.000005751346,"domain_scores_codex":[0.9970994,0.000688644,0.0006693685,0.0002296116,0.0008732007,0.0004397721],"domain_scores_gemma":[0.994491,0.000998126,0.001489913,0.002377115,0.0004676782,0.0001761882],"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.0001908641,0.00006924412,0.002423551,0.00001647575,0.000121063,0.00005485776,0.0006002462,0.0000203678,0.004418572,0.9727404,0.0004968239,0.0188475],"study_design_scores_gemma":[0.0007020911,0.0002905297,0.007000995,0.00009272435,0.00002134505,0.0001897415,0.0001241337,0.00004531495,0.007798333,0.9825237,0.001076862,0.0001342469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4302604,0.003427238,0.5446255,0.004755511,0.002988619,0.0004401307,0.00001213417,0.00006722962,0.01342321],"genre_scores_gemma":[0.9875202,0.0003694217,0.01164007,0.0001732746,0.0001351121,0.000003347716,1.092627e-7,0.00001950388,0.0001389984],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5572597,"threshold_uncertainty_score":0.9973603,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02511845915547385,"score_gpt":0.3149270744807101,"score_spread":0.2898086153252363,"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."}}