{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000464782,0.0004037994,0.0005167794,0.00108139,0.001226272,0.001848728,0.001535545,0.0006246275,0.005024367],"category_scores_gemma":[0.002793542,0.0003599746,0.0006859043,0.0009295842,0.001367304,0.002574189,0.001342396,0.001022884,0.0002695449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002367073,"about_ca_system_score_gemma":0.000574066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003347571,"about_ca_topic_score_gemma":0.004354188,"domain_scores_codex":[0.9994393,0.00005608442,0.0000213801,0.000215855,0.0001201723,0.0001472058],"domain_scores_gemma":[0.9968007,0.00135973,0.0004101422,0.0005870641,0.0003508303,0.0004915069],"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.001739862,0.0003115161,0.01384246,0.000447839,0.0001285132,0.0003066207,0.001226827,0.1035236,0.1427809,0.6609659,0.007045217,0.0676807],"study_design_scores_gemma":[0.0001643167,0.0003273448,0.01198308,0.00008474414,0.0001035522,0.000734388,0.0005000121,0.3550882,0.04553106,0.570422,0.01497568,0.0000856843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8698038,0.0002722229,0.118117,0.0003166749,0.00003268249,0.00007175623,0.0005820687,0.0003421232,0.01046163],"genre_scores_gemma":[0.9665346,0.0001030668,0.02975634,0.00007982122,0.00003485312,0.00004928846,0.000453289,0.0001245679,0.002864268],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005024367,"threshold_uncertainty_score":0.01717442,"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."}}