{"id":"W4415270694","doi":"10.48550/arxiv.2510.12619","title":"Vizing's Theorem in Deterministic Almost-Linear Time","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; European Commission; United States-Israel Binational Science Foundation; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Sublinear function; Deterministic algorithm; Time complexity; Upper and lower bounds; Degree (music); Randomized algorithm; Running time","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008057689,0.0003764007,0.0004903484,0.0002525908,0.0001019977,0.0001138123,0.002397731,0.0003019242,0.0001518855],"category_scores_gemma":[0.0001962895,0.0003616603,0.0001785814,0.0003781125,0.00009464945,0.0001520107,0.002794602,0.0008201207,0.0008133177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000748384,"about_ca_system_score_gemma":0.0002828265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000260747,"about_ca_topic_score_gemma":0.000004127061,"domain_scores_codex":[0.9976165,0.000272284,0.0004935228,0.0009330151,0.0002327591,0.0004519565],"domain_scores_gemma":[0.9977496,0.000371028,0.0001911138,0.001511838,0.00007073043,0.0001056414],"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.0002930932,0.002164757,0.0949709,0.003110589,0.0006891912,0.003123801,0.01171204,0.01025668,0.002078769,0.4340696,0.004440564,0.43309],"study_design_scores_gemma":[0.001841824,0.000338473,0.03093013,0.002381716,0.0001247358,0.00006014806,0.00007051886,0.6774077,0.008194793,0.248608,0.02689416,0.003147735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7779286,0.0007691415,0.1562614,0.001714269,0.004466596,0.001207493,0.00008785419,0.0009959688,0.0565687],"genre_scores_gemma":[0.9628586,0.00009641367,0.01694204,0.0008947594,0.000545919,0.0001034751,0.00003838135,0.00003709022,0.01848334],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.667151,"threshold_uncertainty_score":0.9999647,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0261324427197144,"score_gpt":0.2786932219901528,"score_spread":0.2525607792704385,"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."}}