{"id":"W2594925297","doi":"10.1016/j.cor.2017.02.019","title":"A strongly polynomial Contraction-Expansion algorithm for network flow problems","year":2017,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Contraction (grammar); Algorithm; Flow network; Computer science; Maximum flow problem; Flow (mathematics); Polynomial; Mathematics; Mathematical optimization; Geometry; Mathematical analysis","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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001642562,0.0001975854,0.000257789,0.0002348222,0.00597832,0.003279924,0.002636415,0.0001149911,0.00001831344],"category_scores_gemma":[0.0001375352,0.0001943378,0.0001511698,0.000327403,0.0003386043,0.001427538,0.0009728722,0.0005199822,0.00005146432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001134233,"about_ca_system_score_gemma":0.0003688892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000324622,"about_ca_topic_score_gemma":0.0003107666,"domain_scores_codex":[0.9972328,0.0002139259,0.0003526091,0.0007194705,0.0006276133,0.000853605],"domain_scores_gemma":[0.9969212,0.0004005974,0.0000590971,0.001603354,0.0007887787,0.0002269042],"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.00001180108,0.0001918234,0.00003949705,0.00001422212,0.0000561483,0.000009861919,0.0004079239,0.08368388,0.0001409769,0.02294942,0.0287777,0.8637167],"study_design_scores_gemma":[0.0008775616,0.0002743761,0.0008771293,0.00005654548,0.00000383909,0.00001499618,0.00001968462,0.9672554,0.0001047493,0.002198774,0.02809923,0.0002176958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009327611,0.0001372397,0.9920244,0.002978633,0.002162643,0.001183974,0.00002637729,0.0001395232,0.0004144853],"genre_scores_gemma":[0.06803185,0.00005116913,0.928362,0.0001213404,0.002073782,0.00040907,0.00004732047,0.00002581445,0.0008776478],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8835716,"threshold_uncertainty_score":0.9977548,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09211569102058015,"score_gpt":0.3732049175096355,"score_spread":0.2810892264890554,"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."}}