{"id":"W4411319863","doi":"10.1145/3717823.3718265","title":"Vizing’s Theorem in Near-Linear Time","year":2025,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; European Commission; Simons Institute for the Theory of Computing, University of California Berkeley; United States-Israel Binational Science Foundation; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Computer science; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.0002397607,0.00007119629,0.00009848377,0.0001089295,0.00007676949,0.000103146,0.0007022882,0.00003288904,0.0001197217],"category_scores_gemma":[0.00002501693,0.00006233544,0.00004307641,0.0007396281,0.00005853527,0.0001653372,0.0003196644,0.000106876,0.0002135299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001657119,"about_ca_system_score_gemma":0.00005683177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000512526,"about_ca_topic_score_gemma":0.00001779654,"domain_scores_codex":[0.9993308,0.00003639715,0.0001332211,0.0002251582,0.00009767121,0.000176739],"domain_scores_gemma":[0.9994658,0.00009208344,0.0000142269,0.0003795794,0.00002205697,0.0000263],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001873991,0.00004525728,0.0002906127,0.000003807573,0.000004690527,0.000007721561,0.0001474968,0.00006250235,0.00007506354,0.9241262,0.001785946,0.07344881],"study_design_scores_gemma":[0.0002559377,0.00002018523,0.002986212,0.00002618946,0.000001087429,0.000002465766,0.00001082458,0.7394371,0.0009770035,0.2321357,0.02402558,0.0001217821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01308013,0.0001066207,0.7177779,0.004244922,0.0004643373,0.0001427379,8.59541e-7,0.0003639704,0.2638185],"genre_scores_gemma":[0.4105645,0.0000140212,0.5605216,0.004767717,0.00006756517,0.00001630213,0.00000234024,0.00000911504,0.02403684],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7393746,"threshold_uncertainty_score":0.2744566,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01008172004034665,"score_gpt":0.2535451831704213,"score_spread":0.2434634631300746,"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."}}