{"id":"W3197941146","doi":"10.19086/aic.2022.6","title":"Induced subgraphs and tree decompositions III. Three-path-configurations and logarithmic treewidth","year":2022,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"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; National Science Foundation","keywords":"Combinatorics; Treewidth; Mathematics; Discrete mathematics; Logarithm; Pathwidth; Tree-depth; Conjecture; Induced subgraph; Cograph; Clique-sum; Distance-hereditary graph; Induced path; Chordal graph; Partial k-tree; Graph; 1-planar graph; Vertex (graph theory); Line graph; Graph power","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.0005233163,0.0004336548,0.0004088881,0.0008277139,0.0007045853,0.00164957,0.0009254616,0.000561782,0.003876925],"category_scores_gemma":[0.003648706,0.0004714697,0.0006918876,0.001844038,0.001619373,0.003149576,0.001092035,0.001524111,0.0004676244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001818383,"about_ca_system_score_gemma":0.0004656485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00223374,"about_ca_topic_score_gemma":0.002347451,"domain_scores_codex":[0.9994532,0.00009169188,0.00002097426,0.0001797172,0.0001280161,0.0001264015],"domain_scores_gemma":[0.9966542,0.001978094,0.0005192233,0.0004601419,0.0001855291,0.0002027988],"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.0004965826,0.0001981069,0.008583459,0.000473843,0.00008188363,0.0004722535,0.001045318,0.06223573,0.02298362,0.8025317,0.01289202,0.08800548],"study_design_scores_gemma":[0.00005468231,0.00005300214,0.003200841,0.00005417507,0.00004531265,0.0006186232,0.0002238737,0.06923931,0.006151315,0.9107226,0.00961577,0.00002060553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6750628,0.005022566,0.2681451,0.003683909,0.00009734298,0.0001063279,0.001624118,0.0008416266,0.0454162],"genre_scores_gemma":[0.9433286,0.001686677,0.04690646,0.00046765,0.0001271811,0.0001020936,0.001452005,0.0001678659,0.005761444],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003876925,"threshold_uncertainty_score":0.01319337,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0139773583394366,"score_gpt":0.2812867664249737,"score_spread":0.2673094080855371,"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."}}