{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DMJU7BCOQKFG55RUC7AXP6E3VK","short_pith_number":"pith:DMJU7BCO","canonical_record":{"source":{"id":"1207.4681","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T14:20:53Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"8e8cf5155118d929e9284ee124d8048ad7e6e98f3a48cb1261b22e599be1ba36","abstract_canon_sha256":"72d270a5a1904f9cc8d7dee857ac20827894429fa04a9d570fe32b50795684a6"},"schema_version":"1.0"},"canonical_sha256":"1b134f844e828a6ef63417c177f89baa83085032f83b4669b72997461128ebe7","source":{"kind":"arxiv","id":"1207.4681","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4681","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4681v1","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4681","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"DMJU7BCOQKFG","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DMJU7BCOQKFG55RU","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DMJU7BCO","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DMJU7BCOQKFG55RUC7AXP6E3VK","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4681","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T14:20:53Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"8e8cf5155118d929e9284ee124d8048ad7e6e98f3a48cb1261b22e599be1ba36","abstract_canon_sha256":"72d270a5a1904f9cc8d7dee857ac20827894429fa04a9d570fe32b50795684a6"},"schema_version":"1.0"},"canonical_sha256":"1b134f844e828a6ef63417c177f89baa83085032f83b4669b72997461128ebe7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:36.108202Z","signature_b64":"vl2YomrYulivIlCSn6LAAvDLELWqRLYM5JLLU50rAzVj9Z8ojN0hVHxZvSO7nEP/xpVeVr9ncKVkuNI9Ib4cAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b134f844e828a6ef63417c177f89baa83085032f83b4669b72997461128ebe7","last_reissued_at":"2026-05-18T03:50:36.107377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:36.107377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4681","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":"XMRv5sDic489SQFMKbtByAbOexOR9MYT0Vxshe7pVlNfp4n0wefwPZ307VwWG5lSaB3U5b1Dwx810+BI/8DwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:59:40.937440Z"},"content_sha256":"71ff868690f7b9206dd5349b8db6972298c9dab34cb2b07795fc2df6903ddba2","schema_version":"1.0","event_id":"sha256:71ff868690f7b9206dd5349b8db6972298c9dab34cb2b07795fc2df6903ddba2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DMJU7BCOQKFG55RUC7AXP6E3VK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonblocker in H-minor free graphs: kernelization meets discharging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Lukasz Kowalik","submitted_at":"2012-07-19T14:20:53Z","abstract_excerpt":"Perhaps the best known kernelization result is the kernel of size 335k for the Planar Dominating Set problem by Alber et al. [JACM 2004], later improved to 67k by Chen et al. [SICOMP 2007]. This result means roughly, that the problem of finding the smallest dominating set in a planar graph is easy when the optimal solution is small. On the other hand, it is known that Planar Dominating Set parameterized by k'=|V|-k (also known as Planar Nonblocker) has a kernel of size 2k'. This means that Planar Dominating Set is easy when the optimal solution is very large. We improve the kernel for Planar N"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4681","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":"bqu3DaFLtsZb3yjIe2b1TqW24CJXxOSJRsdlXN7WXhGkwcQHxMIwH6YKaxXoXgMN32pMOK8VE/dpLVcbjxabDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:59:40.938086Z"},"content_sha256":"b4c27106ad2acb477cd084dd5660fb26921216a797b4cfdd64db363fa0e80bad","schema_version":"1.0","event_id":"sha256:b4c27106ad2acb477cd084dd5660fb26921216a797b4cfdd64db363fa0e80bad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMJU7BCOQKFG55RUC7AXP6E3VK/bundle.json","state_url":"https://pith.science/pith/DMJU7BCOQKFG55RUC7AXP6E3VK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMJU7BCOQKFG55RUC7AXP6E3VK/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-27T12:59:40Z","links":{"resolver":"https://pith.science/pith/DMJU7BCOQKFG55RUC7AXP6E3VK","bundle":"https://pith.science/pith/DMJU7BCOQKFG55RUC7AXP6E3VK/bundle.json","state":"https://pith.science/pith/DMJU7BCOQKFG55RUC7AXP6E3VK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMJU7BCOQKFG55RUC7AXP6E3VK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DMJU7BCOQKFG55RUC7AXP6E3VK","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":"72d270a5a1904f9cc8d7dee857ac20827894429fa04a9d570fe32b50795684a6","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T14:20:53Z","title_canon_sha256":"8e8cf5155118d929e9284ee124d8048ad7e6e98f3a48cb1261b22e599be1ba36"},"schema_version":"1.0","source":{"id":"1207.4681","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4681","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4681v1","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4681","created_at":"2026-05-18T03:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"DMJU7BCOQKFG","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DMJU7BCOQKFG55RU","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DMJU7BCO","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:b4c27106ad2acb477cd084dd5660fb26921216a797b4cfdd64db363fa0e80bad","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":"Perhaps the best known kernelization result is the kernel of size 335k for the Planar Dominating Set problem by Alber et al. [JACM 2004], later improved to 67k by Chen et al. [SICOMP 2007]. This result means roughly, that the problem of finding the smallest dominating set in a planar graph is easy when the optimal solution is small. On the other hand, it is known that Planar Dominating Set parameterized by k'=|V|-k (also known as Planar Nonblocker) has a kernel of size 2k'. This means that Planar Dominating Set is easy when the optimal solution is very large. We improve the kernel for Planar N","authors_text":"Lukasz Kowalik","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T14:20:53Z","title":"Nonblocker in H-minor free graphs: kernelization meets discharging"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4681","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:71ff868690f7b9206dd5349b8db6972298c9dab34cb2b07795fc2df6903ddba2","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":"72d270a5a1904f9cc8d7dee857ac20827894429fa04a9d570fe32b50795684a6","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-19T14:20:53Z","title_canon_sha256":"8e8cf5155118d929e9284ee124d8048ad7e6e98f3a48cb1261b22e599be1ba36"},"schema_version":"1.0","source":{"id":"1207.4681","kind":"arxiv","version":1}},"canonical_sha256":"1b134f844e828a6ef63417c177f89baa83085032f83b4669b72997461128ebe7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b134f844e828a6ef63417c177f89baa83085032f83b4669b72997461128ebe7","first_computed_at":"2026-05-18T03:50:36.107377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:36.107377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vl2YomrYulivIlCSn6LAAvDLELWqRLYM5JLLU50rAzVj9Z8ojN0hVHxZvSO7nEP/xpVeVr9ncKVkuNI9Ib4cAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:36.108202Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4681","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71ff868690f7b9206dd5349b8db6972298c9dab34cb2b07795fc2df6903ddba2","sha256:b4c27106ad2acb477cd084dd5660fb26921216a797b4cfdd64db363fa0e80bad"],"state_sha256":"52b1ab777d941b05d3c720f7a03d46d23e1a78a78d753db6cd475a426260d47a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ejSQmZCDpidKKrDKDUqjLvnwl/r4q7jxWJDts9Q3IhF4Xs1OeO9lsx/KnBoN+E0euD6iJtvuIakgC++sUjbtDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:59:40.941701Z","bundle_sha256":"81ea2cf4fc3aa940f95b91a87e52a5cdbab193ac1d7a30122131e016e70d0951"}}