{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00154318,0.0002474395,0.0003636756,0.0003727174,0.001170323,0.000342207,0.001785521,0.00003473675,0.00006947576],"category_scores_gemma":[0.0001386142,0.0001894766,0.0002043526,0.0007883692,0.000110413,0.0004625977,0.0004853082,0.0008452961,0.000006629163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001804405,"about_ca_system_score_gemma":0.0001344455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001934614,"about_ca_topic_score_gemma":0.000005019834,"domain_scores_codex":[0.997339,0.0001723266,0.0004497638,0.0003457381,0.001068499,0.0006246634],"domain_scores_gemma":[0.997987,0.0005142083,0.0003943899,0.0006819983,0.0001653293,0.0002570628],"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.0002539041,0.0003212398,0.000174912,0.0001164884,0.0001434176,0.0001357313,0.002906248,0.0006545068,0.001311262,0.9916883,0.0003129489,0.001981008],"study_design_scores_gemma":[0.002070336,0.002949936,0.0002002289,0.0001306269,0.000027321,0.0008910429,0.001325648,0.03567136,0.00180402,0.9511293,0.003262358,0.0005377845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2776859,0.00005179115,0.7166793,0.001246664,0.0002844928,0.001078065,0.00002958017,0.0001512406,0.002792985],"genre_scores_gemma":[0.8253295,0.000006799481,0.1737555,0.0002119035,0.00008522441,0.0002498886,0.000003437653,0.00005109076,0.0003066671],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5476435,"threshold_uncertainty_score":0.9001296,"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."}}