{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001067085,0.0008371972,0.001171732,0.0006707966,0.0008565061,0.002594043,0.002541308,0.001587749,0.007628762],"category_scores_gemma":[0.00522842,0.0005969995,0.001265111,0.001054313,0.00234125,0.005557618,0.002076104,0.003267786,0.0005730825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001291824,"about_ca_system_score_gemma":0.001145508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002196545,"about_ca_topic_score_gemma":0.001312661,"domain_scores_codex":[0.9986179,0.0003399364,0.00007614142,0.0003659012,0.0002408932,0.0003591914],"domain_scores_gemma":[0.9950706,0.003260889,0.0004690683,0.000619721,0.0001981952,0.0003815349],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001153283,0.0005121422,0.002759836,0.00151007,0.0002157212,0.0009856212,0.0006415912,0.4461354,0.01436525,0.3812875,0.04591181,0.1045217],"study_design_scores_gemma":[0.0002158191,0.0001449646,0.001200801,0.0001065644,0.00008535312,0.00120197,0.0002894872,0.3933249,0.009879419,0.5747261,0.01876765,0.00005697229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3013542,0.002759532,0.5998629,0.01062834,0.0002953183,0.0003359346,0.001941589,0.002136149,0.08068599],"genre_scores_gemma":[0.8916697,0.001077068,0.09068141,0.0008117242,0.0002681032,0.0002153736,0.001685351,0.000400199,0.01319119],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007628762,"threshold_uncertainty_score":0.0255208,"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."}}