{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001861451,0.0001869478,0.0002655566,0.00007432451,0.0005842313,0.0001292738,0.002224397,0.00006593098,0.00001376001],"category_scores_gemma":[0.0007600894,0.000146254,0.000154106,0.001707072,0.0004279413,0.0002878745,0.0008992896,0.0003568348,0.00005141832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001160024,"about_ca_system_score_gemma":0.00003428831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004915273,"about_ca_topic_score_gemma":6.954239e-7,"domain_scores_codex":[0.9973875,0.0003772213,0.0005437505,0.0004720356,0.0006426628,0.0005768278],"domain_scores_gemma":[0.9962804,0.001506481,0.0002437132,0.001485303,0.0003563167,0.0001277847],"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.000002410985,0.0002039045,0.00867572,0.0000712141,0.00002094336,0.000003174162,0.0006975774,0.0001635131,0.00005345363,0.9758581,0.0001614748,0.01408853],"study_design_scores_gemma":[0.0002939012,0.00006507032,0.001509243,0.00003016625,0.000003012664,0.00001653018,0.00003075236,0.07472271,0.0004061783,0.9224324,0.0003233826,0.0001666908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6868468,0.0008556366,0.2964505,0.001117547,0.001274269,0.0009092809,0.000001136854,0.0004526078,0.01209228],"genre_scores_gemma":[0.9890395,0.00002225125,0.01078403,0.00002607029,0.00001415419,0.000007484587,2.69407e-7,0.0000127588,0.00009350313],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3021927,"threshold_uncertainty_score":0.5964066,"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."}}