{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003384339,0.0001813615,0.0002277133,0.0004484096,0.0007094766,0.0000984607,0.0006960402,0.00004460637,0.00001037975],"category_scores_gemma":[0.00005036175,0.000201389,0.00003658338,0.00160029,0.0001586022,0.001144087,0.0006676862,0.0005181981,0.000001493427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001149782,"about_ca_system_score_gemma":0.00006641098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002470757,"about_ca_topic_score_gemma":0.000192766,"domain_scores_codex":[0.9982322,0.0001728893,0.0002758564,0.0005512589,0.0003799711,0.0003878389],"domain_scores_gemma":[0.9987229,0.0004773828,0.00009616696,0.0005056184,0.00006839048,0.0001295619],"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.0000166431,0.000160304,0.007496666,0.00001144517,0.000007693198,0.00004340932,0.0003983733,0.0001676767,0.0007827128,0.9471121,0.00001652801,0.04378641],"study_design_scores_gemma":[0.001417431,0.0004030809,0.007509543,0.00001253007,0.000005498681,0.00008059425,0.0002044771,0.01107932,0.0003587807,0.9758888,0.00273046,0.0003094533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6696182,0.01965445,0.2942267,0.002276857,0.001769182,0.001679634,0.00004663477,0.0004855107,0.01024278],"genre_scores_gemma":[0.9929847,0.0008204659,0.005800059,0.00009681151,0.00001003389,0.0002178736,0.00000732874,0.00001472344,0.00004801596],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3233665,"threshold_uncertainty_score":0.8212405,"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."}}