{"id":"W4281661106","doi":"10.1137/1.9781611977554.ch116","title":"Sparse graphs with bounded induced cycle packing number have logarithmic treewidth","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Berlin Mathematics Research Center MATH+; Agence Nationale de la Recherche; Deutsche Forschungsgemeinschaft","keywords":"Treewidth; Combinatorics; Bipartite graph; Mathematics; Logarithm; Cograph; Independent set; Time complexity; Chordal graph; Indifference graph; Discrete mathematics; Maximal independent set; Disjoint sets; Pathwidth; 1-planar graph; Graph; Line graph","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.001000825,0.0006699264,0.0008630072,0.0001236778,0.0005879872,0.0003877849,0.0008822827,0.0009437252,0.0000102704],"category_scores_gemma":[0.00003661794,0.0005676397,0.000462082,0.0001037651,0.0004974744,0.0001025656,0.0005770732,0.001210855,0.00003072679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001208135,"about_ca_system_score_gemma":0.0003344541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004641232,"about_ca_topic_score_gemma":0.0000156667,"domain_scores_codex":[0.9968322,0.00001077684,0.000577013,0.0009289402,0.0009057279,0.0007453723],"domain_scores_gemma":[0.9975473,0.0006338254,0.000493221,0.0008626467,0.0002119646,0.0002509985],"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.00004394635,0.00002470224,5.73054e-7,0.000160511,0.0003824436,0.000006135601,0.001320014,0.000002682043,0.0001455108,0.9748842,0.000969042,0.02206025],"study_design_scores_gemma":[0.002212696,0.0001449644,1.776609e-7,0.0002964808,0.0001253161,0.00002013325,0.0003422757,0.0008422923,0.000758823,0.9887339,0.005797698,0.0007251868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.003185661,0.00002656614,0.09530932,0.0003282626,0.0006070749,0.008781871,0.0002822643,0.001399758,0.8900792],"genre_scores_gemma":[0.01849133,0.00009255069,0.3447486,0.0007211227,0.001831179,0.002275286,0.0001813351,0.001230763,0.6304278],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.2596514,"threshold_uncertainty_score":0.9996775,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09548717066097315,"score_gpt":0.2861821617268371,"score_spread":0.190694991065864,"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."}}