{"id":"W4387101675","doi":"10.1017/s0963548323000275","title":"The Excluded Tree Minor Theorem Revisited","year":2023,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; Monash University; Australian Government","keywords":"Minor (academic); Combinatorics; Mathematics; Robertson–Seymour theorem; Graph minor; Discrete mathematics; Graph; Upper and lower bounds; Tree (set theory); RADIUS; Pathwidth; Line graph; Computer science; Graph power; Law; Mathematical analysis","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.001369384,0.0004267819,0.0009431397,0.00102451,0.001680674,0.001727432,0.001765237,0.001099203,0.007928499],"category_scores_gemma":[0.006665265,0.0004219139,0.0009968437,0.000732666,0.003038476,0.004304433,0.002770579,0.002143465,0.001419259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009506435,"about_ca_system_score_gemma":0.0005916776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001232418,"about_ca_topic_score_gemma":0.001027588,"domain_scores_codex":[0.9983729,0.0003860173,0.0000646001,0.0004493941,0.0004633109,0.0002636492],"domain_scores_gemma":[0.9940125,0.003459431,0.0004632779,0.0008349718,0.0006826943,0.0005470673],"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.0003693644,0.00006495949,0.001995372,0.0003404288,0.00005758424,0.0007569724,0.0006698522,0.006944664,0.0208251,0.9384995,0.008392264,0.0210839],"study_design_scores_gemma":[0.00008533644,0.0002285061,0.002265724,0.00008416113,0.00007660437,0.002884239,0.0003786186,0.04782619,0.01830798,0.8779981,0.0498047,0.00005979483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3463303,0.005069124,0.532524,0.005275037,0.0005525695,0.000134952,0.0007583774,0.001368999,0.1079867],"genre_scores_gemma":[0.9533998,0.000777374,0.03399145,0.0008919049,0.000299737,0.0001088731,0.0003313909,0.0002979094,0.00990165],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007928499,"threshold_uncertainty_score":0.02652347,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03979777161409261,"score_gpt":0.3033330711657489,"score_spread":0.2635352995516563,"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."}}