{"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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001057746,0.0003223485,0.000348099,0.000739829,0.0003339523,0.001203962,0.001368923,0.00008764321,0.0000464373],"category_scores_gemma":[0.0001371409,0.0002141045,0.0002212891,0.001677988,0.000108831,0.0009463624,0.0002163419,0.001020723,0.00007890073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000898286,"about_ca_system_score_gemma":0.0001702453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001822671,"about_ca_topic_score_gemma":0.000006818377,"domain_scores_codex":[0.9973029,0.0001128595,0.0004838789,0.0004245653,0.001019386,0.0006564088],"domain_scores_gemma":[0.9981598,0.0004616264,0.0001698023,0.0007278315,0.000161023,0.0003199311],"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.00004632389,0.0001003387,0.00005556541,0.0002139852,0.0001976718,0.0007933986,0.002474645,0.00009362846,0.002321393,0.9864622,0.0002505246,0.006990297],"study_design_scores_gemma":[0.0006864589,0.001294868,0.0001120956,0.001404101,0.00003985769,0.001622378,0.0005921998,0.02416694,0.003537588,0.964396,0.001546754,0.0006007472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3706681,0.0007539901,0.6120807,0.002106476,0.0007803642,0.0006834631,0.000008065564,0.0006567642,0.01226209],"genre_scores_gemma":[0.9257386,0.0001033048,0.07331335,0.00009720797,0.00009963199,0.00003262323,0.000001053707,0.00007084385,0.0005433503],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5550705,"threshold_uncertainty_score":0.9998329,"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."}}