{"id":"W4245876577","doi":"10.1002/jgt.20300","title":"An improved bound for the strong chromatic number","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Vertex (graph theory); Graph; Fractional coloring; Existential quantification; Friendship graph; Degree (music); List coloring; Discrete mathematics; Class (philosophy); Upper and lower bounds; Graph power; Line graph; Computer science; Physics","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.001743059,0.0001043271,0.0001739368,0.00009859903,0.0003972822,0.00009276498,0.0008345331,0.00004115515,0.00001356602],"category_scores_gemma":[0.00007247682,0.00006033481,0.0002151603,0.000228317,0.0001583713,0.0004603142,0.00003562927,0.0001673871,0.000004666538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001082934,"about_ca_system_score_gemma":0.00009229859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003818648,"about_ca_topic_score_gemma":0.000001116111,"domain_scores_codex":[0.9989374,0.0001350955,0.0003695695,0.0001226962,0.0002279396,0.0002072482],"domain_scores_gemma":[0.9984763,0.0004413532,0.0003348859,0.0004171204,0.0002236996,0.0001066439],"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.0001482857,0.0003550746,0.0009607174,0.00003160638,0.0002915979,0.00003706106,0.003167669,0.0005465594,0.01521732,0.9611791,0.004720601,0.01334438],"study_design_scores_gemma":[0.001089989,0.0005140368,0.001544888,0.000041608,0.00005034674,0.0008302006,0.0001875121,0.0139569,0.001569574,0.9794728,0.0005764869,0.0001656961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.511248,0.001149351,0.4856942,0.0005346694,0.0009405733,0.0001699591,0.000001338962,0.000042928,0.0002190048],"genre_scores_gemma":[0.9788705,0.0000679638,0.02056672,0.0003565137,0.0000445103,0.000004428816,1.980274e-7,0.000009573816,0.0000796114],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4676225,"threshold_uncertainty_score":0.3055614,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01861362548638817,"score_gpt":0.2616722003509868,"score_spread":0.2430585748645986,"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."}}