{"id":"W1972661641","doi":"10.1002/net.20099","title":"The multiroute maximum flow problem revisited","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Maximum flow problem; Flow network; Vertex (graph theory); Flow (mathematics); Combinatorics; Disjoint sets; Mathematics; Path (computing); Arc (geometry); Multi-commodity flow problem; Minimum-cost flow problem; Integer programming; Mathematical optimization; Computer science; Graph","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.0003886269,0.0001237501,0.0001092846,0.00002884806,0.0004772073,0.0003152132,0.001131892,0.00006324621,0.00001521204],"category_scores_gemma":[0.00001176044,0.00008658684,0.00008669055,0.0004344197,0.00006886423,0.0002438259,0.0003120967,0.0002745799,0.00006773911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002399715,"about_ca_system_score_gemma":0.00001470154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004316531,"about_ca_topic_score_gemma":0.00002049647,"domain_scores_codex":[0.9988497,0.0000684341,0.0002070076,0.0002857153,0.0001996491,0.0003894505],"domain_scores_gemma":[0.9989552,0.0001668707,0.0000630568,0.0006828175,0.00005373131,0.00007827573],"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.00000298142,0.00002068159,0.00004633899,0.000001882479,0.00001132011,0.000003373424,0.0001142577,0.01515206,0.000001811396,0.03548747,0.01245834,0.9366995],"study_design_scores_gemma":[0.0001360499,0.00001559754,0.0002585528,0.000015732,0.000002210811,0.000008358017,0.000002389778,0.7494978,0.00000770266,0.009872324,0.2400843,0.00009892798],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001373384,0.001612914,0.9873024,0.003770629,0.0004615662,0.0002049558,9.493414e-7,0.000286409,0.006222842],"genre_scores_gemma":[0.1431253,0.0008117087,0.8473529,0.003106607,0.002463907,0.00006368518,0.000009689358,0.00002924977,0.003036905],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9366006,"threshold_uncertainty_score":0.3670341,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01131194124672325,"score_gpt":0.2260950382719837,"score_spread":0.2147830970252605,"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."}}