{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001648754,0.001355627,0.001421027,0.003014504,0.003638614,0.004500574,0.002218113,0.002185196,0.01254666],"category_scores_gemma":[0.008651676,0.001041101,0.002863664,0.004094388,0.003390326,0.007580003,0.003671146,0.005364449,0.003407404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003758166,"about_ca_system_score_gemma":0.001614443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005006943,"about_ca_topic_score_gemma":0.004516492,"domain_scores_codex":[0.9985783,0.0002327339,0.00009187715,0.0004593976,0.000369292,0.0002683949],"domain_scores_gemma":[0.9959624,0.00231661,0.0002035952,0.00067785,0.0004727983,0.0003667168],"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.00005380747,0.00002484534,0.0002766109,0.0001760299,0.00002970259,0.0001382079,0.0003376176,0.004668648,0.001184906,0.9540148,0.01764134,0.02145358],"study_design_scores_gemma":[0.00003581617,0.00001985806,0.000201756,0.00004619027,0.00003440458,0.0002323303,0.00006050332,0.01379972,0.001133489,0.9506444,0.03376314,0.00002848179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0378347,0.004147639,0.7891356,0.007491629,0.001428246,0.000280343,0.002275729,0.002126825,0.1552794],"genre_scores_gemma":[0.5564198,0.008243797,0.3219968,0.008526322,0.00205316,0.001249195,0.003656503,0.001517333,0.09633708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01254666,"threshold_uncertainty_score":0.04197276,"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."}}