{"id":"W4243384718","doi":"10.1002/net.20188","title":"The maximum residual flow problem:<i>NP</i>‐hardness with two‐arc destruction","year":2007,"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":"Arc (geometry); Residual; Mathematics; Flow (mathematics); Combinatorics; Maximum flow problem; Polynomial; Arc routing; Flow network; Computer science; Geometry; Algorithm; Mathematical analysis; Routing (electronic design automation); Computer network","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.001007503,0.0001744162,0.0001315276,0.00005906104,0.000741531,0.0003411191,0.0009480384,0.00007436697,0.00000630486],"category_scores_gemma":[0.000006820946,0.0001172717,0.0000516978,0.0007321671,0.0001964901,0.0003169151,0.0002276213,0.0003942586,0.00001014505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000372869,"about_ca_system_score_gemma":0.00004575185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004572036,"about_ca_topic_score_gemma":0.0004909063,"domain_scores_codex":[0.9983075,0.00007261047,0.0002439274,0.0003878906,0.000393789,0.0005942755],"domain_scores_gemma":[0.9988258,0.0001929132,0.0001010805,0.0006550674,0.0001107343,0.0001143695],"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.0000917416,0.00004874911,0.001228971,0.000007284559,0.00004202499,0.00005710301,0.0003096776,0.02403957,0.00001245426,0.08368535,0.004546423,0.8859307],"study_design_scores_gemma":[0.001906505,0.0005080273,0.009952582,0.0001165327,0.00003375586,0.0006799126,0.0001382189,0.6984896,0.0003044225,0.1963016,0.09065511,0.0009137458],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00375549,0.000295453,0.9891498,0.0006531931,0.001328287,0.0002266296,7.437856e-7,0.0002478821,0.004342508],"genre_scores_gemma":[0.4637488,0.0001260372,0.5320243,0.0009065083,0.002444582,0.00004973944,0.00001136064,0.00004740589,0.0006413599],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8850169,"threshold_uncertainty_score":0.5703332,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01091170873174418,"score_gpt":0.229364135313781,"score_spread":0.2184524265820368,"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."}}