{"id":"W2767932262","doi":"","title":"Every 1-planar graph without 4-cycles or adjacent 5-vertices is 5-colorable.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Wheel graph; Planar graph; Planar; Graph; Graph power; Computer science; Line graph; Computer graphics (images)","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.0002430467,0.000931347,0.0007025004,0.0007876934,0.001641125,0.002306004,0.001350412,0.0012616,0.02612909],"category_scores_gemma":[0.001244174,0.000673713,0.001036383,0.00115748,0.001594384,0.002227534,0.001492446,0.001689255,0.003716255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008297446,"about_ca_system_score_gemma":0.0007090272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002021052,"about_ca_topic_score_gemma":0.00328273,"domain_scores_codex":[0.9995263,0.00004831152,0.00001901813,0.0001534661,0.00009163834,0.0001612879],"domain_scores_gemma":[0.9987576,0.0003678932,0.0003071628,0.0002019547,0.0001781685,0.0001872806],"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.001550243,0.000549284,0.005622401,0.002071305,0.0004036416,0.002224253,0.0008846921,0.01404582,0.06261277,0.6724972,0.0589733,0.1785651],"study_design_scores_gemma":[0.0002567156,0.0003415612,0.01006621,0.0002200587,0.00038283,0.002433653,0.0006902663,0.008663855,0.03445115,0.827314,0.1150445,0.0001352135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6016638,0.001134943,0.09906428,0.003737062,0.0007716918,0.0002566199,0.006964763,0.002256602,0.2841503],"genre_scores_gemma":[0.8966762,0.001149661,0.04051598,0.00110417,0.0001295083,0.0001779068,0.007143129,0.0003796144,0.05272374],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02612909,"threshold_uncertainty_score":0.08741051,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0348486864049752,"score_gpt":0.3167078772517278,"score_spread":0.2818591908467526,"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."}}