{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:V4ZAUS7RLLLGGJGULNZ6D6KT73","short_pith_number":"pith:V4ZAUS7R","canonical_record":{"source":{"id":"1010.1365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-07T08:20:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bfb07d834058162978e23e0bbe4001b01cf27668ff7a5adbaa99a3f102b120f5","abstract_canon_sha256":"ce6ba815578d1e740bcbab2f5ff023a4843d3c883ba061c8a65e9536a7c4fc4d"},"schema_version":"1.0"},"canonical_sha256":"af320a4bf15ad66324d45b73e1f953fef932b4ca5a0cc857a7f87290ae89bbdc","source":{"kind":"arxiv","id":"1010.1365","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:V4ZAUS7RLLLGGJGULNZ6D6KT73","target":"record","payload":{"canonical_record":{"source":{"id":"1010.1365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-07T08:20:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bfb07d834058162978e23e0bbe4001b01cf27668ff7a5adbaa99a3f102b120f5","abstract_canon_sha256":"ce6ba815578d1e740bcbab2f5ff023a4843d3c883ba061c8a65e9536a7c4fc4d"},"schema_version":"1.0"},"canonical_sha256":"af320a4bf15ad66324d45b73e1f953fef932b4ca5a0cc857a7f87290ae89bbdc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:41.301182Z","signature_b64":"9iDVoFobZHsMXrm1e77+PG+7Tw9nm7Ba61AMo+GZJrf0g+k43YQNeO6/4qb2S10jgqPe2Vab/FsR8VOTxFonAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af320a4bf15ad66324d45b73e1f953fef932b4ca5a0cc857a7f87290ae89bbdc","last_reissued_at":"2026-05-18T04:39:41.300549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:41.300549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.1365","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-18T04:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uTyMko31Y8g+7eI7iX/MZAN+tiV5WJN8ClE/6tTdVz8j4FEMuTj/I09UXJ3IoOHZvvtpycmmdD9Cgu+IsLsCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:28:26.200729Z"},"content_sha256":"9914f0c56f1c0e54d77772afe3392cc9f61f64ebc98803270c91e1e42647ad0e","schema_version":"1.0","event_id":"sha256:9914f0c56f1c0e54d77772afe3392cc9f61f64ebc98803270c91e1e42647ad0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:V4ZAUS7RLLLGGJGULNZ6D6KT73","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hitting forbidden minors: Approximation and Kernelization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Geevarghese Philip, Neeldhara Misra, Saket Saurabh","submitted_at":"2010-10-07T08:20:45Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1365","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-18T04:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gsP0m06ARjzY293sRfy2t21sqTXDjuwt/c8SxnUSsRKY9clxRRO7Zm0Roqxsjd9+nhotY43VrX9piUXNbpyhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:28:26.201409Z"},"content_sha256":"b080da7fd1ed19853a001a6207bc049afe7fff71c1bce92b2c3be55b029ce0d3","schema_version":"1.0","event_id":"sha256:b080da7fd1ed19853a001a6207bc049afe7fff71c1bce92b2c3be55b029ce0d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V4ZAUS7RLLLGGJGULNZ6D6KT73/bundle.json","state_url":"https://pith.science/pith/V4ZAUS7RLLLGGJGULNZ6D6KT73/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V4ZAUS7RLLLGGJGULNZ6D6KT73/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-31T23:28:26Z","links":{"resolver":"https://pith.science/pith/V4ZAUS7RLLLGGJGULNZ6D6KT73","bundle":"https://pith.science/pith/V4ZAUS7RLLLGGJGULNZ6D6KT73/bundle.json","state":"https://pith.science/pith/V4ZAUS7RLLLGGJGULNZ6D6KT73/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V4ZAUS7RLLLGGJGULNZ6D6KT73/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MAxKWjbc1AXLn+5pEfPeyTC3frVCPfZ7ISaBahc+ec7l1PugnmfdRKfv7iyZxz0EEf/tZfeTVs0Uk4PGlFjgCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:28:26.205115Z","bundle_sha256":"c4062d742c7c5492f5d0f91ceceb3cee44b87112444f3b500022c91fc6387eca"}}