{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004194569,0.002686368,0.002597763,0.001182694,0.002278045,0.005182055,0.005889064,0.002415339,0.01250051],"category_scores_gemma":[0.01840393,0.001636938,0.004103182,0.003537429,0.004151845,0.01316671,0.006178237,0.007507639,0.005045431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006577322,"about_ca_system_score_gemma":0.006846543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00600491,"about_ca_topic_score_gemma":0.007316313,"domain_scores_codex":[0.9895177,0.001835157,0.000722557,0.00374383,0.002362921,0.00181779],"domain_scores_gemma":[0.9808511,0.01021781,0.0008586942,0.006490065,0.001129021,0.0004533317],"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.001940454,0.0003471194,0.00164893,0.001347203,0.0003277787,0.0002577096,0.0005475864,0.1573512,0.01159141,0.6256668,0.04978246,0.1491915],"study_design_scores_gemma":[0.0003565892,0.0001496076,0.0003389987,0.00006849248,0.0001253588,0.0001361409,0.00007525505,0.2662051,0.005335432,0.7080281,0.01910454,0.00007638266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02894587,0.002105883,0.9177005,0.006799034,0.0006525545,0.0004919463,0.002289796,0.01475532,0.02625908],"genre_scores_gemma":[0.3200343,0.001458451,0.6459675,0.004205094,0.0006810651,0.001395104,0.003625989,0.002687441,0.01994498],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01250051,"threshold_uncertainty_score":0.0477221,"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."}}