{"id":"W3109000230","doi":"10.1007/s10114-020-9488-9","title":"An Improved Upper Bound on the Linear 2-arboricity of 1-planar Graphs","year":2020,"lang":"en","type":"article","venue":"Acta Mathematica Sinica English Series","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Arboricity; Combinatorics; Planar graph; Mathematics; Graph; Disjoint sets; Planar; Upper and lower bounds; Computer science; Mathematical analysis","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.002540161,0.003571273,0.002919913,0.005439443,0.002089073,0.005865091,0.006867677,0.002995861,0.0301644],"category_scores_gemma":[0.01539654,0.001824078,0.002893297,0.006057757,0.003347764,0.01228544,0.00722282,0.01020112,0.006890614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003485564,"about_ca_system_score_gemma":0.001300175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002332649,"about_ca_topic_score_gemma":0.003804896,"domain_scores_codex":[0.9967535,0.0006209523,0.0001224294,0.0006831089,0.001044378,0.0007756429],"domain_scores_gemma":[0.9805411,0.0150512,0.0005475123,0.001776215,0.0009966007,0.001087418],"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.002259598,0.0009716986,0.006057271,0.003234066,0.0004450513,0.001355908,0.001456579,0.1218384,0.04224174,0.6155327,0.06903616,0.1355708],"study_design_scores_gemma":[0.0001733573,0.0003187337,0.003574342,0.0003335982,0.0004191303,0.0007348225,0.0002540608,0.2209536,0.01162102,0.7332269,0.02821351,0.0001768106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2175481,0.01596733,0.4363042,0.01301133,0.001929235,0.0004083708,0.008226718,0.0051166,0.3014882],"genre_scores_gemma":[0.7808295,0.01146473,0.1417598,0.00417645,0.003694865,0.0009190421,0.007453384,0.002285477,0.04741681],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0301644,"threshold_uncertainty_score":0.1009099,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02933394371888223,"score_gpt":0.2828621703934873,"score_spread":0.2535282266746051,"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."}}