{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003179672,0.0004055897,0.0006441403,0.00120685,0.0004811156,0.0003933376,0.003800139,0.0005023417,0.0001310587],"category_scores_gemma":[0.005658854,0.0004174776,0.0008908118,0.001858753,0.0002303341,0.0002690478,0.002397157,0.0006783496,0.0007720695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001702444,"about_ca_system_score_gemma":0.0002982426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003515701,"about_ca_topic_score_gemma":0.0004784011,"domain_scores_codex":[0.9961501,0.0002033674,0.0005779325,0.001907714,0.0004214968,0.0007394065],"domain_scores_gemma":[0.9929485,0.002663242,0.0005183592,0.002805406,0.0007352128,0.000329228],"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.0002171163,0.0002118601,0.01053653,0.0000760066,0.0005789342,0.0002019032,0.0004681451,0.4522603,0.0001062086,0.4800344,0.05465548,0.0006531221],"study_design_scores_gemma":[0.0007821331,0.00005587397,0.002164693,0.00006760975,0.0002603553,0.000002043025,0.0003087544,0.1297002,0.0000524662,0.85028,0.01579226,0.0005335475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7597591,0.0002070667,0.2222566,0.001628307,0.00724528,0.001224495,0.0006810997,0.001264087,0.005733914],"genre_scores_gemma":[0.965297,0.0001166581,0.002834016,0.0001192957,0.0002378433,0.000009098537,0.00005588033,0.00005645711,0.03127379],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3702456,"threshold_uncertainty_score":0.9998277,"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."}}