{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2UDHCBFQUAD25G2CMVNJCDCH7P","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7927130626abecd87a7e5559416c54ec01205ebcf89a7bbc84c0519d03eeb9a3","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-27T05:41:29Z","title_canon_sha256":"393f3185045749f042a844b3f1be3625a06e574dfe4376aa4141f20d6417b092"},"schema_version":"1.0","source":{"id":"2605.27998","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.27998","created_at":"2026-05-28T01:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.27998v1","created_at":"2026-05-28T01:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27998","created_at":"2026-05-28T01:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"2UDHCBFQUAD2","created_at":"2026-05-28T01:04:55Z"},{"alias_kind":"pith_short_16","alias_value":"2UDHCBFQUAD25G2C","created_at":"2026-05-28T01:04:55Z"},{"alias_kind":"pith_short_8","alias_value":"2UDHCBFQ","created_at":"2026-05-28T01:04:55Z"}],"graph_snapshots":[{"event_id":"sha256:e775e27d69511e4eb5468cff684a249f3c1503c6b54fd0993df7a2d93081a032","target":"graph","created_at":"2026-05-28T01:04:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.27998/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$","authors_text":"Ali Abbasi, Eli Friedman, Leana Golubchik, Marco Paolieri, Samir Khuller","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-27T05:41:29Z","title":"Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27998","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:78469e2f86fa44cc6879700e85ba56b3ded8d4eaa2c9a2c621936c0d1aa7e021","target":"record","created_at":"2026-05-28T01:04:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7927130626abecd87a7e5559416c54ec01205ebcf89a7bbc84c0519d03eeb9a3","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-27T05:41:29Z","title_canon_sha256":"393f3185045749f042a844b3f1be3625a06e574dfe4376aa4141f20d6417b092"},"schema_version":"1.0","source":{"id":"2605.27998","kind":"arxiv","version":1}},"canonical_sha256":"d5067104b0a007ae9b42655a910c47fbd8a9413a1909540a5d58718979efb0f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5067104b0a007ae9b42655a910c47fbd8a9413a1909540a5d58718979efb0f4","first_computed_at":"2026-05-28T01:04:55.632829Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:04:55.632829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z3+KvehiaPmcef4TgyuzDzCENoQBwxRAIF6twrq+bISSOly/Sskt9jLhGXqmSSpE3qYu1jTVbNEErRD6Z1osCA==","signature_status":"signed_v1","signed_at":"2026-05-28T01:04:55.633445Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.27998","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78469e2f86fa44cc6879700e85ba56b3ded8d4eaa2c9a2c621936c0d1aa7e021","sha256:e775e27d69511e4eb5468cff684a249f3c1503c6b54fd0993df7a2d93081a032"],"state_sha256":"705c3932ed19b7cec7b225537828aa4ba8a88473d296bd2750fdc9911b8d84db"}