{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OITDMNCQC5EBBDKKB6STUPIWY4","short_pith_number":"pith:OITDMNCQ","schema_version":"1.0","canonical_sha256":"72263634501748108d4a0fa53a3d16c7034db93b6f7bda45d67f7fbe26c83c2d","source":{"kind":"arxiv","id":"1804.08885","version":1},"attestation_state":"computed","paper":{"title":"Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Astrid Pieterse, Bart M. P. Jansen","submitted_at":"2018-04-24T08:08:10Z","abstract_excerpt":"We investigate polynomial-time preprocessing for the problem of hitting forbidden minors in a graph, using the framework of kernelization. For a fixed finite set of connected graphs F, the F-Deletion problem is the following: given a graph G and integer k, is it possible to delete k vertices from G to ensure the resulting graph does not contain any graph from F as a minor? Earlier work by Fomin, Lokshtanov, Misra, and Saurabh [FOCS'12] showed that when F contains a planar graph, an instance (G,k) can be reduced in polynomial time to an equivalent one of size $k^{O(1)}$. In this work we focus o"},"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":"1804.08885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-04-24T08:08:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"455b2e15ff6ba22790df5eda17069fb4ac5bb140c63f885c1ed5d294c16e288a","abstract_canon_sha256":"735d458594caf453fe16a70e1f131e12109f30ce3ab7c28579f8cde34d435bc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:37.002703Z","signature_b64":"qes+Etn5UBacjf6Pw6wkjUO/t0f2VoAaOzpu/FbbBaXHqpHdqLDvmuwR/WPmO41dB1iqnVMF7xGsa88NQuoWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72263634501748108d4a0fa53a3d16c7034db93b6f7bda45d67f7fbe26c83c2d","last_reissued_at":"2026-05-18T00:17:37.001986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:37.001986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Astrid Pieterse, Bart M. P. Jansen","submitted_at":"2018-04-24T08:08:10Z","abstract_excerpt":"We investigate polynomial-time preprocessing for the problem of hitting forbidden minors in a graph, using the framework of kernelization. For a fixed finite set of connected graphs F, the F-Deletion problem is the following: given a graph G and integer k, is it possible to delete k vertices from G to ensure the resulting graph does not contain any graph from F as a minor? Earlier work by Fomin, Lokshtanov, Misra, and Saurabh [FOCS'12] showed that when F contains a planar graph, an instance (G,k) can be reduced in polynomial time to an equivalent one of size $k^{O(1)}$. In this work we focus o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08885","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":"1804.08885","created_at":"2026-05-18T00:17:37.002089+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08885v1","created_at":"2026-05-18T00:17:37.002089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08885","created_at":"2026-05-18T00:17:37.002089+00:00"},{"alias_kind":"pith_short_12","alias_value":"OITDMNCQC5EB","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OITDMNCQC5EBBDKK","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OITDMNCQ","created_at":"2026-05-18T12:32:43.782077+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/OITDMNCQC5EBBDKKB6STUPIWY4","json":"https://pith.science/pith/OITDMNCQC5EBBDKKB6STUPIWY4.json","graph_json":"https://pith.science/api/pith-number/OITDMNCQC5EBBDKKB6STUPIWY4/graph.json","events_json":"https://pith.science/api/pith-number/OITDMNCQC5EBBDKKB6STUPIWY4/events.json","paper":"https://pith.science/paper/OITDMNCQ"},"agent_actions":{"view_html":"https://pith.science/pith/OITDMNCQC5EBBDKKB6STUPIWY4","download_json":"https://pith.science/pith/OITDMNCQC5EBBDKKB6STUPIWY4.json","view_paper":"https://pith.science/paper/OITDMNCQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08885&json=true","fetch_graph":"https://pith.science/api/pith-number/OITDMNCQC5EBBDKKB6STUPIWY4/graph.json","fetch_events":"https://pith.science/api/pith-number/OITDMNCQC5EBBDKKB6STUPIWY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OITDMNCQC5EBBDKKB6STUPIWY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OITDMNCQC5EBBDKKB6STUPIWY4/action/storage_attestation","attest_author":"https://pith.science/pith/OITDMNCQC5EBBDKKB6STUPIWY4/action/author_attestation","sign_citation":"https://pith.science/pith/OITDMNCQC5EBBDKKB6STUPIWY4/action/citation_signature","submit_replication":"https://pith.science/pith/OITDMNCQC5EBBDKKB6STUPIWY4/action/replication_record"}},"created_at":"2026-05-18T00:17:37.002089+00:00","updated_at":"2026-05-18T00:17:37.002089+00:00"}