{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FAXKQXHKEW3C34KJ232KM6FRYU","short_pith_number":"pith:FAXKQXHK","canonical_record":{"source":{"id":"1207.4666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T13:44:10Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"b72a351cc48e1fe169a21ea2d04014003fe453df7875aec1cdb70eb5a49d18cb","abstract_canon_sha256":"45b430c98b01d1f1ec29067ce431a0d9ef9133c589c593e05fb64b54d1ee8674"},"schema_version":"1.0"},"canonical_sha256":"282ea85cea25b62df149d6f4a678b1c5014fc95b459cbc52c7a7b68b3d14a71d","source":{"kind":"arxiv","id":"1207.4666","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4666","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4666v1","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4666","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"FAXKQXHKEW3C","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"FAXKQXHKEW3C34KJ","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"FAXKQXHK","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FAXKQXHKEW3C34KJ232KM6FRYU","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T13:44:10Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"b72a351cc48e1fe169a21ea2d04014003fe453df7875aec1cdb70eb5a49d18cb","abstract_canon_sha256":"45b430c98b01d1f1ec29067ce431a0d9ef9133c589c593e05fb64b54d1ee8674"},"schema_version":"1.0"},"canonical_sha256":"282ea85cea25b62df149d6f4a678b1c5014fc95b459cbc52c7a7b68b3d14a71d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:36.191978Z","signature_b64":"YSfXbfG+OS823TmKptmx2CsyKaFdnVE7T9l+qdVKDySIdxihUfVzTmUm5hj17f0IWZ6Q1Oh97Ev7LSqAjRAxDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"282ea85cea25b62df149d6f4a678b1c5014fc95b459cbc52c7a7b68b3d14a71d","last_reissued_at":"2026-05-18T03:50:36.191187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:36.191187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4666","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-18T03:50:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8HTsz8Copr9axItDK2k3DKOA1V/lSo96vDvD4TuYk4dE2e9sHu/EXWuBcLmWGLhmj7gMl2M5WDTQ+CxtI3t5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:48:41.699610Z"},"content_sha256":"8a3af3602ebd9e02aa3d3290fd9e3ee5dca5771331ef1ca755e124add01d84e6","schema_version":"1.0","event_id":"sha256:8a3af3602ebd9e02aa3d3290fd9e3ee5dca5771331ef1ca755e124add01d84e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FAXKQXHKEW3C34KJ232KM6FRYU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A 9k kernel for nonseparating independent set in planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Lukasz Kowalik, Marcin Mucha","submitted_at":"2012-07-19T13:44:10Z","abstract_excerpt":"We study kernelization (a kind of efficient preprocessing) for NP-hard problems on planar graphs. Our main result is a kernel of size at most 9k vertices for the Planar Maximum Nonseparating Independent Set problem. A direct consequence of this result is that Planar Connected Vertex Cover has no kernel with at most (9/8 - epsilon)k vertices, for any epsilon > 0, assuming P \\ne NP. We also show a very simple 5k-vertices kernel for Planar Max Leaf, which results in a lower bound of (5/4 - epsilon)k vertices for the kernel of Planar Connected Dominating Set (also under P \\ne NP).\n  As a by-produc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4666","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-18T03:50:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zLd48Bi3FBzcj4hNLw8k0YG91Szybm/z7QCsKEMlVoueS9jw2tfcJSQBV3F2WiIfe+AF4s50+NPbAUNQr9c9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:48:41.700461Z"},"content_sha256":"22accf951ce3e91e2530e13679ba87b2c11805387affef91def73a47d184977a","schema_version":"1.0","event_id":"sha256:22accf951ce3e91e2530e13679ba87b2c11805387affef91def73a47d184977a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FAXKQXHKEW3C34KJ232KM6FRYU/bundle.json","state_url":"https://pith.science/pith/FAXKQXHKEW3C34KJ232KM6FRYU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FAXKQXHKEW3C34KJ232KM6FRYU/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-31T12:48:41Z","links":{"resolver":"https://pith.science/pith/FAXKQXHKEW3C34KJ232KM6FRYU","bundle":"https://pith.science/pith/FAXKQXHKEW3C34KJ232KM6FRYU/bundle.json","state":"https://pith.science/pith/FAXKQXHKEW3C34KJ232KM6FRYU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FAXKQXHKEW3C34KJ232KM6FRYU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FAXKQXHKEW3C34KJ232KM6FRYU","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":"45b430c98b01d1f1ec29067ce431a0d9ef9133c589c593e05fb64b54d1ee8674","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T13:44:10Z","title_canon_sha256":"b72a351cc48e1fe169a21ea2d04014003fe453df7875aec1cdb70eb5a49d18cb"},"schema_version":"1.0","source":{"id":"1207.4666","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4666","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4666v1","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4666","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"FAXKQXHKEW3C","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"FAXKQXHKEW3C34KJ","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"FAXKQXHK","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:22accf951ce3e91e2530e13679ba87b2c11805387affef91def73a47d184977a","target":"graph","created_at":"2026-05-18T03:50:36Z","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 kernelization (a kind of efficient preprocessing) for NP-hard problems on planar graphs. Our main result is a kernel of size at most 9k vertices for the Planar Maximum Nonseparating Independent Set problem. A direct consequence of this result is that Planar Connected Vertex Cover has no kernel with at most (9/8 - epsilon)k vertices, for any epsilon > 0, assuming P \\ne NP. We also show a very simple 5k-vertices kernel for Planar Max Leaf, which results in a lower bound of (5/4 - epsilon)k vertices for the kernel of Planar Connected Dominating Set (also under P \\ne NP).\n  As a by-produc","authors_text":"Lukasz Kowalik, Marcin Mucha","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T13:44:10Z","title":"A 9k kernel for nonseparating independent set in planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4666","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:8a3af3602ebd9e02aa3d3290fd9e3ee5dca5771331ef1ca755e124add01d84e6","target":"record","created_at":"2026-05-18T03:50:36Z","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":"45b430c98b01d1f1ec29067ce431a0d9ef9133c589c593e05fb64b54d1ee8674","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T13:44:10Z","title_canon_sha256":"b72a351cc48e1fe169a21ea2d04014003fe453df7875aec1cdb70eb5a49d18cb"},"schema_version":"1.0","source":{"id":"1207.4666","kind":"arxiv","version":1}},"canonical_sha256":"282ea85cea25b62df149d6f4a678b1c5014fc95b459cbc52c7a7b68b3d14a71d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"282ea85cea25b62df149d6f4a678b1c5014fc95b459cbc52c7a7b68b3d14a71d","first_computed_at":"2026-05-18T03:50:36.191187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:36.191187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YSfXbfG+OS823TmKptmx2CsyKaFdnVE7T9l+qdVKDySIdxihUfVzTmUm5hj17f0IWZ6Q1Oh97Ev7LSqAjRAxDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:36.191978Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4666","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a3af3602ebd9e02aa3d3290fd9e3ee5dca5771331ef1ca755e124add01d84e6","sha256:22accf951ce3e91e2530e13679ba87b2c11805387affef91def73a47d184977a"],"state_sha256":"3c336be2ff0c97bb00f478263676ccd3423f07e8d752d38c90ea9fdd92ede2ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kM4W6PCD370EFayY1ozQ9fb9PFVtQUaCeQQf42gsMhTypM2LrvNWPaRlXjCHYzTW1P4fCvRY3u/XWZBL5cLpCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:48:41.704265Z","bundle_sha256":"c842b1d5a1cda6a04730e242eb29893e3a43139dd4fb742d27780a49e8a2c5b6"}}