{"id":"W4388471823","doi":"10.1016/j.jctb.2023.10.008","title":"Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Induced subgraph; Subdivision; Bipartite graph; Discrete mathematics; Treewidth; Chordal graph; Cograph; Graph; Pathwidth; 1-planar graph; 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.0003587676,0.000490425,0.0006370319,0.001887804,0.00145183,0.00267404,0.0006407941,0.0009285202,0.006554803],"category_scores_gemma":[0.001166884,0.00050563,0.001054998,0.001488185,0.002136941,0.002677497,0.00230195,0.001857814,0.0007258097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007660829,"about_ca_system_score_gemma":0.0004072055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00139719,"about_ca_topic_score_gemma":0.001592398,"domain_scores_codex":[0.9996716,0.00004997153,0.00001956592,0.00005780768,0.00009643653,0.0001046647],"domain_scores_gemma":[0.9993083,0.0003045557,0.0001089219,0.0000659108,0.00005252747,0.0001597312],"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.00004616612,0.00005637618,0.0009231754,0.00009027834,0.00001137669,0.0002122477,0.0006207346,0.001255297,0.002475884,0.9834029,0.001994806,0.008910667],"study_design_scores_gemma":[0.00001500643,0.00001908832,0.001512197,0.00002115013,0.00001415178,0.0002160192,0.0002661461,0.003153685,0.0005959062,0.989408,0.00476609,0.00001258517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7839085,0.004617894,0.07948496,0.002855467,0.0003328773,0.0001422071,0.0009624696,0.0004252829,0.1272703],"genre_scores_gemma":[0.9677148,0.001696976,0.009782351,0.0002973548,0.0003307957,0.00006571607,0.0006761783,0.00007966507,0.01935625],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006554803,"threshold_uncertainty_score":0.02192801,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01708769828687356,"score_gpt":0.278206460138426,"score_spread":0.2611187618515525,"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."}}