{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005806425,0.0006411491,0.0007995297,0.0002027625,0.0002491786,0.0003606318,0.0006951367,0.0007851213,0.00002998513],"category_scores_gemma":[0.000006562154,0.0006000578,0.0006325307,0.00008701179,0.0002660925,0.00005393521,0.0005614043,0.0009925959,0.00005794417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001180706,"about_ca_system_score_gemma":0.0001139474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003841358,"about_ca_topic_score_gemma":0.000005214226,"domain_scores_codex":[0.9975128,0.000006267841,0.00069333,0.0008493528,0.0004353815,0.0005028696],"domain_scores_gemma":[0.9988071,0.0002274702,0.0002668567,0.0005253765,0.0000329017,0.0001403056],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000352359,0.00005186097,4.268149e-8,0.0001981525,0.0002412677,0.000004458702,0.0007052911,0.000004118439,0.0001406037,0.9601994,0.005220906,0.03319864],"study_design_scores_gemma":[0.001615588,0.000122916,6.479561e-8,0.0004343287,0.0001143482,0.000009059042,0.00004667576,0.01717804,0.0006275683,0.9566032,0.02254079,0.0007073933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.001647731,0.0002884033,0.01519533,0.0006422678,0.002330798,0.00723594,0.001205793,0.001365777,0.9700879],"genre_scores_gemma":[0.00374763,0.0002575285,0.6295367,0.001770119,0.004225985,0.001596891,0.000966378,0.0009145565,0.3569842],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.6143414,"threshold_uncertainty_score":0.9996451,"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."}}