{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5NPWL2W3GIRADXDJN632HK4DUJ","short_pith_number":"pith:5NPWL2W3","canonical_record":{"source":{"id":"1508.01448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-06T16:11:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b89277f7ba8713ce86df520039c07b2e713b54cc279023dee2bb2e6a8c3bec87","abstract_canon_sha256":"a014348b0050173d9fe3620c2947b6446b898b5a9a37976506b28a34c75c0582"},"schema_version":"1.0"},"canonical_sha256":"eb5f65eadb322201dc696fb7a3ab83a2509f253bbaceb0c77206aea688c41d27","source":{"kind":"arxiv","id":"1508.01448","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01448","created_at":"2026-05-18T01:35:42Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01448v1","created_at":"2026-05-18T01:35:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01448","created_at":"2026-05-18T01:35:42Z"},{"alias_kind":"pith_short_12","alias_value":"5NPWL2W3GIRA","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5NPWL2W3GIRADXDJ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5NPWL2W3","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5NPWL2W3GIRADXDJN632HK4DUJ","target":"record","payload":{"canonical_record":{"source":{"id":"1508.01448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-06T16:11:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b89277f7ba8713ce86df520039c07b2e713b54cc279023dee2bb2e6a8c3bec87","abstract_canon_sha256":"a014348b0050173d9fe3620c2947b6446b898b5a9a37976506b28a34c75c0582"},"schema_version":"1.0"},"canonical_sha256":"eb5f65eadb322201dc696fb7a3ab83a2509f253bbaceb0c77206aea688c41d27","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:42.576145Z","signature_b64":"91T0uul24ljWMr1cQkC2qWG4xgoaUB1RTHtIqPrQx5LzjsIwQnEDpGZmQ3S5xv/PmzVFbWmjqyaCX8Z3dJscAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb5f65eadb322201dc696fb7a3ab83a2509f253bbaceb0c77206aea688c41d27","last_reissued_at":"2026-05-18T01:35:42.575639Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:42.575639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.01448","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-18T01:35:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oF74WoKnndo7vejzVwTL/hFwGkDUGq9mM3l6G/OeMnZ+DSi5yqMuPYZwJu73kUfjEy+CVxBf/zEj4QX/qaDpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:28:58.275406Z"},"content_sha256":"c8c3023d414a267f7478f77b1bfe7e41ce8a8cd884fdc83dd210cd1344dc1349","schema_version":"1.0","event_id":"sha256:c8c3023d414a267f7478f77b1bfe7e41ce8a8cd884fdc83dd210cd1344dc1349"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5NPWL2W3GIRADXDJN632HK4DUJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An O(1)-Approximation for Minimum Spanning Tree Interdiction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Rico Zenklusen","submitted_at":"2015-08-06T16:11:24Z","abstract_excerpt":"Network interdiction problems are a natural way to study the sensitivity of a network optimization problem with respect to the removal of a limited set of edges or vertices. One of the oldest and best-studied interdiction problems is minimum spanning tree (MST) interdiction. Here, an undirected multigraph with nonnegative edge weights and positive interdiction costs on its edges is given, together with a positive budget B. The goal is to find a subset of edges R, whose total interdiction cost does not exceed B, such that removing R leads to a graph where the weight of an MST is as large as pos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01448","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-18T01:35:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lb0uWvPSLNUD2Urv976QTMeXjs7eVXHnNmtW+NrUbXrAQ0RUB83Xq8RvgvwLRmF9brmaKXjW0kswc+9vAQW/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:28:58.276222Z"},"content_sha256":"0c4cffdf2110da4eb45203799e99ddea18126a06656332c91c2711cae3ed209c","schema_version":"1.0","event_id":"sha256:0c4cffdf2110da4eb45203799e99ddea18126a06656332c91c2711cae3ed209c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5NPWL2W3GIRADXDJN632HK4DUJ/bundle.json","state_url":"https://pith.science/pith/5NPWL2W3GIRADXDJN632HK4DUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5NPWL2W3GIRADXDJN632HK4DUJ/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-05-31T09:28:58Z","links":{"resolver":"https://pith.science/pith/5NPWL2W3GIRADXDJN632HK4DUJ","bundle":"https://pith.science/pith/5NPWL2W3GIRADXDJN632HK4DUJ/bundle.json","state":"https://pith.science/pith/5NPWL2W3GIRADXDJN632HK4DUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5NPWL2W3GIRADXDJN632HK4DUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5NPWL2W3GIRADXDJN632HK4DUJ","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":"a014348b0050173d9fe3620c2947b6446b898b5a9a37976506b28a34c75c0582","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-06T16:11:24Z","title_canon_sha256":"b89277f7ba8713ce86df520039c07b2e713b54cc279023dee2bb2e6a8c3bec87"},"schema_version":"1.0","source":{"id":"1508.01448","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01448","created_at":"2026-05-18T01:35:42Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01448v1","created_at":"2026-05-18T01:35:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01448","created_at":"2026-05-18T01:35:42Z"},{"alias_kind":"pith_short_12","alias_value":"5NPWL2W3GIRA","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5NPWL2W3GIRADXDJ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5NPWL2W3","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:0c4cffdf2110da4eb45203799e99ddea18126a06656332c91c2711cae3ed209c","target":"graph","created_at":"2026-05-18T01:35:42Z","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":"Network interdiction problems are a natural way to study the sensitivity of a network optimization problem with respect to the removal of a limited set of edges or vertices. One of the oldest and best-studied interdiction problems is minimum spanning tree (MST) interdiction. Here, an undirected multigraph with nonnegative edge weights and positive interdiction costs on its edges is given, together with a positive budget B. The goal is to find a subset of edges R, whose total interdiction cost does not exceed B, such that removing R leads to a graph where the weight of an MST is as large as pos","authors_text":"Rico Zenklusen","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-06T16:11:24Z","title":"An O(1)-Approximation for Minimum Spanning Tree Interdiction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01448","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:c8c3023d414a267f7478f77b1bfe7e41ce8a8cd884fdc83dd210cd1344dc1349","target":"record","created_at":"2026-05-18T01:35:42Z","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":"a014348b0050173d9fe3620c2947b6446b898b5a9a37976506b28a34c75c0582","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-06T16:11:24Z","title_canon_sha256":"b89277f7ba8713ce86df520039c07b2e713b54cc279023dee2bb2e6a8c3bec87"},"schema_version":"1.0","source":{"id":"1508.01448","kind":"arxiv","version":1}},"canonical_sha256":"eb5f65eadb322201dc696fb7a3ab83a2509f253bbaceb0c77206aea688c41d27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb5f65eadb322201dc696fb7a3ab83a2509f253bbaceb0c77206aea688c41d27","first_computed_at":"2026-05-18T01:35:42.575639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:42.575639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"91T0uul24ljWMr1cQkC2qWG4xgoaUB1RTHtIqPrQx5LzjsIwQnEDpGZmQ3S5xv/PmzVFbWmjqyaCX8Z3dJscAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:42.576145Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.01448","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8c3023d414a267f7478f77b1bfe7e41ce8a8cd884fdc83dd210cd1344dc1349","sha256:0c4cffdf2110da4eb45203799e99ddea18126a06656332c91c2711cae3ed209c"],"state_sha256":"fdedd93576054ee9fe194537a4ba0bccebebca762e13c0f969373f74493e135d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n//Kfx3aLELscCumiIpMmAAXzr4gMspavatRjnsmfN+PgLIx7rgQMeHmr8ULlGYFVFeHWMDUZ3Lfvaa7ZT6sAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:28:58.280584Z","bundle_sha256":"2d6c414aca2e5e93c64f84ffd06aea523342100167394015a1d78d1b863b1a7f"}}