{"id":"W2030901166","doi":"","title":"The Acyclic Edge Chromatic Number of a Random d-Regular Graph is d + 1","year":2001,"lang":"en","type":"article","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":47,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Edge coloring; Discrete mathematics; Chromatic scale; Conjecture; Brooks' theorem; Windmill graph; Graph coloring; Foster graph; Wheel graph; Friendship graph; Graph; List coloring; Critical graph; Random graph; Graph power; 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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004747797,0.0001519666,0.0002851123,0.00003770385,0.0002909441,0.00002600025,0.0003630246,0.00007848105,0.001198556],"category_scores_gemma":[0.0002028697,0.00007922365,0.0002373911,0.0002249636,0.0002447758,0.00005650522,0.00009273034,0.0001020013,0.00001897286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008115393,"about_ca_system_score_gemma":0.00001175431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001201901,"about_ca_topic_score_gemma":0.000009898073,"domain_scores_codex":[0.9988694,0.00009766538,0.0003861121,0.0001442077,0.0002581865,0.0002444268],"domain_scores_gemma":[0.9982055,0.0008795947,0.0001412183,0.0006628173,0.00005891597,0.00005191561],"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.0001033484,0.00006922607,0.002094655,0.00007985601,0.000219342,0.000004650579,0.001958405,3.421029e-7,0.0002281592,0.970134,0.02198633,0.003121676],"study_design_scores_gemma":[0.001125032,0.00001548513,0.0005378571,0.00002709865,0.00006218493,0.00005286499,0.0002612141,0.00006306996,0.001752186,0.9886326,0.007350382,0.000120048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9219659,0.00019835,0.001601781,0.0003453305,0.0002457637,0.0003048236,0.000004187509,0.00007077665,0.07526309],"genre_scores_gemma":[0.9914652,0.0001759287,0.002584835,0.0002357971,0.00007427483,0.00001723708,7.36196e-7,0.0000239146,0.005422155],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06984094,"threshold_uncertainty_score":0.9997145,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01998900517465182,"score_gpt":0.2994730386400654,"score_spread":0.2794840334654136,"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."}}