{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002402724,0.0002320598,0.0002812269,0.0009301929,0.0003602942,0.0006474241,0.0002306855,0.0002859653,0.001658901],"category_scores_gemma":[0.001110082,0.0002073261,0.0002883122,0.0005410353,0.0005540306,0.001065154,0.0006636534,0.0004107656,0.0001279895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004094722,"about_ca_system_score_gemma":0.0002010559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009814337,"about_ca_topic_score_gemma":0.001729795,"domain_scores_codex":[0.9997998,0.00004002733,0.00001086578,0.00004850311,0.00004944512,0.0000513436],"domain_scores_gemma":[0.999121,0.0003752317,0.0001957038,0.00009209574,0.00009341792,0.0001226006],"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.0007512859,0.0001977617,0.01559715,0.0003888416,0.0001066755,0.002031339,0.001054276,0.1620028,0.1081572,0.6284223,0.004891506,0.07639893],"study_design_scores_gemma":[0.00005205451,0.0001016724,0.006173496,0.00007081,0.00005461372,0.001340676,0.0005549855,0.4050336,0.01270829,0.5674939,0.006393671,0.0000222984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8027256,0.0006399363,0.1881451,0.0003877584,0.00002433275,0.00002926386,0.0001805071,0.000142741,0.007724864],"genre_scores_gemma":[0.9754847,0.0001549159,0.02286927,0.00007007435,0.0000195431,0.00001347305,0.0001702449,0.00001481156,0.001202848],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001658901,"threshold_uncertainty_score":0.00554955,"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."}}