{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007564282,0.000250745,0.000407599,0.00008027099,0.000224123,0.0001754448,0.002429507,0.00009243453,0.00006593169],"category_scores_gemma":[0.002396354,0.0001686893,0.0001480745,0.0007997863,0.0004668361,0.001152228,0.0002640645,0.0004071369,0.00002018772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001434244,"about_ca_system_score_gemma":0.00008498267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002578215,"about_ca_topic_score_gemma":0.000001795779,"domain_scores_codex":[0.9977985,0.0002722273,0.0004811581,0.000511313,0.0005203236,0.0004164907],"domain_scores_gemma":[0.9964212,0.001242648,0.0002155422,0.00158994,0.0003078052,0.0002228981],"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.0001230395,0.0002409309,0.00004519131,0.0001092963,0.00006456082,0.000005840247,0.009851268,0.000005783375,0.01186338,0.9766336,0.0006733995,0.0003837122],"study_design_scores_gemma":[0.001070941,0.004129897,0.0005313469,0.0001700932,0.00005538996,0.00001472495,0.004858221,0.02532888,0.09557453,0.8542292,0.01298535,0.00105148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8923197,0.0001461816,0.05183543,0.03019371,0.0006703856,0.002302655,0.0001071818,0.00152819,0.02089653],"genre_scores_gemma":[0.9652855,0.00003593454,0.03364861,0.0008064141,0.0001021138,0.00003829885,0.000003239647,0.00003141978,0.00004841896],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1224045,"threshold_uncertainty_score":0.6878949,"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."}}