{"id":"W2169825170","doi":"10.1002/net.1012","title":"A new—old algorithm for minimum‐cut and maximum‐flow in closure graphs","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Mining Techniques and Economics","field":"Engineering","cited_by":95,"is_retracted":false,"has_abstract":true,"ca_institutions":"Regent College","funders":"","keywords":"Maximum flow problem; Minimum cut; Algorithm; Closure (psychology); Mathematics; Context (archaeology); Minimum-cost flow problem; Flow (mathematics); Maximum cut; Time complexity; Flow network; Graph; Computer science; Combinatorics","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.0001069185,0.0001205558,0.0001614481,0.00006258753,0.00002232701,0.00002991931,0.00008211939,0.0001646518,0.00003051024],"category_scores_gemma":[0.000002599663,0.0001349237,0.00004254322,0.00009539707,0.000009611253,0.0000599433,0.00001983599,0.0001384165,0.000001859345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002345114,"about_ca_system_score_gemma":0.000004534088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002405816,"about_ca_topic_score_gemma":0.0001110237,"domain_scores_codex":[0.9993838,0.000003789727,0.0001668191,0.0001484628,0.00002490841,0.0002722376],"domain_scores_gemma":[0.9997246,0.00003676542,0.00001667837,0.0001415846,0.00000634737,0.00007398692],"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.00001571692,0.000009635578,0.004434386,0.00001591934,0.0000243981,0.00001192476,0.0001401436,0.0562942,0.000004616892,0.0003854011,0.05352679,0.8851369],"study_design_scores_gemma":[0.000426216,0.00004189191,0.0006417339,0.00002720448,0.000006626743,0.00001451493,0.00001510303,0.9619123,0.00001096521,0.003458932,0.03328235,0.0001622038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1278562,0.001570954,0.8654341,0.00008824219,0.0005754642,0.0004343598,0.00001199134,0.0004817021,0.003547099],"genre_scores_gemma":[0.4295943,0.004843578,0.562503,0.0003278657,0.001235136,0.0001610476,0.00006085465,0.0001709905,0.001103224],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9056181,"threshold_uncertainty_score":0.5502028,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009186957762735095,"score_gpt":0.2030956731014378,"score_spread":0.1939087153387027,"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."}}