{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00164497,0.0009817933,0.0009278542,0.001444781,0.0008736099,0.001499302,0.00189296,0.001508376,0.005880364],"category_scores_gemma":[0.005419032,0.0005444994,0.00115018,0.001141452,0.001108117,0.003836806,0.001646106,0.00180203,0.001238957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001364645,"about_ca_system_score_gemma":0.002205145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00226692,"about_ca_topic_score_gemma":0.002321752,"domain_scores_codex":[0.9987856,0.0002593992,0.00009306206,0.0003317235,0.0003895665,0.0001406714],"domain_scores_gemma":[0.9984086,0.0007747045,0.0001365462,0.0002779137,0.0003194587,0.00008283113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000351276,0.000342082,0.001187533,0.0003504597,0.00007328628,0.0001664844,0.000324814,0.1256306,0.01066634,0.1329231,0.01585114,0.7121329],"study_design_scores_gemma":[0.0002239645,0.0001582824,0.0004046414,0.00007425738,0.00003775122,0.0003334729,0.00008270542,0.7892478,0.01153111,0.1735697,0.02429329,0.00004311283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005900069,0.0001207878,0.9907698,0.0002281554,0.00005675919,0.0001218322,0.00008491093,0.0008039091,0.001913799],"genre_scores_gemma":[0.047095,0.00009540952,0.9501872,0.0000915527,0.00005642959,0.000157229,0.0002773009,0.0001786589,0.001861241],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005880364,"threshold_uncertainty_score":0.01967174,"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."}}