{"id":"W3111722804","doi":"10.1017/s0963548322000165","title":"Clustered colouring of graph classes with bounded treedepth or pathwidth","year":2022,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Bounded function; Friendship graph; Graph; Discrete mathematics; Class (philosophy); Upper and lower bounds; Pathwidth; Integer (computer science); Graph power; Computer science; Line graph","routes":{"ca_aff":true,"ca_fund":false,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002202738,0.0002907924,0.0005077856,0.000329161,0.001003188,0.0001291381,0.002338827,0.00005565104,0.00001610716],"category_scores_gemma":[0.0002977652,0.0002543782,0.0001306287,0.003198244,0.0003087695,0.0003790027,0.002913772,0.0006873021,0.000001497186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00042932,"about_ca_system_score_gemma":0.0004927551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002309894,"about_ca_topic_score_gemma":0.00001781506,"domain_scores_codex":[0.9958736,0.00076385,0.0006261952,0.0008983186,0.001112816,0.0007252531],"domain_scores_gemma":[0.9966277,0.0009986145,0.0004246223,0.001370471,0.0004018513,0.0001767286],"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.0005061374,0.001647409,0.03999922,0.0004310505,0.0001068161,0.0001053336,0.002726477,0.0156269,0.0004429518,0.9269603,0.00006788844,0.0113795],"study_design_scores_gemma":[0.002884316,0.002690921,0.005304653,0.00006945715,0.00001636318,0.0001179276,0.0004884337,0.07462389,0.00198208,0.9107177,0.0004692416,0.0006350014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7549986,0.0001064438,0.2422355,0.0002092184,0.0004094214,0.0008857388,0.000005496263,0.0003509021,0.0007986342],"genre_scores_gemma":[0.9676515,0.000002770395,0.03212298,0.00005006773,0.00001447232,0.00004778319,0.00000355208,0.00002808753,0.00007875087],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2126529,"threshold_uncertainty_score":0.9999908,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03701321584223581,"score_gpt":0.2773013662615847,"score_spread":0.2402881504193489,"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."}}