{"id":"W1149759637","doi":"10.1016/j.laa.2015.08.007","title":"Proof of a conjectured lower bound on the chromatic number of a graph","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Graph; Friendship graph; Upper and lower bounds; Windmill graph; Discrete mathematics; Voltage graph; 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":[],"consensus_categories":[],"category_scores_codex":[0.0001993291,0.00007346059,0.0001193923,0.00004010518,0.00006433973,0.00001893647,0.0002587623,0.00003590725,0.000008273788],"category_scores_gemma":[0.00003935554,0.00004636744,0.00003629976,0.0003962386,0.00008432843,0.00005256644,0.00006145526,0.00006224553,0.00001774999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002657164,"about_ca_system_score_gemma":0.00004640243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000915872,"about_ca_topic_score_gemma":0.000001283343,"domain_scores_codex":[0.999351,0.00002781632,0.0002016179,0.0001618424,0.0001670593,0.00009071094],"domain_scores_gemma":[0.9991614,0.0001011562,0.0001116034,0.0003976056,0.0001654416,0.00006283936],"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.000004564407,0.0001667634,0.00006599048,0.00002789934,0.00002223661,1.636089e-7,0.000618962,0.00004283242,0.001946752,0.9953126,0.0009218656,0.0008694227],"study_design_scores_gemma":[0.0009513558,0.0003335465,0.0003678707,0.000104235,0.00004633013,0.00002359394,0.0001069691,0.0360684,0.05899505,0.8965885,0.006139812,0.0002743404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9455144,0.0007276965,0.04606748,0.003058919,0.00009075019,0.000981348,0.00001389727,0.00008034921,0.00346521],"genre_scores_gemma":[0.9962599,0.000007918096,0.003298081,0.0002485346,0.00000672776,0.00007524267,0.000001920942,0.000004762202,0.00009691394],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09872406,"threshold_uncertainty_score":0.1890809,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02254437193042452,"score_gpt":0.2594626552656268,"score_spread":0.2369182833352023,"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."}}