{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004074593,0.000238943,0.0002931794,0.0001325028,0.000459429,0.0001956604,0.00106314,0.00009469697,0.00002021537],"category_scores_gemma":[0.0001355507,0.0002527145,0.0001763929,0.0007556719,0.00006994258,0.0003204519,0.0001644756,0.0001918829,0.00003528627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001230098,"about_ca_system_score_gemma":0.0001230764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002124334,"about_ca_topic_score_gemma":0.000003485419,"domain_scores_codex":[0.9980569,0.00007531864,0.0003106509,0.0006127418,0.0003234002,0.0006209125],"domain_scores_gemma":[0.9984794,0.0002021824,0.00009945106,0.0008107005,0.0001970766,0.0002112084],"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.000008313119,0.0004732714,0.0002986803,0.00005367277,0.00006186636,0.00003179089,0.0006812323,0.0007778208,0.000225132,0.8339563,0.005788008,0.1576439],"study_design_scores_gemma":[0.001903336,0.0002820856,0.0002142217,0.00003548224,0.00001734253,0.00003184193,0.00006664747,0.4796722,0.004122559,0.3131596,0.199801,0.0006937179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002653084,0.0007507048,0.9883281,0.0004218926,0.003551388,0.0005805462,0.00001629951,0.0002919465,0.003406067],"genre_scores_gemma":[0.6830288,0.0000826424,0.3149798,0.0005333679,0.0001882654,0.0003541035,0.00001413504,0.00005153291,0.000767339],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6803758,"threshold_uncertainty_score":0.9999925,"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."}}