{"id":"W1930792227","doi":"10.1002/jgt.21711","title":"Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree","year":2013,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Arboricity; Multigraph; Mathematics; Combinatorics; Degree (music); Conjecture; Dense graph; Planar graph; Bounded function; Graph; Discrete mathematics; Tree decomposition; Pathwidth; 1-planar graph; Chordal graph; Line 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":[],"consensus_categories":[],"category_scores_codex":[0.001460814,0.0002071312,0.0003905081,0.001108016,0.0001687347,0.0001283248,0.0009195047,0.00007489444,0.00002024891],"category_scores_gemma":[0.00007785499,0.0001468662,0.0001912626,0.001029704,0.0006911968,0.001506858,0.0001594976,0.000364275,0.000003572116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002323774,"about_ca_system_score_gemma":0.00008269234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001719152,"about_ca_topic_score_gemma":0.00003282943,"domain_scores_codex":[0.9978836,0.0003953533,0.0005341579,0.0002477117,0.0005967492,0.0003424166],"domain_scores_gemma":[0.9975763,0.0004732669,0.000578594,0.0004859851,0.0006185013,0.0002673794],"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.0005744467,0.0002130987,0.01441865,0.00007074006,0.0002516951,0.00007566465,0.001225904,0.00006909024,0.0103545,0.9355187,0.0001357384,0.0370918],"study_design_scores_gemma":[0.0009839339,0.001047742,0.03125157,0.0001411356,0.00002523757,0.000450396,0.0001680615,0.0001462365,0.004793189,0.9608077,0.00001901334,0.0001658157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7111957,0.0008693216,0.2871786,0.0001939286,0.00008747351,0.0001962823,7.942747e-7,0.00002002101,0.0002578807],"genre_scores_gemma":[0.9415484,0.0001520233,0.05815819,0.0000764834,0.00002066077,0.000009624964,4.122523e-7,0.0000168937,0.00001727623],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2303527,"threshold_uncertainty_score":0.5989029,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01759353469542376,"score_gpt":0.2805384940187399,"score_spread":0.2629449593233162,"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."}}