{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005854929,0.000115923,0.000204007,0.0001664221,0.0001623917,0.00008526522,0.00192226,0.00001747136,0.000008583715],"category_scores_gemma":[0.0002550567,0.00007757725,0.0001673766,0.0006651009,0.0001430704,0.0004731733,0.0001205774,0.0002906506,0.000009173813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002942578,"about_ca_system_score_gemma":0.00005781363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.168025e-7,"about_ca_topic_score_gemma":2.014684e-7,"domain_scores_codex":[0.9981325,0.0003232863,0.0005896639,0.0001268935,0.0005352159,0.0002924447],"domain_scores_gemma":[0.9973873,0.0007703031,0.000466972,0.000566821,0.0006474702,0.0001611707],"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.000105975,0.0003860766,0.002411616,0.00004250315,0.00008602972,0.000132824,0.0009643827,0.0001483045,0.001771481,0.9703104,0.0005450427,0.02309536],"study_design_scores_gemma":[0.003414831,0.003045107,0.0241007,0.000136755,0.00005555598,0.0006767323,0.0003353402,0.004349721,0.008318078,0.9405162,0.01466816,0.000382864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2367862,0.0003886739,0.7603925,0.0002039534,0.0006778142,0.0001261287,9.574021e-7,0.00001654553,0.001407134],"genre_scores_gemma":[0.9856693,0.00005317303,0.01399009,0.00007583165,0.00008359136,4.315828e-7,2.441778e-7,0.00002335181,0.0001039839],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7488831,"threshold_uncertainty_score":0.3572069,"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."}}