{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000247506,0.0002527903,0.0003936718,0.0007135525,0.0007270586,0.0007764461,0.0004772225,0.000410415,0.003121639],"category_scores_gemma":[0.001273265,0.0003002669,0.0004891122,0.0007841976,0.0007725967,0.001602261,0.001172318,0.000874137,0.0003361422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000586386,"about_ca_system_score_gemma":0.0002378794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001274686,"about_ca_topic_score_gemma":0.001624713,"domain_scores_codex":[0.9996233,0.00006028674,0.00001877343,0.00009429582,0.0001166429,0.00008664756],"domain_scores_gemma":[0.9986424,0.0005249532,0.0002745437,0.0001994915,0.0001633073,0.0001953027],"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.0003248179,0.0001746258,0.007884507,0.0002854158,0.00006556548,0.001898818,0.001691717,0.01346758,0.02510169,0.9003253,0.005863315,0.04291673],"study_design_scores_gemma":[0.00005375411,0.00009700705,0.005761431,0.00007368522,0.00008542321,0.00109017,0.0007321185,0.03158086,0.008383644,0.9311337,0.0209813,0.00002687889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8606569,0.000642724,0.1104911,0.0007813433,0.00006268257,0.00007270398,0.0006144741,0.000290936,0.02638723],"genre_scores_gemma":[0.9688435,0.0003035946,0.02450082,0.0001848327,0.00003462651,0.00004734273,0.0008998511,0.00005994341,0.005125416],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003121639,"threshold_uncertainty_score":0.01044291,"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."}}