{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002723371,0.000500766,0.0004453039,0.001873396,0.000758352,0.002274245,0.0005861393,0.0008974851,0.009560627],"category_scores_gemma":[0.001330242,0.0005572134,0.0007957792,0.001863044,0.0009725041,0.001958157,0.0009926453,0.001833961,0.001309008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007270271,"about_ca_system_score_gemma":0.0003361034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001303004,"about_ca_topic_score_gemma":0.001690139,"domain_scores_codex":[0.9996333,0.00007621595,0.00002233173,0.0001045377,0.00009716702,0.00006651382],"domain_scores_gemma":[0.9992306,0.0002804844,0.0001785515,0.00008157752,0.000116758,0.0001120531],"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.00009103332,0.00005913045,0.0009223644,0.0002442407,0.00004777468,0.0003435719,0.0004725853,0.004670454,0.00721828,0.9435721,0.008558463,0.03379999],"study_design_scores_gemma":[0.00001501297,0.00001811323,0.001341724,0.00006654769,0.00003324839,0.0004604771,0.0002387029,0.01096301,0.001591246,0.9733257,0.01193355,0.00001263527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4040571,0.007789752,0.4121468,0.003555364,0.0006342278,0.0002652186,0.003226658,0.0006052947,0.1677195],"genre_scores_gemma":[0.7946732,0.003662335,0.144199,0.0007500641,0.0004235939,0.0001667678,0.003565666,0.0002705257,0.05228876],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009560627,"threshold_uncertainty_score":0.03198344,"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."}}