{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:V4ZAUS7RLLLGGJGULNZ6D6KT73","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":"ce6ba815578d1e740bcbab2f5ff023a4843d3c883ba061c8a65e9536a7c4fc4d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-07T08:20:45Z","title_canon_sha256":"bfb07d834058162978e23e0bbe4001b01cf27668ff7a5adbaa99a3f102b120f5"},"schema_version":"1.0","source":{"id":"1010.1365","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1365","created_at":"2026-05-18T04:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1365v1","created_at":"2026-05-18T04:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1365","created_at":"2026-05-18T04:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"V4ZAUS7RLLLG","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"V4ZAUS7RLLLGGJGU","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"V4ZAUS7R","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:b080da7fd1ed19853a001a6207bc049afe7fff71c1bce92b2c3be55b029ce0d3","target":"graph","created_at":"2026-05-18T04:39:41Z","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 a general class of problems called F-deletion problems. In an F-deletion problem, we are asked whether a subset of at most $k$ vertices can be deleted from a graph $G$ such that the resulting graph does not contain as a minor any graph from the family F of forbidden minors.\n  We obtain a number of algorithmic results on the F-deletion problem when F contains a planar graph. We give (1) a linear vertex kernel on graphs excluding $t$-claw $K_{1,t}$, the star with $t$ leves, as an induced subgraph, where $t$ is a fixed integer. (2) an approximation algorithm achieving an approximation ra","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Geevarghese Philip, Neeldhara Misra, Saket Saurabh","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-07T08:20:45Z","title":"Hitting forbidden minors: Approximation and Kernelization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1365","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:9914f0c56f1c0e54d77772afe3392cc9f61f64ebc98803270c91e1e42647ad0e","target":"record","created_at":"2026-05-18T04:39:41Z","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":"ce6ba815578d1e740bcbab2f5ff023a4843d3c883ba061c8a65e9536a7c4fc4d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-07T08:20:45Z","title_canon_sha256":"bfb07d834058162978e23e0bbe4001b01cf27668ff7a5adbaa99a3f102b120f5"},"schema_version":"1.0","source":{"id":"1010.1365","kind":"arxiv","version":1}},"canonical_sha256":"af320a4bf15ad66324d45b73e1f953fef932b4ca5a0cc857a7f87290ae89bbdc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af320a4bf15ad66324d45b73e1f953fef932b4ca5a0cc857a7f87290ae89bbdc","first_computed_at":"2026-05-18T04:39:41.300549Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:41.300549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9iDVoFobZHsMXrm1e77+PG+7Tw9nm7Ba61AMo+GZJrf0g+k43YQNeO6/4qb2S10jgqPe2Vab/FsR8VOTxFonAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:41.301182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.1365","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9914f0c56f1c0e54d77772afe3392cc9f61f64ebc98803270c91e1e42647ad0e","sha256:b080da7fd1ed19853a001a6207bc049afe7fff71c1bce92b2c3be55b029ce0d3"],"state_sha256":"cd35e18ed02681803e1ee6aa6516058725e48edcea41b01cfe4652dad55adf84"}