{"id":"W2071642760","doi":"10.1007/s101070100253","title":"A faster capacity scaling algorithm for minimum cost submodular flow","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Mathematics; Minimum-cost flow problem; Maximum flow problem; Scaling; Dijkstra's algorithm; Shortest path problem; Mathematical optimization; Approximation algorithm; Suurballe's algorithm; Flow (mathematics); Flow network; Algorithm; Graph; Combinatorics","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":[],"consensus_categories":[],"category_scores_codex":[0.0005726737,0.0002544461,0.0003565009,0.0001071912,0.0003290116,0.0004816027,0.0008341114,0.0001099708,0.00008385565],"category_scores_gemma":[0.0001564943,0.0002295625,0.0002548548,0.0004076581,0.0001570896,0.0003785909,0.0002510515,0.0002180129,0.0001319655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004194332,"about_ca_system_score_gemma":0.000007894175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002365727,"about_ca_topic_score_gemma":0.000001000891,"domain_scores_codex":[0.9978345,0.00005213211,0.0004454427,0.0005383496,0.0004100532,0.0007195468],"domain_scores_gemma":[0.9985976,0.0003573426,0.00009276956,0.0006226079,0.0001089899,0.00022073],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[8.087156e-7,0.0002784987,0.000004156033,0.0001008292,0.00002377218,0.000008821027,0.0009656645,0.00001023292,0.00002124047,0.02361865,0.000162682,0.9748046],"study_design_scores_gemma":[0.0004075711,0.00007680883,0.000004642807,0.00007685764,0.00001488944,0.00004752714,0.00004554543,0.9201764,0.0003100658,0.06757045,0.01098013,0.0002891287],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00134107,0.00008534764,0.9960242,0.0004916899,0.0002468906,0.0009202044,0.000007855695,0.0003642621,0.0005184828],"genre_scores_gemma":[0.01980517,0.000001903005,0.9793463,0.0001699894,0.000171595,0.0002802328,0.000003001847,0.00002353408,0.000198254],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9745155,"threshold_uncertainty_score":0.9361289,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0668083390083673,"score_gpt":0.2628127092700038,"score_spread":0.1960043702616365,"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."}}