{"id":"W4390575880","doi":"10.1137/1.9781611977912.106","title":"Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time","year":2024,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Maximum flow problem; Multiplicative function; Monotonic function; Algorithm; Minimum-cost flow problem; Undirected graph; Mathematics; Interior point method; Norm (philosophy); Computer science; Combinatorics; Graph; Amortized analysis; Discrete mathematics; Mathematical optimization; Data structure; Flow network","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002458303,0.00157094,0.001375214,0.001258563,0.001141531,0.002322684,0.004260599,0.001951421,0.00464336],"category_scores_gemma":[0.01634588,0.0007347896,0.001086237,0.002736928,0.001549303,0.007867873,0.003255971,0.002600292,0.001438091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00239867,"about_ca_system_score_gemma":0.003101982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002434137,"about_ca_topic_score_gemma":0.003967801,"domain_scores_codex":[0.9971162,0.0006195882,0.0002247601,0.0007226881,0.0008867125,0.0004299614],"domain_scores_gemma":[0.9869084,0.006462364,0.0009950106,0.00467236,0.0006585826,0.0003033005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00172537,0.0004963701,0.003760636,0.0006629152,0.0002148314,0.0002146408,0.0005044063,0.3337399,0.02907018,0.06049564,0.02831423,0.5408009],"study_design_scores_gemma":[0.0001401059,0.0001510555,0.0005104947,0.00003099177,0.00005742705,0.0002546156,0.00007080388,0.902478,0.01308656,0.07802178,0.005165942,0.00003212333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06703357,0.0006858802,0.9121053,0.001244416,0.000142216,0.0002935687,0.001000626,0.009960259,0.007534156],"genre_scores_gemma":[0.4252177,0.0002885537,0.565381,0.0003999831,0.0001615247,0.0005347136,0.001754359,0.0007227746,0.005539376],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00464336,"threshold_uncertainty_score":0.01740366,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03992184772630632,"score_gpt":0.2312016338689604,"score_spread":0.1912797861426541,"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."}}