{"id":"W4235275672","doi":"10.1002/jgt.20064","title":"The acyclic edge chromatic number of a random <i>d</i>‐regular graph is <i>d</i> + 1","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":39,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Conjecture; Foster graph; Discrete mathematics; Critical graph; Edge coloring; Friendship graph; Random graph; Graph; Windmill graph; Brooks' theorem; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Graph power; Line graph; Computer science","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.004691302,0.0003430479,0.0008314446,0.0002415551,0.0005189238,0.00005848302,0.001072048,0.0001714378,0.0003203951],"category_scores_gemma":[0.00077072,0.0001960281,0.001159942,0.0004915632,0.0008020496,0.0002883288,0.0001326704,0.000568344,0.000009295339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003416066,"about_ca_system_score_gemma":0.00007109458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000012455,"about_ca_topic_score_gemma":0.00000269367,"domain_scores_codex":[0.9963241,0.0007227093,0.001531939,0.0001873946,0.0007842373,0.0004496128],"domain_scores_gemma":[0.9939641,0.003141138,0.001588146,0.0007834266,0.0003471879,0.0001759359],"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.001239142,0.0002834375,0.0007373982,0.0001729795,0.001170347,0.00001836843,0.005469256,0.000009479048,0.001575524,0.9580431,0.020001,0.01127998],"study_design_scores_gemma":[0.002588643,0.0001023395,0.0002918519,0.0001914894,0.0003832972,0.0004646032,0.000524467,0.00001150646,0.00625571,0.9797257,0.009234703,0.0002257502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.982495,0.004774224,0.002859941,0.0008127498,0.0009871656,0.0003537492,0.00001638031,0.00003953119,0.007661249],"genre_scores_gemma":[0.9925694,0.001071842,0.004624737,0.0005912663,0.0005083141,0.000007452737,4.396259e-7,0.0000618457,0.000564635],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02168255,"threshold_uncertainty_score":0.7993793,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01308008132324962,"score_gpt":0.2844518910577733,"score_spread":0.2713718097345237,"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."}}