{"id":"W4409280356","doi":"10.1145/3728631","title":"Maximum Flow and Minimum-Cost Flow in Almost-Linear Time","year":2025,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Minimum-cost flow problem; Flow (mathematics); Maximum flow problem; Mathematics; Computer science; Mathematical optimization; Geometry","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.0005305946,0.00008475202,0.0001756956,0.000158327,0.00008973436,0.00008171546,0.00251899,0.00004019053,0.00001528287],"category_scores_gemma":[0.0004320732,0.00005691745,0.0001008032,0.0004820671,0.00005612855,0.0002338779,0.001189589,0.0002887605,0.00000906357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002898966,"about_ca_system_score_gemma":0.00008041239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004471284,"about_ca_topic_score_gemma":0.000005975858,"domain_scores_codex":[0.9991648,0.00007888943,0.0002841079,0.0001174882,0.0002009047,0.0001537664],"domain_scores_gemma":[0.9988182,0.0001858644,0.0001195639,0.0007611674,0.00006888203,0.00004632705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001702702,0.0006187377,0.008494408,0.00008813999,0.0002419978,0.0003052851,0.003003196,0.005879948,0.003508266,0.004275502,0.1041043,0.8693099],"study_design_scores_gemma":[0.001554855,0.0001295781,0.02216392,0.0003716686,0.0000250092,0.0003248423,0.00004553505,0.6471874,0.001681172,0.293845,0.03246053,0.000210559],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.6409793,0.00411093,0.1644889,0.1754677,0.008691997,0.0007921134,0.0000234928,0.00009285166,0.005352586],"genre_scores_gemma":[0.1339171,0.0002434893,0.8575792,0.004700272,0.0005651357,0.000004644975,6.828243e-7,0.00001787455,0.002971598],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8690993,"threshold_uncertainty_score":0.4680952,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01596048731152192,"score_gpt":0.2604227304612225,"score_spread":0.2444622431497006,"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."}}