{"id":"W3003210829","doi":"10.1016/j.amc.2020.125032","title":"On the vertex partition of planar graphs into forests with bounded degree","year":2020,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Frequency partition of a graph; Combinatorics; Partition (number theory); Mathematics; Bounded function; Planar graph; Vertex (graph theory); Discrete mathematics; Degree (music); Graph; Graph power; Line graph; Physics; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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.0001563962,0.00008566846,0.0001151695,0.00004190545,0.0001113419,0.00005533692,0.0002183797,0.00002156609,0.000001594245],"category_scores_gemma":[0.00002077774,0.00005487533,0.00001734309,0.0002896931,0.00008911251,0.00007414172,0.00004832832,0.00007749296,0.000006929431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006381559,"about_ca_system_score_gemma":0.00001636575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001414064,"about_ca_topic_score_gemma":0.000005598198,"domain_scores_codex":[0.99931,0.00001465539,0.0001440323,0.0001685063,0.0002576905,0.0001051756],"domain_scores_gemma":[0.9992806,0.0003636304,0.00009850503,0.0001608401,0.00004524912,0.00005119112],"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.00002416782,0.00003139361,0.000009168692,0.00005652524,0.00001224084,9.599971e-7,0.001787244,0.0004545919,0.0005063911,0.9871034,0.00006118405,0.009952749],"study_design_scores_gemma":[0.0002214447,0.0001777607,0.0001619504,0.00002066644,0.000004236872,0.000001736062,0.0001315307,0.1384504,0.001296424,0.8594668,0.0000068465,0.00006019972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1692481,0.00000975789,0.8289495,0.0006618922,0.000007214747,0.0002419009,6.275715e-7,0.00003538924,0.0008456156],"genre_scores_gemma":[0.8887446,0.000003128134,0.1110281,0.0001857452,0.000003631058,0.00002488337,0.000002617659,0.000006396709,9.390445e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7194965,"threshold_uncertainty_score":0.2237751,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0406424360618284,"score_gpt":0.2698146439078508,"score_spread":0.2291722078460224,"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."}}