{"id":"W2791423452","doi":"","title":"On the Linear 2-Arboricity of Planar Graphs without Intersecting 3-Cycles or Intersecting 4-Cycles.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Mathematics; Planar; Planar graph; Combinatorics; Graph; Computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003481655,0.0004548182,0.000398405,0.001247084,0.0007892381,0.001421021,0.0008377834,0.0008838127,0.01112884],"category_scores_gemma":[0.002969507,0.0004051769,0.0004933014,0.001386474,0.001671436,0.003135554,0.001316024,0.001534532,0.001693164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006212205,"about_ca_system_score_gemma":0.0003196397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001530276,"about_ca_topic_score_gemma":0.002217103,"domain_scores_codex":[0.9996845,0.00008691588,0.00001886582,0.0000660848,0.00006586823,0.00007779581],"domain_scores_gemma":[0.9978216,0.001384914,0.0003458892,0.0001386046,0.0001581182,0.0001509876],"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.0004473855,0.0001459351,0.004180755,0.0004962938,0.00006157289,0.0008285498,0.00083145,0.01721714,0.006993647,0.901568,0.01635878,0.0508705],"study_design_scores_gemma":[0.00004800349,0.00008135464,0.001786048,0.00007280699,0.00003525911,0.0004356398,0.0003485733,0.02063283,0.001568762,0.9677942,0.007170322,0.00002628098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.679019,0.002983135,0.07065579,0.003426046,0.0003813821,0.0001056901,0.001462636,0.0003596485,0.2416065],"genre_scores_gemma":[0.9592752,0.002509016,0.01448902,0.0007690616,0.0005050309,0.00008305302,0.001467306,0.0001552363,0.02074695],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01112884,"threshold_uncertainty_score":0.03722972,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03236417449053471,"score_gpt":0.3100225160815461,"score_spread":0.2776583415910114,"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."}}