{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.001467949,0.001569131,0.001868651,0.001248286,0.0007795293,0.0006996699,0.004633421,0.001067033,0.0005230622],"category_scores_gemma":[0.00024723,0.001726275,0.001115309,0.002755623,0.0005242325,0.0005710953,0.004410208,0.00327637,0.001709136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003092764,"about_ca_system_score_gemma":0.001022764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007820288,"about_ca_topic_score_gemma":0.0001525904,"domain_scores_codex":[0.9903936,0.001117717,0.001936975,0.003654842,0.001160052,0.001736747],"domain_scores_gemma":[0.9938454,0.0006145082,0.0005662519,0.003989854,0.000486937,0.000497057],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002621439,0.007034791,0.06904137,0.001449392,0.002021208,0.003209655,0.01283928,0.6138443,0.001986009,0.08524773,0.007046276,0.1936585],"study_design_scores_gemma":[0.002232647,0.0003071097,0.02603669,0.001138671,0.00007583014,0.00002347397,0.00001615921,0.9282253,0.002111662,0.0352138,0.002889292,0.001729346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9540465,0.001075397,0.03245835,0.002258181,0.005144419,0.001530002,0.0001747304,0.0004597153,0.002852702],"genre_scores_gemma":[0.8112178,0.003551715,0.1560468,0.007420959,0.001376311,0.0005513576,0.0002871102,0.0002028082,0.01934514],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.314381,"threshold_uncertainty_score":0.9997057,"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."}}