{"id":"W4413311364","doi":"10.1007/s10107-025-02273-6","title":"Interdiction of minimum spanning trees and other matroid bases","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Spanning tree; Mathematics; Interdiction; Matroid partitioning; Minimum spanning tree; Combinatorics; Minimum degree spanning tree; Numerical analysis; Graphic matroid; Geography; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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.0001538094,0.00009135193,0.0002010837,0.0001041184,0.00003829592,0.00003122221,0.00006063394,0.00004945396,0.00005840072],"category_scores_gemma":[0.00007734776,0.00007590801,0.00006044055,0.0001876519,0.00008552324,0.00005915236,0.00002614026,0.00008447122,0.000003065197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001608127,"about_ca_system_score_gemma":0.000004169346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000487974,"about_ca_topic_score_gemma":0.000005128795,"domain_scores_codex":[0.9994216,0.00001459957,0.0002423284,0.0001002416,0.00008155799,0.000139686],"domain_scores_gemma":[0.9997085,0.0001032266,0.00002133915,0.000123058,0.00001663993,0.00002722796],"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.00003656699,0.0001970597,0.01350371,0.004867326,0.0005337676,0.000005126512,0.002933428,0.01199973,0.0209379,0.0492713,0.0004007157,0.8953134],"study_design_scores_gemma":[0.0006949774,0.0001530044,0.00219622,0.001518452,0.0004746997,0.00002202195,0.004609617,0.8687542,0.04408007,0.06680124,0.01011516,0.0005802923],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4532533,0.0003007175,0.5390239,0.00006665667,0.0000548581,0.0001664891,0.000001820489,0.0001792851,0.006952967],"genre_scores_gemma":[0.983495,0.000002741534,0.01639431,0.00001732637,0.00001648404,0.00001304496,6.336306e-7,0.000008167842,0.00005230761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8947331,"threshold_uncertainty_score":0.3095439,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006941350044310071,"score_gpt":0.248395968773904,"score_spread":0.241454618729594,"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."}}