{"id":"W4388850666","doi":"10.1002/jgt.23055","title":"Induced subgraphs and tree decompositions V. one neighbor in a hole","year":2023,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Government of Ontario; National Science Foundation","keywords":"Treewidth; Combinatorics; 1-planar graph; Mathematics; Tree-depth; Clique-sum; Partial k-tree; Tree decomposition; Vertex (graph theory); Discrete mathematics; Bounded function; Pathwidth; Chordal graph; 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":[],"consensus_categories":[],"category_scores_codex":[0.001991767,0.0001319014,0.0002807009,0.002017876,0.0001299543,0.00009313912,0.0008054427,0.0000689347,0.00001019394],"category_scores_gemma":[0.0001684994,0.0001174859,0.0001438199,0.002721878,0.0001588743,0.0007452585,0.0002116341,0.000491888,0.00001264544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002734904,"about_ca_system_score_gemma":0.00007129553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003740254,"about_ca_topic_score_gemma":0.00002313762,"domain_scores_codex":[0.9981466,0.0004397003,0.0004256175,0.0002170915,0.0004004165,0.0003705948],"domain_scores_gemma":[0.9983543,0.0007612242,0.0001986102,0.0003522222,0.0001428041,0.00019081],"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.0001915586,0.0001911174,0.004027156,0.0000178758,0.00007843533,0.0002995819,0.001245634,0.00009089769,0.05111429,0.8913881,0.0001258854,0.05122949],"study_design_scores_gemma":[0.0009126943,0.0003193659,0.04990488,0.00008722598,0.000008198983,0.00009017091,0.0002131326,0.0003793173,0.002617988,0.9452761,0.00005000903,0.0001409646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9492087,0.0005863428,0.0479014,0.001101211,0.000205836,0.0001405083,0.000002704268,0.00006596939,0.000787342],"genre_scores_gemma":[0.993001,0.0003531554,0.006411518,0.0001232332,0.00004147003,0.000006834455,5.569361e-7,0.0000140779,0.00004815324],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05388798,"threshold_uncertainty_score":0.4790938,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.031559004045184,"score_gpt":0.3038237905158429,"score_spread":0.2722647864706589,"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."}}