{"id":"W1986273263","doi":"10.1007/s00493-003-0030-3","title":"Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*","year":2003,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Mathematics; Time complexity; Minimum-cost flow problem; Combinatorics; Flow (mathematics); Disjoint sets; Algorithm; Flow network; Discrete mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003225842,0.002440127,0.002652222,0.002379927,0.001922437,0.002648636,0.004438089,0.002389494,0.01656166],"category_scores_gemma":[0.01035297,0.001050578,0.00194079,0.003162404,0.00164267,0.006118578,0.003614649,0.00409294,0.002000517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002690626,"about_ca_system_score_gemma":0.003900054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004967852,"about_ca_topic_score_gemma":0.006593928,"domain_scores_codex":[0.9983394,0.0004765059,0.00009072608,0.0003318084,0.0004049556,0.0003565221],"domain_scores_gemma":[0.9933437,0.004142151,0.0003876001,0.00126078,0.0005118681,0.0003537991],"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":[0.001778235,0.0007919966,0.001074045,0.0008101133,0.0001303949,0.0001044117,0.000332491,0.1612739,0.008755679,0.1230078,0.04126158,0.6606793],"study_design_scores_gemma":[0.000441397,0.0002491757,0.000309408,0.00006325219,0.00006444611,0.00009155508,0.00008831366,0.7396582,0.00488783,0.2477969,0.006304102,0.00004546613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07080487,0.001007444,0.8994856,0.001729164,0.000425071,0.0006576858,0.0008718431,0.005086551,0.01993176],"genre_scores_gemma":[0.2329286,0.000429677,0.7542557,0.0006092748,0.0002367702,0.0005628281,0.001523663,0.001107383,0.008345947],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01656166,"threshold_uncertainty_score":0.05540425,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02942264740207311,"score_gpt":0.2672352279507417,"score_spread":0.2378125805486686,"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."}}