{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BBBB6CCCQPJ45YNNHNYPPOSW5U","short_pith_number":"pith:BBBB6CCC","canonical_record":{"source":{"id":"1804.01366","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-04T12:27:48Z","cross_cats_sorted":[],"title_canon_sha256":"1d450891be645e5e07ac489f5f85a12c91dd1c783c855cc841236ffd0188fe6c","abstract_canon_sha256":"9c354b0feab9bb4e8f9b5f2a655f02a4febbf3e30f8676a111fa1f91a0419465"},"schema_version":"1.0"},"canonical_sha256":"08421f084283d3cee1ad3b70f7ba56ed31e0589544626ab2eb65cb596c8ec7d7","source":{"kind":"arxiv","id":"1804.01366","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01366","created_at":"2026-05-18T00:02:35Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01366v2","created_at":"2026-05-18T00:02:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01366","created_at":"2026-05-18T00:02:35Z"},{"alias_kind":"pith_short_12","alias_value":"BBBB6CCCQPJ4","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BBBB6CCCQPJ45YNN","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BBBB6CCC","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BBBB6CCCQPJ45YNNHNYPPOSW5U","target":"record","payload":{"canonical_record":{"source":{"id":"1804.01366","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-04T12:27:48Z","cross_cats_sorted":[],"title_canon_sha256":"1d450891be645e5e07ac489f5f85a12c91dd1c783c855cc841236ffd0188fe6c","abstract_canon_sha256":"9c354b0feab9bb4e8f9b5f2a655f02a4febbf3e30f8676a111fa1f91a0419465"},"schema_version":"1.0"},"canonical_sha256":"08421f084283d3cee1ad3b70f7ba56ed31e0589544626ab2eb65cb596c8ec7d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:35.294462Z","signature_b64":"yCTdtIPIxGpOEMFDa/oTTgpNtef5GNzDC8F3xg2OThR+3PnHeKurnHUoHQeB1f/86O3QQHUxtoe3PUrzXEz1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08421f084283d3cee1ad3b70f7ba56ed31e0589544626ab2eb65cb596c8ec7d7","last_reissued_at":"2026-05-18T00:02:35.293815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:35.293815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.01366","source_version":2,"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:02:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"08F2bV1TB+1NLxDjiiQGuIUyaLoPKXuUzw+93qzEx+7QWejObSTYArkkPJs4/lEa3Dz1K1JbMfmWnLZ+chraCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:46:16.033885Z"},"content_sha256":"a772f8aa6eadf5aa2b7cc4f5e7a028ffe2ee14cd715e523f1c791496135de177","schema_version":"1.0","event_id":"sha256:a772f8aa6eadf5aa2b7cc4f5e7a028ffe2ee14cd715e523f1c791496135de177"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BBBB6CCCQPJ45YNNHNYPPOSW5U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Losing Treewidth by Separating Subsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Euiwoong Lee, Jason Li, Micha{\\l} W{\\l}odarczyk, Pasin Manurangsi","submitted_at":"2018-04-04T12:27:48Z","abstract_excerpt":"We study the problem of deleting the smallest set $S$ of vertices (resp. edges) from a given graph $G$ such that the induced subgraph (resp. subgraph) $G \\setminus S$ belongs to some class $\\mathcal{H}$. We consider the case where graphs in $\\mathcal{H}$ have treewidth bounded by $t$, and give a general framework to obtain approximation algorithms for both vertex and edge-deletion settings from approximation algorithms for certain natural graph partitioning problems called $k$-Subset Vertex Separator and $k$-Subset Edge Separator, respectively.\n  For the vertex deletion setting, our framework "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01366","kind":"arxiv","version":2},"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:02:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x6NE28m/ixwN5wBjueK4ClFuJZT2DBxEnDfs2047NA2+6pbvqtkmLQCwgvLchAXNVHfQwO+T2enoqi4enzz8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:46:16.034231Z"},"content_sha256":"00dadc340831f37f21200c82dde01479918d846a6fd235549ed37e70fb9c904f","schema_version":"1.0","event_id":"sha256:00dadc340831f37f21200c82dde01479918d846a6fd235549ed37e70fb9c904f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BBBB6CCCQPJ45YNNHNYPPOSW5U/bundle.json","state_url":"https://pith.science/pith/BBBB6CCCQPJ45YNNHNYPPOSW5U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BBBB6CCCQPJ45YNNHNYPPOSW5U/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-02T15:46:16Z","links":{"resolver":"https://pith.science/pith/BBBB6CCCQPJ45YNNHNYPPOSW5U","bundle":"https://pith.science/pith/BBBB6CCCQPJ45YNNHNYPPOSW5U/bundle.json","state":"https://pith.science/pith/BBBB6CCCQPJ45YNNHNYPPOSW5U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BBBB6CCCQPJ45YNNHNYPPOSW5U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BBBB6CCCQPJ45YNNHNYPPOSW5U","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":"9c354b0feab9bb4e8f9b5f2a655f02a4febbf3e30f8676a111fa1f91a0419465","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-04T12:27:48Z","title_canon_sha256":"1d450891be645e5e07ac489f5f85a12c91dd1c783c855cc841236ffd0188fe6c"},"schema_version":"1.0","source":{"id":"1804.01366","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01366","created_at":"2026-05-18T00:02:35Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01366v2","created_at":"2026-05-18T00:02:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01366","created_at":"2026-05-18T00:02:35Z"},{"alias_kind":"pith_short_12","alias_value":"BBBB6CCCQPJ4","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BBBB6CCCQPJ45YNN","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BBBB6CCC","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:00dadc340831f37f21200c82dde01479918d846a6fd235549ed37e70fb9c904f","target":"graph","created_at":"2026-05-18T00:02:35Z","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 study the problem of deleting the smallest set $S$ of vertices (resp. edges) from a given graph $G$ such that the induced subgraph (resp. subgraph) $G \\setminus S$ belongs to some class $\\mathcal{H}$. We consider the case where graphs in $\\mathcal{H}$ have treewidth bounded by $t$, and give a general framework to obtain approximation algorithms for both vertex and edge-deletion settings from approximation algorithms for certain natural graph partitioning problems called $k$-Subset Vertex Separator and $k$-Subset Edge Separator, respectively.\n  For the vertex deletion setting, our framework ","authors_text":"Anupam Gupta, Euiwoong Lee, Jason Li, Micha{\\l} W{\\l}odarczyk, Pasin Manurangsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-04T12:27:48Z","title":"Losing Treewidth by Separating Subsets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01366","kind":"arxiv","version":2},"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:a772f8aa6eadf5aa2b7cc4f5e7a028ffe2ee14cd715e523f1c791496135de177","target":"record","created_at":"2026-05-18T00:02:35Z","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":"9c354b0feab9bb4e8f9b5f2a655f02a4febbf3e30f8676a111fa1f91a0419465","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-04T12:27:48Z","title_canon_sha256":"1d450891be645e5e07ac489f5f85a12c91dd1c783c855cc841236ffd0188fe6c"},"schema_version":"1.0","source":{"id":"1804.01366","kind":"arxiv","version":2}},"canonical_sha256":"08421f084283d3cee1ad3b70f7ba56ed31e0589544626ab2eb65cb596c8ec7d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08421f084283d3cee1ad3b70f7ba56ed31e0589544626ab2eb65cb596c8ec7d7","first_computed_at":"2026-05-18T00:02:35.293815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:35.293815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yCTdtIPIxGpOEMFDa/oTTgpNtef5GNzDC8F3xg2OThR+3PnHeKurnHUoHQeB1f/86O3QQHUxtoe3PUrzXEz1CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:35.294462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.01366","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a772f8aa6eadf5aa2b7cc4f5e7a028ffe2ee14cd715e523f1c791496135de177","sha256:00dadc340831f37f21200c82dde01479918d846a6fd235549ed37e70fb9c904f"],"state_sha256":"9cd82691049bc1448594835e067aa73932c6f73c71369bdfb9aca6f6e1b27bb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0P59px6B6sQSF4zYV2k14+kZRkb7AZHjXDWPZoumb5Wl/39/Q6FdCTY8mnt3zsmvjgZjUnTLQ0sHKXGstzbGAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:46:16.036263Z","bundle_sha256":"ee8a331d5e8ef283afcce8c5a5d30ea49519d8de66aed4f9d9b61d79be5c7f44"}}