{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008527552,0.001451514,0.000858074,0.00112196,0.0007607565,0.00160168,0.001660569,0.001278007,0.006065302],"category_scores_gemma":[0.00734357,0.000596755,0.000925791,0.001527571,0.0008578877,0.003903002,0.001396515,0.001656682,0.001521091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00203123,"about_ca_system_score_gemma":0.002605347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006270859,"about_ca_topic_score_gemma":0.007973064,"domain_scores_codex":[0.9990153,0.0001756613,0.00006251939,0.000295905,0.0002881627,0.0001623733],"domain_scores_gemma":[0.9978009,0.001137769,0.0002046608,0.0004757608,0.0002952723,0.00008565202],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005218068,0.0002208712,0.002127318,0.0003125757,0.00009184873,0.0001324299,0.0002324252,0.6082665,0.008890172,0.06833792,0.01352262,0.2973436],"study_design_scores_gemma":[0.00003736656,0.00002567975,0.0002387086,0.00001256042,0.00001063953,0.00004999516,0.00003671374,0.9297438,0.002854004,0.06524307,0.001737905,0.000009506412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04239456,0.0002350104,0.9448634,0.0005138129,0.00006095308,0.0001612174,0.000623652,0.004620914,0.006526465],"genre_scores_gemma":[0.2914569,0.0001518704,0.701928,0.0001795113,0.00006781746,0.0002246437,0.001796857,0.0007996465,0.003394816],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006270859,"threshold_uncertainty_score":0.02029049,"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."}}