{"id":"W4402137504","doi":"10.1016/j.disc.2024.114195","title":"Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Government of Ontario; National Science Foundation","keywords":"Treewidth; Combinatorics; Mathematics; Partial k-tree; Tree-depth; Clique-sum; 1-planar graph; Tree decomposition; Discrete mathematics; Chordal graph; Bounded function; Pathwidth; Clique-width; Graph; Line graph; Voltage 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.0002270285,0.0002041972,0.0002036047,0.0003490832,0.0001831892,0.0004716709,0.000547812,0.00005494248,0.00001081151],"category_scores_gemma":[0.00002466513,0.0001478843,0.00007288999,0.00103054,0.0001601933,0.0005643903,0.0002207393,0.0002422979,0.00003467609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001824972,"about_ca_system_score_gemma":0.00004403075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002816975,"about_ca_topic_score_gemma":0.00001550061,"domain_scores_codex":[0.9985831,0.000051504,0.0002201488,0.0004230296,0.0003709044,0.0003513399],"domain_scores_gemma":[0.9987804,0.0003238936,0.00004203224,0.0006332187,0.00005737544,0.000163082],"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.000004441222,0.00003970073,0.00006299133,0.0001542384,0.00006144735,0.00007657794,0.001898842,0.000005135375,0.003647293,0.9874421,0.00007814173,0.006529094],"study_design_scores_gemma":[0.0002741924,0.0002675594,0.0003176326,0.0003296704,0.00003281879,0.0002585828,0.0002954606,0.04274929,0.004498309,0.9503392,0.0002520373,0.0003852371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2109486,0.0006130111,0.7776951,0.001013222,0.0001190936,0.0004621812,0.00001832513,0.0006225087,0.008507961],"genre_scores_gemma":[0.8319296,0.0000553083,0.1677085,0.00005148416,0.0000146297,0.00005480009,0.0000056883,0.00003285153,0.0001472404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6209809,"threshold_uncertainty_score":0.6030546,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02018227435742048,"score_gpt":0.298951843908471,"score_spread":0.2787695695510505,"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."}}