{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00498712,0.004064693,0.003717791,0.005601916,0.003683686,0.009083054,0.00758142,0.00401161,0.04192469],"category_scores_gemma":[0.03704614,0.002508708,0.004323122,0.006800974,0.008641183,0.01280142,0.01149643,0.01905879,0.007384924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007217344,"about_ca_system_score_gemma":0.003935723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00565919,"about_ca_topic_score_gemma":0.006025252,"domain_scores_codex":[0.9940958,0.001153291,0.0002582181,0.001836361,0.001543593,0.00111277],"domain_scores_gemma":[0.9514182,0.03531683,0.001470058,0.005805412,0.003396671,0.002592976],"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.0008433893,0.0006923497,0.002844529,0.001632901,0.0002686803,0.0003769882,0.0009202722,0.02950027,0.008342488,0.8190538,0.09058618,0.04493823],"study_design_scores_gemma":[0.0001366351,0.00009409877,0.001314423,0.0002235544,0.0001110813,0.0002540153,0.0001814275,0.04816581,0.00237311,0.9282705,0.01875958,0.0001158704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08909248,0.005919317,0.6121877,0.05850383,0.005924784,0.0005426126,0.008952199,0.003861402,0.2150158],"genre_scores_gemma":[0.7064488,0.005057768,0.2196452,0.01662626,0.007666505,0.001641052,0.008799545,0.002010506,0.03210437],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04192469,"threshold_uncertainty_score":0.1402521,"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."}}