{"id":"W4388650674","doi":"10.48550/arxiv.2311.05713","title":"List-$k$-Coloring $H$-free graphs for all $k>4$","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Government of Ontario; National Science Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Induced path; Path (computing); Induced subgraph; Integer (computer science); Complete coloring; Discrete mathematics; Longest path problem; Chordal graph; Computer science; Graph power; Line graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001446681,0.001888777,0.001592595,0.001116248,0.002222614,0.004059118,0.003412122,0.001734475,0.0198338],"category_scores_gemma":[0.008840129,0.000830244,0.00197533,0.002766109,0.00176083,0.007030619,0.00220404,0.003646039,0.003244197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003518348,"about_ca_system_score_gemma":0.005744802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008692644,"about_ca_topic_score_gemma":0.01438626,"domain_scores_codex":[0.9978714,0.000260591,0.0001108202,0.0007771287,0.0003042675,0.0006756975],"domain_scores_gemma":[0.9885449,0.006350188,0.001241173,0.002146233,0.0008636827,0.0008538664],"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.003067223,0.001430167,0.009198866,0.003463144,0.0005462925,0.0006781932,0.0009772551,0.2871372,0.02771351,0.3171515,0.1633745,0.1852621],"study_design_scores_gemma":[0.0005492563,0.0002365061,0.003059929,0.0001272058,0.0002710999,0.000858821,0.0005125117,0.2963714,0.01392946,0.6514124,0.03255936,0.0001120833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3504454,0.002063035,0.5026199,0.01683749,0.0008008266,0.001109674,0.03170134,0.006833378,0.08758894],"genre_scores_gemma":[0.6125851,0.00172084,0.3228223,0.00289278,0.0005560524,0.0008682082,0.0242716,0.001648019,0.03263522],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0198338,"threshold_uncertainty_score":0.0663507,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.4594780831156832,"score_gpt":0.311931187120129,"score_spread":0.1475468959955542,"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."}}