{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008408068,0.001012227,0.001061623,0.0008007552,0.000941729,0.002467774,0.002080922,0.0008004298,0.009244382],"category_scores_gemma":[0.007157731,0.0005585619,0.001467851,0.001425045,0.001301456,0.005750282,0.002097423,0.003473091,0.002458663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002696862,"about_ca_system_score_gemma":0.001421588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00223462,"about_ca_topic_score_gemma":0.003394199,"domain_scores_codex":[0.9990813,0.0001092332,0.0000301379,0.0003368006,0.0002973256,0.0001453096],"domain_scores_gemma":[0.9957154,0.002103149,0.0002663902,0.001411838,0.0002764786,0.0002268013],"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.001376959,0.0003464652,0.004473846,0.0009573536,0.00009823899,0.0003101731,0.0008292872,0.08025987,0.04021439,0.5508986,0.04148738,0.2787475],"study_design_scores_gemma":[0.0001257505,0.0003041838,0.00214388,0.0001170428,0.000110867,0.0007986731,0.0001661861,0.3579848,0.01359176,0.5793498,0.0452357,0.00007127523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1301738,0.002247057,0.8220026,0.002530864,0.0003828024,0.0001429258,0.001439505,0.004205391,0.03687504],"genre_scores_gemma":[0.6523529,0.001546329,0.3209304,0.001025949,0.0003075028,0.0002085706,0.002387672,0.001632418,0.01960835],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009244382,"threshold_uncertainty_score":0.03092551,"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."}}