{"id":"W2778851403","doi":"10.1137/1.9781611975031.17","title":"A Polynomial Excluded-Minor Approximation of Treedepth","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Treewidth; Combinatorics; Mathematics; Pathwidth; Minor (academic); Partial k-tree; 1-planar graph; Discrete mathematics; Tree decomposition; Graph minor; Planar graph; Bounded function; Tree-depth; Graph; Chordal graph; Line graph; Voltage graph","routes":{"ca_aff":true,"ca_fund":false,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006912344,0.000391841,0.0006754061,0.0000970192,0.0002084666,0.00009563945,0.0007074067,0.0007149311,0.00002039313],"category_scores_gemma":[0.00002720025,0.0003530218,0.0004966337,0.00003842479,0.0005539403,0.00006567768,0.0004348689,0.0004181645,0.000008214742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005304085,"about_ca_system_score_gemma":0.0001693505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.86547e-7,"about_ca_topic_score_gemma":8.767021e-7,"domain_scores_codex":[0.9980317,0.000005820333,0.0006246386,0.0005250121,0.0004563139,0.0003565318],"domain_scores_gemma":[0.9981664,0.0003509865,0.0006071766,0.000610484,0.0001368068,0.0001281122],"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.00005359421,0.00003283853,5.086653e-8,0.0003567858,0.0002118205,2.325625e-7,0.002573905,7.616014e-7,0.001751259,0.9479612,0.008502777,0.03855474],"study_design_scores_gemma":[0.002421103,0.0003345275,4.652561e-8,0.0002559976,0.0001373215,0.000007215175,0.0002661971,0.001591782,0.01357824,0.9490414,0.03174842,0.000617783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.000952962,0.00008647997,0.2804193,0.00008317584,0.0003864163,0.004519348,0.0002205793,0.0002422592,0.7130895],"genre_scores_gemma":[0.004189737,0.00003333633,0.5805577,0.0001299546,0.002411915,0.0005244988,0.00008120835,0.0002461298,0.4118255],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.301264,"threshold_uncertainty_score":0.9998922,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07880150073156854,"score_gpt":0.278216667261791,"score_spread":0.1994151665302224,"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."}}