{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BBBB6CCCQPJ45YNNHNYPPOSW5U","short_pith_number":"pith:BBBB6CCC","schema_version":"1.0","canonical_sha256":"08421f084283d3cee1ad3b70f7ba56ed31e0589544626ab2eb65cb596c8ec7d7","source":{"kind":"arxiv","id":"1804.01366","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.01366","created_at":"2026-05-18T00:02:35.293910+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.01366v2","created_at":"2026-05-18T00:02:35.293910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01366","created_at":"2026-05-18T00:02:35.293910+00:00"},{"alias_kind":"pith_short_12","alias_value":"BBBB6CCCQPJ4","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"BBBB6CCCQPJ45YNN","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"BBBB6CCC","created_at":"2026-05-18T12:32:13.499390+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/BBBB6CCCQPJ45YNNHNYPPOSW5U","json":"https://pith.science/pith/BBBB6CCCQPJ45YNNHNYPPOSW5U.json","graph_json":"https://pith.science/api/pith-number/BBBB6CCCQPJ45YNNHNYPPOSW5U/graph.json","events_json":"https://pith.science/api/pith-number/BBBB6CCCQPJ45YNNHNYPPOSW5U/events.json","paper":"https://pith.science/paper/BBBB6CCC"},"agent_actions":{"view_html":"https://pith.science/pith/BBBB6CCCQPJ45YNNHNYPPOSW5U","download_json":"https://pith.science/pith/BBBB6CCCQPJ45YNNHNYPPOSW5U.json","view_paper":"https://pith.science/paper/BBBB6CCC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.01366&json=true","fetch_graph":"https://pith.science/api/pith-number/BBBB6CCCQPJ45YNNHNYPPOSW5U/graph.json","fetch_events":"https://pith.science/api/pith-number/BBBB6CCCQPJ45YNNHNYPPOSW5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BBBB6CCCQPJ45YNNHNYPPOSW5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BBBB6CCCQPJ45YNNHNYPPOSW5U/action/storage_attestation","attest_author":"https://pith.science/pith/BBBB6CCCQPJ45YNNHNYPPOSW5U/action/author_attestation","sign_citation":"https://pith.science/pith/BBBB6CCCQPJ45YNNHNYPPOSW5U/action/citation_signature","submit_replication":"https://pith.science/pith/BBBB6CCCQPJ45YNNHNYPPOSW5U/action/replication_record"}},"created_at":"2026-05-18T00:02:35.293910+00:00","updated_at":"2026-05-18T00:02:35.293910+00:00"}