{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JUZOU6OFH4AKPU7CW2CJBF4HR5","short_pith_number":"pith:JUZOU6OF","schema_version":"1.0","canonical_sha256":"4d32ea79c53f00a7d3e2b6849097878f73249570195e37f57d662198780a63cf","source":{"kind":"arxiv","id":"1707.04908","version":1},"attestation_state":"computed","paper":{"title":"Polylogarithmic Approximation Algorithms for Weighted-$\\mathcal{F}$-Deletion Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Akanksha Agrawal, Daniel Lokshtanov, Meirav Zehavi, Pranabendu Misra, Saket Saurabh","submitted_at":"2017-07-16T16:49:03Z","abstract_excerpt":"For a family of graphs $\\cal F$, the canonical Weighted $\\cal F$ Vertex Deletion problem is defined as follows: given an $n$-vertex undirected graph $G$ and a weight function $w: V(G)\\rightarrow\\mathbb{R}$, find a minimum weight subset $S\\subseteq V(G)$ such that $G-S$ belongs to $\\cal F$. We devise a recursive scheme to obtain $O(\\log^{O(1)}n)$-approximation algorithms for such problems, building upon the classic technique of finding balanced separators in a graph. Roughly speaking, our scheme applies to problems where an optimum solution $S$, together with a well-structured set $X$, form a b"},"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":"1707.04908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-16T16:49:03Z","cross_cats_sorted":[],"title_canon_sha256":"f69d89431e90dab54c582d12e09a597584cfb9f49d9cd6c2f25514ccb842201b","abstract_canon_sha256":"fd3a6487809ac7742a3fcf3df521acdbd8af9ad5d61ccdf280274f35def8b5ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:11.827472Z","signature_b64":"I9VBhQv6Fpgq9xrnzm2jBhCYpIIsZ0JxFdCcdq5lRPW9cqx8ngo0oJ8/BkZRv0jsT8NxL3/mNfoOM8OXcnQjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d32ea79c53f00a7d3e2b6849097878f73249570195e37f57d662198780a63cf","last_reissued_at":"2026-05-18T00:40:11.826965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:11.826965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polylogarithmic Approximation Algorithms for Weighted-$\\mathcal{F}$-Deletion Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Akanksha Agrawal, Daniel Lokshtanov, Meirav Zehavi, Pranabendu Misra, Saket Saurabh","submitted_at":"2017-07-16T16:49:03Z","abstract_excerpt":"For a family of graphs $\\cal F$, the canonical Weighted $\\cal F$ Vertex Deletion problem is defined as follows: given an $n$-vertex undirected graph $G$ and a weight function $w: V(G)\\rightarrow\\mathbb{R}$, find a minimum weight subset $S\\subseteq V(G)$ such that $G-S$ belongs to $\\cal F$. We devise a recursive scheme to obtain $O(\\log^{O(1)}n)$-approximation algorithms for such problems, building upon the classic technique of finding balanced separators in a graph. Roughly speaking, our scheme applies to problems where an optimum solution $S$, together with a well-structured set $X$, form a b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04908","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.04908","created_at":"2026-05-18T00:40:11.827041+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04908v1","created_at":"2026-05-18T00:40:11.827041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04908","created_at":"2026-05-18T00:40:11.827041+00:00"},{"alias_kind":"pith_short_12","alias_value":"JUZOU6OFH4AK","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JUZOU6OFH4AKPU7C","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JUZOU6OF","created_at":"2026-05-18T12:31:24.725408+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/JUZOU6OFH4AKPU7CW2CJBF4HR5","json":"https://pith.science/pith/JUZOU6OFH4AKPU7CW2CJBF4HR5.json","graph_json":"https://pith.science/api/pith-number/JUZOU6OFH4AKPU7CW2CJBF4HR5/graph.json","events_json":"https://pith.science/api/pith-number/JUZOU6OFH4AKPU7CW2CJBF4HR5/events.json","paper":"https://pith.science/paper/JUZOU6OF"},"agent_actions":{"view_html":"https://pith.science/pith/JUZOU6OFH4AKPU7CW2CJBF4HR5","download_json":"https://pith.science/pith/JUZOU6OFH4AKPU7CW2CJBF4HR5.json","view_paper":"https://pith.science/paper/JUZOU6OF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04908&json=true","fetch_graph":"https://pith.science/api/pith-number/JUZOU6OFH4AKPU7CW2CJBF4HR5/graph.json","fetch_events":"https://pith.science/api/pith-number/JUZOU6OFH4AKPU7CW2CJBF4HR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JUZOU6OFH4AKPU7CW2CJBF4HR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JUZOU6OFH4AKPU7CW2CJBF4HR5/action/storage_attestation","attest_author":"https://pith.science/pith/JUZOU6OFH4AKPU7CW2CJBF4HR5/action/author_attestation","sign_citation":"https://pith.science/pith/JUZOU6OFH4AKPU7CW2CJBF4HR5/action/citation_signature","submit_replication":"https://pith.science/pith/JUZOU6OFH4AKPU7CW2CJBF4HR5/action/replication_record"}},"created_at":"2026-05-18T00:40:11.827041+00:00","updated_at":"2026-05-18T00:40:11.827041+00:00"}