{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JUZOU6OFH4AKPU7CW2CJBF4HR5","short_pith_number":"pith:JUZOU6OF","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"},"canonical_sha256":"4d32ea79c53f00a7d3e2b6849097878f73249570195e37f57d662198780a63cf","source":{"kind":"arxiv","id":"1707.04908","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04908","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04908v1","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04908","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"JUZOU6OFH4AK","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JUZOU6OFH4AKPU7C","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JUZOU6OF","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JUZOU6OFH4AKPU7CW2CJBF4HR5","target":"record","payload":{"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"},"canonical_sha256":"4d32ea79c53f00a7d3e2b6849097878f73249570195e37f57d662198780a63cf","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"},"source_kind":"arxiv","source_id":"1707.04908","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:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nECJm4wTaciGsen/wQxx449X0qZ4SRPDPz2T92sW+X4BmYYNLUpuhf613z4Y3EQ1k5scRBDX2qcH0uJcu2H2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:09:31.577792Z"},"content_sha256":"b6a18ed8ff99e6c8545068904d0c445b2b584333084cdb8bb3fdf321521ef140","schema_version":"1.0","event_id":"sha256:b6a18ed8ff99e6c8545068904d0c445b2b584333084cdb8bb3fdf321521ef140"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JUZOU6OFH4AKPU7CW2CJBF4HR5","target":"graph","payload":{"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"},"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:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6gguByJma2h7xrnY1fHpFLTKZSRL+qUZrfiPQAg7Xs/M5IsTmPumHckXnUk4QUElA0Pp6zZdJ70nGP8rMyiqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:09:31.578156Z"},"content_sha256":"e274b8bf9608ea86bfa1cf0a49d51a21873500f0822e7560ebc6ce3f3ba9136a","schema_version":"1.0","event_id":"sha256:e274b8bf9608ea86bfa1cf0a49d51a21873500f0822e7560ebc6ce3f3ba9136a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JUZOU6OFH4AKPU7CW2CJBF4HR5/bundle.json","state_url":"https://pith.science/pith/JUZOU6OFH4AKPU7CW2CJBF4HR5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JUZOU6OFH4AKPU7CW2CJBF4HR5/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-31T20:09:31Z","links":{"resolver":"https://pith.science/pith/JUZOU6OFH4AKPU7CW2CJBF4HR5","bundle":"https://pith.science/pith/JUZOU6OFH4AKPU7CW2CJBF4HR5/bundle.json","state":"https://pith.science/pith/JUZOU6OFH4AKPU7CW2CJBF4HR5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JUZOU6OFH4AKPU7CW2CJBF4HR5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JUZOU6OFH4AKPU7CW2CJBF4HR5","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":"fd3a6487809ac7742a3fcf3df521acdbd8af9ad5d61ccdf280274f35def8b5ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-16T16:49:03Z","title_canon_sha256":"f69d89431e90dab54c582d12e09a597584cfb9f49d9cd6c2f25514ccb842201b"},"schema_version":"1.0","source":{"id":"1707.04908","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04908","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04908v1","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04908","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"JUZOU6OFH4AK","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JUZOU6OFH4AKPU7C","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JUZOU6OF","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:e274b8bf9608ea86bfa1cf0a49d51a21873500f0822e7560ebc6ce3f3ba9136a","target":"graph","created_at":"2026-05-18T00:40:11Z","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":"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","authors_text":"Akanksha Agrawal, Daniel Lokshtanov, Meirav Zehavi, Pranabendu Misra, Saket Saurabh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-16T16:49:03Z","title":"Polylogarithmic Approximation Algorithms for Weighted-$\\mathcal{F}$-Deletion Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04908","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:b6a18ed8ff99e6c8545068904d0c445b2b584333084cdb8bb3fdf321521ef140","target":"record","created_at":"2026-05-18T00:40:11Z","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":"fd3a6487809ac7742a3fcf3df521acdbd8af9ad5d61ccdf280274f35def8b5ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-16T16:49:03Z","title_canon_sha256":"f69d89431e90dab54c582d12e09a597584cfb9f49d9cd6c2f25514ccb842201b"},"schema_version":"1.0","source":{"id":"1707.04908","kind":"arxiv","version":1}},"canonical_sha256":"4d32ea79c53f00a7d3e2b6849097878f73249570195e37f57d662198780a63cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d32ea79c53f00a7d3e2b6849097878f73249570195e37f57d662198780a63cf","first_computed_at":"2026-05-18T00:40:11.826965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:11.826965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I9VBhQv6Fpgq9xrnzm2jBhCYpIIsZ0JxFdCcdq5lRPW9cqx8ngo0oJ8/BkZRv0jsT8NxL3/mNfoOM8OXcnQjBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:11.827472Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04908","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6a18ed8ff99e6c8545068904d0c445b2b584333084cdb8bb3fdf321521ef140","sha256:e274b8bf9608ea86bfa1cf0a49d51a21873500f0822e7560ebc6ce3f3ba9136a"],"state_sha256":"5a42edcf152a1d209e8fa01011ff8dc4cbfba748774f886c9d089cb69fdb6b1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HPFCM0cpfZ9BTTAOvPeY+eIwW5vhCJeLZzi5qXpgdmLVuOb/1D39bIlEWM9Rv7BkVySJB7OQ9nimw3stgiDfCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:09:31.581143Z","bundle_sha256":"95790d7c26c78bef4fcf8a90fa7dab73ee8ce780f62a8d5b23b1aac7726f86ec"}}