{"id":"W1568987606","doi":"10.1007/978-3-540-68891-4_7","title":"A Polynomial Algorithm for Weighted Abstract Flow","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Path (computing); Generalization; Flow (mathematics); Constructive; Oracle; Mathematics; Flow network; Minimum-cost flow problem; sort; Mathematical optimization; Maximum flow problem; Polynomial; Computer science; Algorithm; Arithmetic","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.0006728751,0.0007670764,0.0007802695,0.001148013,0.0006506161,0.0005740142,0.004703145,0.0004819651,0.00003694929],"category_scores_gemma":[0.00004937036,0.0007388111,0.0004076149,0.0007109079,0.001087399,0.0007171991,0.001231084,0.0009877781,0.0000484024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002987723,"about_ca_system_score_gemma":0.0008744036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002841846,"about_ca_topic_score_gemma":0.00003864307,"domain_scores_codex":[0.994998,0.00001976934,0.0007284257,0.002081428,0.001110087,0.001062252],"domain_scores_gemma":[0.9965979,0.0007774399,0.0003438514,0.001646644,0.0003464147,0.000287698],"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.000005132705,0.00004256338,0.000001476623,0.00001899967,0.00001751962,0.000100829,0.0003432373,0.001381715,0.0000148442,0.0008566097,0.0008841271,0.9963329],"study_design_scores_gemma":[0.00056325,0.0002260361,0.00004542328,0.0001959466,0.000008043811,0.000148117,6.515877e-8,0.9105608,0.0005667075,0.06191745,0.02486124,0.0009068573],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001008875,0.0006587426,0.9914057,0.0006460529,0.004035233,0.0007318201,0.00006004804,0.0002995502,0.00215277],"genre_scores_gemma":[0.001179542,0.0001232116,0.9952891,0.001302032,0.001544714,0.00002968637,0.00002032508,0.00005111276,0.0004602167],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9954261,"threshold_uncertainty_score":0.9995063,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02192116302009429,"score_gpt":0.2452440344484992,"score_spread":0.2233228714284049,"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."}}