{"id":"W2074364524","doi":"10.1002/jgt.20571","title":"On characterizing Vizing's edge colouring bound","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Domination analysis; Logarithm; Bounded function; Upper and lower bounds; Multiplicity (mathematics); Graph; Edge coloring; Discrete mathematics; Vertex (graph theory); Line graph; Graph power; 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.002932524,0.0001783079,0.0002926723,0.0007569166,0.0002271232,0.0001092989,0.001619376,0.00006908408,0.00007428871],"category_scores_gemma":[0.0002516601,0.0001449583,0.000255554,0.0005555624,0.0001980865,0.0010072,0.0002100106,0.0006155914,0.00004098545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000546909,"about_ca_system_score_gemma":0.00008135458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.655764e-7,"about_ca_topic_score_gemma":3.973961e-7,"domain_scores_codex":[0.9979645,0.0004134467,0.0004636399,0.0002309721,0.0004936691,0.0004337466],"domain_scores_gemma":[0.9980632,0.0004935985,0.0004694742,0.0005212881,0.0002275674,0.0002248893],"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.000380936,0.0001601888,0.0003753489,0.00001223744,0.00007855089,0.0002648162,0.001681068,0.000006280493,0.01180571,0.9716611,0.0001088004,0.01346495],"study_design_scores_gemma":[0.0004932855,0.0006992334,0.00553978,0.0001233768,0.00001014806,0.0002321187,0.0001125041,0.00003946299,0.01988867,0.9721775,0.0004966621,0.0001872369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7852529,0.0004334766,0.2031702,0.0001417949,0.001156833,0.0001306369,0.000001316811,0.00006986349,0.009643018],"genre_scores_gemma":[0.9904892,0.0000694464,0.00869442,0.0004350613,0.0001246096,0.000003008242,1.222309e-7,0.0000219603,0.0001621987],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2052363,"threshold_uncertainty_score":0.5911228,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03840095596067328,"score_gpt":0.2793574008753293,"score_spread":0.2409564449146561,"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."}}