{"id":"W1999565878","doi":"10.1016/j.disc.2008.04.023","title":"Achieving maximum chromatic index in multigraphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Multigraph; Upper and lower bounds; Edge coloring; Bipartite graph; Multiplicity (mathematics); Discrete mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00153942,0.001301582,0.001417991,0.001864711,0.002246466,0.003647437,0.002416243,0.001458819,0.006314224],"category_scores_gemma":[0.005580494,0.0008922925,0.0007747639,0.002695513,0.001921057,0.005563919,0.004223716,0.00279171,0.001160703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002929222,"about_ca_system_score_gemma":0.001224849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00105929,"about_ca_topic_score_gemma":0.003315688,"domain_scores_codex":[0.9987746,0.0002837764,0.00004193469,0.0002868604,0.0003046591,0.0003081851],"domain_scores_gemma":[0.9946758,0.003012039,0.0003752052,0.0009778189,0.0003143348,0.0006449104],"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.000955885,0.0002921008,0.002451654,0.000610307,0.0001094045,0.0002337029,0.0008370093,0.07464527,0.03250319,0.7953823,0.01887562,0.07310359],"study_design_scores_gemma":[0.00007309247,0.00008943418,0.0006563027,0.00005862261,0.00005118713,0.00014838,0.0001678152,0.1048789,0.009686816,0.8795298,0.004632769,0.0000268513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4326358,0.00152501,0.4420646,0.003255457,0.0002216613,0.0001769324,0.001252656,0.002706246,0.1161617],"genre_scores_gemma":[0.8567168,0.000704172,0.1304727,0.0006769535,0.0001726999,0.0001506527,0.0006607143,0.0006384511,0.009806828],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006314224,"threshold_uncertainty_score":0.02125311,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02820827059957298,"score_gpt":0.2881130138529892,"score_spread":0.2599047432534162,"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."}}