{"id":"W3198462604","doi":"10.1137/21m1443352","title":"Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Induced subgraph; Discrete mathematics; Complete coloring; Integer (computer science); Graph; Time complexity; Fractional coloring; List coloring; Graph power; Computer science; Line graph","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002646347,0.001572957,0.002184405,0.00104591,0.002317339,0.007437878,0.003502162,0.003037279,0.01392866],"category_scores_gemma":[0.01032465,0.0009128837,0.002926682,0.001561721,0.002252626,0.009947645,0.003341803,0.006368421,0.001931608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006433172,"about_ca_system_score_gemma":0.004758527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003626596,"about_ca_topic_score_gemma":0.0038818,"domain_scores_codex":[0.995463,0.001118356,0.0001836515,0.001141975,0.0008642757,0.001228757],"domain_scores_gemma":[0.9803054,0.01539794,0.0009733158,0.001748904,0.0006176493,0.0009567927],"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.003202509,0.001536062,0.005498138,0.002183278,0.0004928336,0.0006569734,0.001270541,0.1718951,0.014918,0.6102425,0.1103435,0.0777607],"study_design_scores_gemma":[0.0004489127,0.000156303,0.001526903,0.0001153246,0.0001574443,0.0003012363,0.0002635418,0.3810068,0.002768895,0.6051167,0.008060369,0.00007765842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5306817,0.004342934,0.3053466,0.04380347,0.0009258288,0.000727802,0.01545936,0.004618332,0.09409397],"genre_scores_gemma":[0.8688168,0.001945276,0.0972961,0.004924869,0.00122966,0.0008783579,0.009674263,0.0006937576,0.01454085],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01392866,"threshold_uncertainty_score":0.04667616,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0753537972018547,"score_gpt":0.3294979614260338,"score_spread":0.2541441642241791,"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."}}