{"id":"W4289222390","doi":"10.1016/j.jctb.2022.06.002","title":"Bounding χ by a fraction of Δ for graphs without large cliques","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Degree (music); Upper and lower bounds; Conjecture; Discrete mathematics; Vertex (graph theory); Brooks' theorem; Bounding overwatch; Fractional coloring; Graph; Clique; Chromatic scale; Graph coloring; Greedy coloring; Clique number; Chordal graph; Graph power; Line graph; 1-planar graph; Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.004612539,0.0001280129,0.0003860657,0.000294963,0.0004501516,0.00007346674,0.001055307,0.00004418159,0.0000456978],"category_scores_gemma":[0.0004255535,0.0001202686,0.0002278637,0.0004940635,0.0001163472,0.001281598,0.0002983541,0.0004340038,2.672874e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001194026,"about_ca_system_score_gemma":0.0001570685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001046451,"about_ca_topic_score_gemma":1.713151e-7,"domain_scores_codex":[0.9976502,0.0006922874,0.0005317228,0.0001656344,0.0006603411,0.0002998318],"domain_scores_gemma":[0.9977838,0.0006233003,0.0007725505,0.0003032022,0.0004209372,0.00009620259],"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.001952532,0.0002083193,0.0002998413,0.00002038604,0.00006847309,0.000005582226,0.0005377741,0.00001597809,0.007204484,0.9877936,0.0008856014,0.001007477],"study_design_scores_gemma":[0.001430303,0.002048546,0.00001732493,0.0000157162,0.00001255753,0.00006097144,0.000801851,0.00006767091,0.01632513,0.9358128,0.04329432,0.0001128225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3067412,0.0008897916,0.6830883,0.0005253882,0.007622577,0.0004802407,0.00004734571,0.00006435937,0.0005408143],"genre_scores_gemma":[0.9943324,0.00004660877,0.005250904,0.00005498439,0.0001417251,0.00002445281,0.000001992648,0.00001843551,0.0001285274],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6875912,"threshold_uncertainty_score":0.4904413,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01265890916885139,"score_gpt":0.3040081224991669,"score_spread":0.2913492133303155,"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."}}