{"id":"W2403587392","doi":"","title":"On (k, t)-choosability of graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; List coloring; Mathematics; Vertex (graph theory); Graph; Fractional coloring; Graph coloring; Complete coloring; Planar graph; Brooks' theorem; Edge coloring; Discrete mathematics; Chordal graph; 1-planar graph; Graph power; Line graph","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005173535,0.0001099895,0.0001650308,0.0001435289,0.00006200177,0.00001204459,0.001189046,0.0000501388,0.00005058707],"category_scores_gemma":[0.0001887084,0.0001007413,0.00008649413,0.0006394673,0.0001777355,0.0002747113,0.0002436032,0.0001791414,0.00006524329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002423825,"about_ca_system_score_gemma":0.00003548198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001805512,"about_ca_topic_score_gemma":9.634687e-7,"domain_scores_codex":[0.9987197,0.0001399916,0.0002014879,0.000333903,0.0003354404,0.0002694941],"domain_scores_gemma":[0.9983534,0.0002299754,0.00007533525,0.001104361,0.0001294619,0.0001074856],"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.00002566266,0.0002361749,0.003845695,0.000007961869,0.00000974669,0.00000497848,0.0003303253,9.214508e-7,0.0002877165,0.992992,0.0001197649,0.002139],"study_design_scores_gemma":[0.0003246368,0.0003033662,0.01317899,0.000009234876,0.000001345684,0.000001384521,0.000009091038,0.00008975485,0.02141545,0.9645275,0.0000430273,0.00009620495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9729422,0.00004040348,0.002593127,0.00004894694,0.0008297031,0.0001914772,0.000001594331,0.0001276645,0.02322486],"genre_scores_gemma":[0.9959129,0.00000461735,0.003967715,0.00004320264,7.802105e-7,0.00001246086,3.433731e-7,0.000007797692,0.00005015566],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02846454,"threshold_uncertainty_score":0.4108109,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03021171901577695,"score_gpt":0.2773091559090248,"score_spread":0.2470974368932478,"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."}}