{"id":"W2046684958","doi":"10.1137/100803870","title":"Gallai's Theorem for List Coloring of Digraphs","year":2011,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Complete coloring; Fractional coloring; Greedy coloring; Vertex (graph theory); List coloring; Discrete mathematics; Generalization; Brooks' theorem; Graph; Graph coloring; Graph power; Line graph","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.001276674,0.0001804245,0.000317686,0.0002622164,0.0001920681,0.00009853444,0.001378006,0.00005588729,0.00004403662],"category_scores_gemma":[0.0003258035,0.0001320973,0.0002576289,0.0003569374,0.0001648459,0.0003739132,0.0001685479,0.0002842776,0.00001013448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003300013,"about_ca_system_score_gemma":0.00005239067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.562782e-7,"about_ca_topic_score_gemma":0.000001120802,"domain_scores_codex":[0.9983001,0.00007719337,0.0005241359,0.0002043821,0.0004856908,0.0004084368],"domain_scores_gemma":[0.9980901,0.000488748,0.0004148716,0.00059363,0.000231192,0.0001814658],"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.00005765406,0.0001338458,0.00008216513,0.0000945796,0.00005196318,0.00001430689,0.002575322,0.00002099097,0.0008364839,0.994263,0.00007891993,0.001790769],"study_design_scores_gemma":[0.0004800252,0.0007111222,0.0001035645,0.0002128594,0.00001350597,0.00009308402,0.0003955449,0.005017353,0.01777364,0.9746616,0.0003505776,0.0001871136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03192917,0.00009425406,0.9482208,0.0001202179,0.0002344159,0.0003547909,0.000008319016,0.00005662066,0.01898141],"genre_scores_gemma":[0.7408592,0.00005211689,0.2586933,0.00004016235,0.00005020345,0.0000181242,4.355996e-7,0.00002797741,0.0002584789],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.70893,"threshold_uncertainty_score":0.5386772,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05820909347208875,"score_gpt":0.311648151051908,"score_spread":0.2534390575798193,"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."}}