{"id":"W2018074536","doi":"10.1017/s0963548301004965","title":"The Chromatic Number of Graph Powers","year":2002,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Mathematics; Graph; Combinatorics; Chromatic scale; Friendship graph; Windmill graph; Discrete mathematics; Graph power; Line graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004861061,0.0003158085,0.0003098843,0.001647132,0.0009808906,0.002708719,0.000697508,0.0005272326,0.00904639],"category_scores_gemma":[0.00562758,0.0003388518,0.0002917873,0.001202462,0.002593412,0.003082193,0.00120862,0.0009248948,0.0007327907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001660893,"about_ca_system_score_gemma":0.0005893664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002192671,"about_ca_topic_score_gemma":0.002057155,"domain_scores_codex":[0.9994313,0.000105976,0.00002024767,0.0001538834,0.0001336074,0.0001549895],"domain_scores_gemma":[0.9965292,0.00211589,0.0003062259,0.0004435935,0.0002763544,0.0003288099],"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.0004297562,0.00003582489,0.004121155,0.0001277869,0.00002566885,0.0001906755,0.0004337804,0.03663541,0.0108218,0.9087687,0.005364261,0.03304524],"study_design_scores_gemma":[0.00005023255,0.00005762046,0.002657763,0.00004038354,0.00002727723,0.0003516175,0.0002027656,0.07475054,0.005377127,0.9057058,0.01073353,0.0000453066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8077604,0.00155431,0.06181247,0.001548059,0.0001788091,0.00005750417,0.0006724524,0.0003865221,0.1260296],"genre_scores_gemma":[0.9867092,0.0004599438,0.00507916,0.00006765596,0.00009753381,0.00003488278,0.0001643657,0.00007013771,0.007317262],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00904639,"threshold_uncertainty_score":0.03026313,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02818838614938516,"score_gpt":0.2838933543736482,"score_spread":0.255704968224263,"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."}}