{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZCBGLJHLV4NMYXVS6FW5NMIUT7","short_pith_number":"pith:ZCBGLJHL","canonical_record":{"source":{"id":"1706.00034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-31T18:13:16Z","cross_cats_sorted":[],"title_canon_sha256":"1ccd0be0c40aabf1d377908b0a8aa18c43403ad2967d676a51812a4286c82e38","abstract_canon_sha256":"4518f604e5bbcbe3e3015b4bd7f3b80e21315bf651c6238ed7ab4d9025414ca9"},"schema_version":"1.0"},"canonical_sha256":"c88265a4ebaf1acc5eb2f16dd6b1149ffd77a62ca0c069c2be0fbf8c02412f28","source":{"kind":"arxiv","id":"1706.00034","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00034","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00034v1","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00034","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"pith_short_12","alias_value":"ZCBGLJHLV4NM","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZCBGLJHLV4NMYXVS","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZCBGLJHL","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZCBGLJHLV4NMYXVS6FW5NMIUT7","target":"record","payload":{"canonical_record":{"source":{"id":"1706.00034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-31T18:13:16Z","cross_cats_sorted":[],"title_canon_sha256":"1ccd0be0c40aabf1d377908b0a8aa18c43403ad2967d676a51812a4286c82e38","abstract_canon_sha256":"4518f604e5bbcbe3e3015b4bd7f3b80e21315bf651c6238ed7ab4d9025414ca9"},"schema_version":"1.0"},"canonical_sha256":"c88265a4ebaf1acc5eb2f16dd6b1149ffd77a62ca0c069c2be0fbf8c02412f28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:15.285933Z","signature_b64":"xPhwZGAVc4HDrIlcMpgiLmga7bLFudMCULYSw25NjCsy+jRLE9QVUodatLr4ZSIDTCqn+b/WJf1SqzbAx6qCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c88265a4ebaf1acc5eb2f16dd6b1149ffd77a62ca0c069c2be0fbf8c02412f28","last_reissued_at":"2026-05-18T00:43:15.285301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:15.285301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.00034","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AaN0RnuHLWJw3jSNL3nDJ0TQFu9ZjlSRInQe55BR23IhSPMcDthlQ4KQxIBuwfyjW337YrOKoR28VMz1QHUiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:19:21.365531Z"},"content_sha256":"27829d206e89e38b95eafa4d550d8008528d64f902bc9d9cca62ee389bc46565","schema_version":"1.0","event_id":"sha256:27829d206e89e38b95eafa4d550d8008528d64f902bc9d9cca62ee389bc46565"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZCBGLJHLV4NMYXVS6FW5NMIUT7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Algorithms for MST and Metric-TSP Interdiction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'e Linhares, Chaitanya Swamy","submitted_at":"2017-05-31T18:13:16Z","abstract_excerpt":"We consider the {\\em MST-interdiction} problem: given a multigraph $G = (V, E)$, edge weights $\\{w_e\\geq 0\\}_{e \\in E}$, interdiction costs $\\{c_e\\geq 0\\}_{e \\in E}$, and an interdiction budget $B\\geq 0$, the goal is to remove a set $R\\subseteq E$ of edges of total interdiction cost at most $B$ so as to maximize the $w$-weight of an MST of $G-R:=(V,E\\setminus R)$.\n  Our main result is a $4$-approximation algorithm for this problem. This improves upon the previous-best $14$-approximation~\\cite{Zenklusen15}. Notably, our analysis is also significantly simpler and cleaner than the one in~\\cite{Ze"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00034","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2MBT9cdVKdIgqZfKhc4USSyJrvSb/7rXvyNIpMNuurqIKXYlP8Pc6McY0cnjz0Nf6oa3Tjt8ZEUfSSgP821VDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:19:21.366221Z"},"content_sha256":"46f54bcc4396a2469ed1e35b6a53663a5a50d0715d39fd9581bde93ecaea0125","schema_version":"1.0","event_id":"sha256:46f54bcc4396a2469ed1e35b6a53663a5a50d0715d39fd9581bde93ecaea0125"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZCBGLJHLV4NMYXVS6FW5NMIUT7/bundle.json","state_url":"https://pith.science/pith/ZCBGLJHLV4NMYXVS6FW5NMIUT7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZCBGLJHLV4NMYXVS6FW5NMIUT7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T17:19:21Z","links":{"resolver":"https://pith.science/pith/ZCBGLJHLV4NMYXVS6FW5NMIUT7","bundle":"https://pith.science/pith/ZCBGLJHLV4NMYXVS6FW5NMIUT7/bundle.json","state":"https://pith.science/pith/ZCBGLJHLV4NMYXVS6FW5NMIUT7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZCBGLJHLV4NMYXVS6FW5NMIUT7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZCBGLJHLV4NMYXVS6FW5NMIUT7","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":"4518f604e5bbcbe3e3015b4bd7f3b80e21315bf651c6238ed7ab4d9025414ca9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-31T18:13:16Z","title_canon_sha256":"1ccd0be0c40aabf1d377908b0a8aa18c43403ad2967d676a51812a4286c82e38"},"schema_version":"1.0","source":{"id":"1706.00034","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00034","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00034v1","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00034","created_at":"2026-05-18T00:43:15Z"},{"alias_kind":"pith_short_12","alias_value":"ZCBGLJHLV4NM","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZCBGLJHLV4NMYXVS","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZCBGLJHL","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:46f54bcc4396a2469ed1e35b6a53663a5a50d0715d39fd9581bde93ecaea0125","target":"graph","created_at":"2026-05-18T00:43:15Z","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"},"paper":{"abstract_excerpt":"We consider the {\\em MST-interdiction} problem: given a multigraph $G = (V, E)$, edge weights $\\{w_e\\geq 0\\}_{e \\in E}$, interdiction costs $\\{c_e\\geq 0\\}_{e \\in E}$, and an interdiction budget $B\\geq 0$, the goal is to remove a set $R\\subseteq E$ of edges of total interdiction cost at most $B$ so as to maximize the $w$-weight of an MST of $G-R:=(V,E\\setminus R)$.\n  Our main result is a $4$-approximation algorithm for this problem. This improves upon the previous-best $14$-approximation~\\cite{Zenklusen15}. Notably, our analysis is also significantly simpler and cleaner than the one in~\\cite{Ze","authors_text":"Andr\\'e Linhares, Chaitanya Swamy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-31T18:13:16Z","title":"Improved Algorithms for MST and Metric-TSP Interdiction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00034","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:27829d206e89e38b95eafa4d550d8008528d64f902bc9d9cca62ee389bc46565","target":"record","created_at":"2026-05-18T00:43:15Z","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":"4518f604e5bbcbe3e3015b4bd7f3b80e21315bf651c6238ed7ab4d9025414ca9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-31T18:13:16Z","title_canon_sha256":"1ccd0be0c40aabf1d377908b0a8aa18c43403ad2967d676a51812a4286c82e38"},"schema_version":"1.0","source":{"id":"1706.00034","kind":"arxiv","version":1}},"canonical_sha256":"c88265a4ebaf1acc5eb2f16dd6b1149ffd77a62ca0c069c2be0fbf8c02412f28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c88265a4ebaf1acc5eb2f16dd6b1149ffd77a62ca0c069c2be0fbf8c02412f28","first_computed_at":"2026-05-18T00:43:15.285301Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:15.285301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xPhwZGAVc4HDrIlcMpgiLmga7bLFudMCULYSw25NjCsy+jRLE9QVUodatLr4ZSIDTCqn+b/WJf1SqzbAx6qCBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:15.285933Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.00034","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27829d206e89e38b95eafa4d550d8008528d64f902bc9d9cca62ee389bc46565","sha256:46f54bcc4396a2469ed1e35b6a53663a5a50d0715d39fd9581bde93ecaea0125"],"state_sha256":"5395bd49a198389e3fc8ae8d17db49dfa6d19e7a15e4b3efca8e433bc7f95fb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9TwpaMUiGOquZw8k/suwTXRSCIPVLVuW7OmBgfNbaaSVBHkXmJigtIVNu5EWgxkXWOE/QPkrKoAhOLyeywbrBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T17:19:21.370119Z","bundle_sha256":"bbfc521dafd01a52fa09baca522966d773e949954767854c099e8104821a56e9"}}