{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004613145,0.0005033792,0.0005259529,0.001158705,0.0002103632,0.0002104721,0.00273317,0.0003389518,0.0000769524],"category_scores_gemma":[0.00002599405,0.000618448,0.0003236489,0.001869315,0.0001880142,0.0003399568,0.003388149,0.001001831,0.000739154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003261996,"about_ca_system_score_gemma":0.0001547432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004469923,"about_ca_topic_score_gemma":0.00028222,"domain_scores_codex":[0.996853,0.0002670318,0.0003367082,0.00167044,0.0002030458,0.0006697915],"domain_scores_gemma":[0.9979172,0.0001417953,0.0002260927,0.001452533,0.00006973738,0.0001926005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007623442,0.001936379,0.009608763,0.0003790259,0.000862392,0.007281397,0.001227469,0.3929132,0.0004266293,0.5593349,0.008691878,0.01657565],"study_design_scores_gemma":[0.0008851749,0.00007266131,0.003031412,0.0001468475,0.0000256501,0.000004176523,0.00002016309,0.7696816,0.0002077978,0.2250368,0.0002154871,0.0006723148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8450739,0.00004355632,0.1437442,0.0005132649,0.003223707,0.001150687,0.0002137933,0.002189716,0.003847122],"genre_scores_gemma":[0.9929717,0.0001461332,0.005581133,0.0001661145,0.00009170383,0.000004448553,0.0001427414,0.00004868491,0.0008473733],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3767683,"threshold_uncertainty_score":0.9996267,"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."}}