{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DMJU7BCOQKFG55RUC7AXP6E3VK","short_pith_number":"pith:DMJU7BCO","schema_version":"1.0","canonical_sha256":"1b134f844e828a6ef63417c177f89baa83085032f83b4669b72997461128ebe7","source":{"kind":"arxiv","id":"1207.4681","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.4681","created_at":"2026-05-18T03:50:36.107525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.4681v1","created_at":"2026-05-18T03:50:36.107525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4681","created_at":"2026-05-18T03:50:36.107525+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMJU7BCOQKFG","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMJU7BCOQKFG55RU","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMJU7BCO","created_at":"2026-05-18T12:27:04.183437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DMJU7BCOQKFG55RUC7AXP6E3VK","json":"https://pith.science/pith/DMJU7BCOQKFG55RUC7AXP6E3VK.json","graph_json":"https://pith.science/api/pith-number/DMJU7BCOQKFG55RUC7AXP6E3VK/graph.json","events_json":"https://pith.science/api/pith-number/DMJU7BCOQKFG55RUC7AXP6E3VK/events.json","paper":"https://pith.science/paper/DMJU7BCO"},"agent_actions":{"view_html":"https://pith.science/pith/DMJU7BCOQKFG55RUC7AXP6E3VK","download_json":"https://pith.science/pith/DMJU7BCOQKFG55RUC7AXP6E3VK.json","view_paper":"https://pith.science/paper/DMJU7BCO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.4681&json=true","fetch_graph":"https://pith.science/api/pith-number/DMJU7BCOQKFG55RUC7AXP6E3VK/graph.json","fetch_events":"https://pith.science/api/pith-number/DMJU7BCOQKFG55RUC7AXP6E3VK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMJU7BCOQKFG55RUC7AXP6E3VK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMJU7BCOQKFG55RUC7AXP6E3VK/action/storage_attestation","attest_author":"https://pith.science/pith/DMJU7BCOQKFG55RUC7AXP6E3VK/action/author_attestation","sign_citation":"https://pith.science/pith/DMJU7BCOQKFG55RUC7AXP6E3VK/action/citation_signature","submit_replication":"https://pith.science/pith/DMJU7BCOQKFG55RUC7AXP6E3VK/action/replication_record"}},"created_at":"2026-05-18T03:50:36.107525+00:00","updated_at":"2026-05-18T03:50:36.107525+00:00"}