{"id":"W4388482109","doi":"10.48550/arxiv.2311.03174","title":"Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Microsoft Research; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Maximum flow problem; Multiplicative function; Monotonic function; Mathematics; Undirected graph; Combinatorics; Minimum-cost flow problem; Algorithm; Norm (philosophy); Interior point method; Approximation algorithm; Graph; Computer science; Discrete mathematics; Flow network","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002795946,0.001963945,0.00168025,0.001384975,0.001232748,0.002191999,0.005068244,0.002137986,0.004948739],"category_scores_gemma":[0.01862358,0.0009073578,0.001467007,0.002394116,0.001692525,0.006619612,0.0034636,0.003118237,0.001892933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002514591,"about_ca_system_score_gemma":0.004037431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004169326,"about_ca_topic_score_gemma":0.007069383,"domain_scores_codex":[0.9963032,0.0008346833,0.0002189043,0.0008638033,0.001214277,0.0005651492],"domain_scores_gemma":[0.9857306,0.007375954,0.001185088,0.00440318,0.0009208488,0.0003844085],"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.001752937,0.0005191437,0.003598187,0.0005517217,0.0002004554,0.0002110812,0.0005385855,0.4531655,0.02179263,0.05639702,0.02031319,0.4409595],"study_design_scores_gemma":[0.0001176318,0.0001129793,0.0002938219,0.00001853836,0.00003928334,0.0001168587,0.00004675567,0.9534011,0.00611638,0.03705057,0.002665177,0.00002093319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03795382,0.0003948771,0.9456937,0.001009693,0.0001122874,0.0002451829,0.0004704857,0.008989188,0.005130783],"genre_scores_gemma":[0.3832928,0.0002094088,0.6086993,0.0004884228,0.0001379395,0.0006050169,0.001277413,0.0008913118,0.00439837],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005068244,"threshold_uncertainty_score":0.01824468,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06854744414091743,"score_gpt":0.1927018592108034,"score_spread":0.124154415069886,"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."}}