{"id":"W4313450058","doi":"10.1016/j.ejc.2007.04.014","title":"An upper bound for the chromatic number of line graphs","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Chromatic scale; Upper and lower bounds; Computer science; Line (geometry); Combinatorics; Mathematics; Geometry","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.002393023,0.002683148,0.002017209,0.005993534,0.002812572,0.006822478,0.005609334,0.003145878,0.02364485],"category_scores_gemma":[0.01418124,0.001383631,0.001642151,0.00481186,0.003636266,0.009788108,0.004656042,0.006489031,0.004667105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005264821,"about_ca_system_score_gemma":0.001493892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002847346,"about_ca_topic_score_gemma":0.005475262,"domain_scores_codex":[0.9968863,0.0005361439,0.0001055433,0.0008501125,0.00086459,0.0007573694],"domain_scores_gemma":[0.9802182,0.0137991,0.0007483183,0.002569568,0.001197119,0.001467708],"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.001715061,0.0005804286,0.005121856,0.001505958,0.0002838632,0.0005042057,0.0008530975,0.1120754,0.04633316,0.641627,0.06243709,0.1269628],"study_design_scores_gemma":[0.00014356,0.0002477115,0.00459874,0.0003837834,0.0003264267,0.0006760862,0.0002455394,0.2867728,0.01599395,0.6370895,0.05331441,0.0002074924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1871394,0.01381477,0.5354586,0.01163566,0.001801748,0.000322637,0.004477357,0.005157271,0.2401925],"genre_scores_gemma":[0.7499546,0.00739474,0.1838598,0.002510069,0.002406986,0.0007051977,0.003727604,0.001795675,0.04764535],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02364485,"threshold_uncertainty_score":0.07909983,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02439923940933715,"score_gpt":0.3239694786796888,"score_spread":0.2995702392703516,"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."}}