{"id":"W4393008377","doi":"10.1137/22m1515768","title":"List-3-Coloring Ordered Graphs with a Forbidden Induced Subgraph","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Combinatorics; Mathematics; Edge coloring; List coloring; Complete coloring; Discrete mathematics; Brooks' theorem; Graph coloring; Greedy coloring; Chordal graph; Graph; 1-planar graph; Line graph","routes":{"ca_aff":true,"ca_fund":true,"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.0006302416,0.0008007723,0.0006258004,0.0006574822,0.0010906,0.001961167,0.00135656,0.000948371,0.008468098],"category_scores_gemma":[0.00288021,0.0004446083,0.001279744,0.001461817,0.001048806,0.003014495,0.001174189,0.001478115,0.001147453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002260142,"about_ca_system_score_gemma":0.002451218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006765101,"about_ca_topic_score_gemma":0.00908157,"domain_scores_codex":[0.9987914,0.0002660526,0.00008072406,0.0003105286,0.0002871061,0.0002642401],"domain_scores_gemma":[0.9958034,0.002234021,0.0004147014,0.0007041105,0.0005205161,0.0003233207],"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.001803326,0.001249166,0.006568006,0.001638483,0.0002220291,0.001884809,0.000926164,0.3361815,0.03339955,0.40031,0.04812173,0.1676953],"study_design_scores_gemma":[0.0002338448,0.0002773959,0.001528541,0.00009034813,0.00009790096,0.000674104,0.0004063327,0.4318804,0.02556385,0.5179769,0.02118885,0.00008150924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2782475,0.0004267011,0.675064,0.002503352,0.0003252002,0.0006752748,0.006986915,0.004160967,0.03161021],"genre_scores_gemma":[0.6621354,0.0002924441,0.3112246,0.0009274592,0.00009888563,0.0003059948,0.009233099,0.0004709586,0.01531124],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008468098,"threshold_uncertainty_score":0.0283286,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03265438846763929,"score_gpt":0.3106433100962616,"score_spread":0.2779889216286223,"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."}}