{"id":"W4415966320","doi":"10.48550/arxiv.2510.17740","title":"Generalized Flow in Nearly-linear Time on Moderately Dense Graphs","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","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; Simons Institute for the Theory of Computing, University of California Berkeley; Microsoft Research; National Science Foundation","keywords":"Flow (mathematics); Maximum flow problem; Enhanced Data Rates for GSM Evolution; Graph; Point (geometry); Flow network; Control flow graph","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.001910406,0.002355371,0.002144719,0.0008981939,0.001257085,0.002797814,0.002981472,0.001763942,0.01016639],"category_scores_gemma":[0.01191839,0.001045703,0.001394522,0.002014654,0.001519675,0.007547512,0.003540969,0.002946825,0.002092823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002405876,"about_ca_system_score_gemma":0.002236449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005990935,"about_ca_topic_score_gemma":0.01328725,"domain_scores_codex":[0.9973246,0.0007739114,0.0001148233,0.0008172364,0.0005102608,0.0004590804],"domain_scores_gemma":[0.9939311,0.003814462,0.0004958453,0.001103682,0.0003241396,0.0003307386],"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.0009957724,0.0003593333,0.001827145,0.000885381,0.0001706263,0.0003651055,0.0004891362,0.7123746,0.00528871,0.1210762,0.02209479,0.1340732],"study_design_scores_gemma":[0.0001210817,0.00006204264,0.0002131989,0.00002140326,0.00002366508,0.00008992437,0.00007527785,0.8022991,0.0007350358,0.1939376,0.002408828,0.00001284551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.118738,0.001325831,0.8520917,0.003250373,0.0002663989,0.0004773334,0.001992753,0.006350658,0.0155071],"genre_scores_gemma":[0.4898706,0.0005892224,0.4927105,0.0009450607,0.000273486,0.0006288951,0.00347951,0.001069561,0.01043321],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01016639,"threshold_uncertainty_score":0.03400993,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06437540954912388,"score_gpt":0.2899571920698005,"score_spread":0.2255817825206766,"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."}}