{"id":"W4388750673","doi":"10.1145/3610940","title":"Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow","year":2023,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Minimum-cost flow problem; Amortized analysis; Mathematics; Minimum cut; Separable space; Algorithm; Time complexity; Maximum flow problem; Bounded function; Regular polygon; Combinatorics; Directed graph; Discrete mathematics; Mathematical optimization; Computer science; Flow network; Data structure","routes":{"ca_aff":true,"ca_fund":false,"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":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0006558421,0.00007759706,0.0001165512,0.00008236262,0.0003707922,0.0000617914,0.01606942,0.0000423685,0.000008013661],"category_scores_gemma":[0.002804771,0.00006136917,0.00006525025,0.0006270296,0.0001632164,0.0001861348,0.01430171,0.0001051448,0.00006073558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001289172,"about_ca_system_score_gemma":0.00005819251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006660243,"about_ca_topic_score_gemma":0.000005106045,"domain_scores_codex":[0.999181,0.0001367039,0.0002049576,0.0001629995,0.000142289,0.0001720684],"domain_scores_gemma":[0.9856241,0.0006791797,0.00007727232,0.01338136,0.0001837559,0.00005437175],"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.00002737616,0.0005331373,0.0005893747,0.0001502847,0.0002047351,8.444212e-7,0.007920666,0.03920857,0.004482822,0.02023433,0.4353704,0.4912774],"study_design_scores_gemma":[0.0002668025,0.00002118463,0.0002337963,0.00001937918,0.00000518108,0.000001969153,0.00002940228,0.9449426,0.0002870554,0.03140782,0.02271408,0.00007072889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"commentary","genre_gemma":"methods","genre_scores_codex":[0.001636135,0.001049875,0.4784721,0.5098906,0.0005697198,0.003403145,0.0002859355,0.0007287417,0.003963763],"genre_scores_gemma":[0.003004671,0.0003766935,0.9947081,0.0002757062,0.0000162116,0.0001245275,0.00004952047,0.0000118043,0.001432719],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9057341,"threshold_uncertainty_score":0.9936705,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09238388434712162,"score_gpt":0.3403967687830984,"score_spread":0.2480128844359767,"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."}}