{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2UDHCBFQUAD25G2CMVNJCDCH7P","short_pith_number":"pith:2UDHCBFQ","schema_version":"1.0","canonical_sha256":"d5067104b0a007ae9b42655a910c47fbd8a9413a1909540a5d58718979efb0f4","source":{"kind":"arxiv","id":"2605.27998","version":1},"attestation_state":"computed","paper":{"title":"Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ali Abbasi, Eli Friedman, Leana Golubchik, Marco Paolieri, Samir Khuller","submitted_at":"2026-05-27T05:41:29Z","abstract_excerpt":"Given a graph $G$ of $n$ nodes partitioned into facilities and customers, the $r$-edge interdiction covering problem (REIC) is to remove up to $r$ edges so as to maximize the total weight of customers disconnected from all facilities, which is called the covering objective function. While REIC is known to be NP-complete for general graphs, Fr\\\"ohlich and Ruzika show that the problem can be solved in polynomial time when $G$ is a tree, providing an $O(n^7 r)$-time algorithm. We give an efficient $O(nr^2)$-time dynamic programming algorithm for REIC on trees that is fixed-parameter linear in $n$"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.27998","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-27T05:41:29Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"393f3185045749f042a844b3f1be3625a06e574dfe4376aa4141f20d6417b092","abstract_canon_sha256":"7927130626abecd87a7e5559416c54ec01205ebcf89a7bbc84c0519d03eeb9a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:55.633445Z","signature_b64":"z3+KvehiaPmcef4TgyuzDzCENoQBwxRAIF6twrq+bISSOly/Sskt9jLhGXqmSSpE3qYu1jTVbNEErRD6Z1osCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5067104b0a007ae9b42655a910c47fbd8a9413a1909540a5d58718979efb0f4","last_reissued_at":"2026-05-28T01:04:55.632829Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:55.632829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ali Abbasi, Eli Friedman, Leana Golubchik, Marco Paolieri, Samir Khuller","submitted_at":"2026-05-27T05:41:29Z","abstract_excerpt":"Given a graph $G$ of $n$ nodes partitioned into facilities and customers, the $r$-edge interdiction covering problem (REIC) is to remove up to $r$ edges so as to maximize the total weight of customers disconnected from all facilities, which is called the covering objective function. While REIC is known to be NP-complete for general graphs, Fr\\\"ohlich and Ruzika show that the problem can be solved in polynomial time when $G$ is a tree, providing an $O(n^7 r)$-time algorithm. We give an efficient $O(nr^2)$-time dynamic programming algorithm for REIC on trees that is fixed-parameter linear in $n$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27998","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.27998/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.27998","created_at":"2026-05-28T01:04:55.632945+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.27998v1","created_at":"2026-05-28T01:04:55.632945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27998","created_at":"2026-05-28T01:04:55.632945+00:00"},{"alias_kind":"pith_short_12","alias_value":"2UDHCBFQUAD2","created_at":"2026-05-28T01:04:55.632945+00:00"},{"alias_kind":"pith_short_16","alias_value":"2UDHCBFQUAD25G2C","created_at":"2026-05-28T01:04:55.632945+00:00"},{"alias_kind":"pith_short_8","alias_value":"2UDHCBFQ","created_at":"2026-05-28T01:04:55.632945+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2UDHCBFQUAD25G2CMVNJCDCH7P","json":"https://pith.science/pith/2UDHCBFQUAD25G2CMVNJCDCH7P.json","graph_json":"https://pith.science/api/pith-number/2UDHCBFQUAD25G2CMVNJCDCH7P/graph.json","events_json":"https://pith.science/api/pith-number/2UDHCBFQUAD25G2CMVNJCDCH7P/events.json","paper":"https://pith.science/paper/2UDHCBFQ"},"agent_actions":{"view_html":"https://pith.science/pith/2UDHCBFQUAD25G2CMVNJCDCH7P","download_json":"https://pith.science/pith/2UDHCBFQUAD25G2CMVNJCDCH7P.json","view_paper":"https://pith.science/paper/2UDHCBFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.27998&json=true","fetch_graph":"https://pith.science/api/pith-number/2UDHCBFQUAD25G2CMVNJCDCH7P/graph.json","fetch_events":"https://pith.science/api/pith-number/2UDHCBFQUAD25G2CMVNJCDCH7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2UDHCBFQUAD25G2CMVNJCDCH7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2UDHCBFQUAD25G2CMVNJCDCH7P/action/storage_attestation","attest_author":"https://pith.science/pith/2UDHCBFQUAD25G2CMVNJCDCH7P/action/author_attestation","sign_citation":"https://pith.science/pith/2UDHCBFQUAD25G2CMVNJCDCH7P/action/citation_signature","submit_replication":"https://pith.science/pith/2UDHCBFQUAD25G2CMVNJCDCH7P/action/replication_record"}},"created_at":"2026-05-28T01:04:55.632945+00:00","updated_at":"2026-05-28T01:04:55.632945+00:00"}