{"id":"W4313203312","doi":"10.1109/focs54457.2022.00064","title":"Maximum Flow and Minimum-Cost Flow in Almost-Linear Time","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minimum-cost flow problem; Mathematics; Minimum cut; Separable space; Combinatorics; Amortized analysis; Bounded function; Regular polygon; Scaling; Time complexity; Maximum flow problem; Flow (mathematics); Discrete mathematics; Directed graph; Approximation algorithm; Mathematical optimization; Flow network; Computer science; Data structure","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001815291,0.0002563669,0.0003281721,0.001028903,0.0009900427,0.0003822566,0.002387464,0.0000508864,0.0001947077],"category_scores_gemma":[0.00004181482,0.0002755409,0.00008525269,0.003289393,0.0004936216,0.001811001,0.001310071,0.0003963106,0.0001042413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002322854,"about_ca_system_score_gemma":0.0005276329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003430622,"about_ca_topic_score_gemma":0.000009348529,"domain_scores_codex":[0.996119,0.0002545129,0.0005934485,0.001010934,0.00138274,0.0006393283],"domain_scores_gemma":[0.9980744,0.0002092729,0.0001980198,0.00090464,0.0003453961,0.0002683152],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004065012,0.00078786,0.0002793462,0.00002474084,0.00001939684,0.00002742349,0.006026563,0.922797,0.004211518,0.00748291,0.00455849,0.05374405],"study_design_scores_gemma":[0.0006928509,0.0006212774,0.0002974757,0.00001930947,0.000003564307,0.00003295368,0.00007044169,0.9885436,0.0005879065,0.0008897127,0.00793092,0.0003099363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04945556,0.00004829012,0.9315991,0.01064762,0.003136725,0.001670373,0.0002496254,0.0003282203,0.002864467],"genre_scores_gemma":[0.5239353,0.0001395753,0.4669846,0.004376112,0.0004693914,0.0005051045,0.0001289758,0.00009255576,0.003368368],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4744797,"threshold_uncertainty_score":0.9999697,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01399420956229129,"score_gpt":0.2647044641196495,"score_spread":0.2507102545573582,"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."}}