{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ACOLMLASMNBBS7BV6JV6WUTHC3","short_pith_number":"pith:ACOLMLAS","schema_version":"1.0","canonical_sha256":"009cb62c126342197c35f26beb526716cff9e1b7d640ca42805afb6ddca65d0c","source":{"kind":"arxiv","id":"1905.03631","version":1},"attestation_state":"computed","paper":{"title":"Elimination Distances, Blocking Sets, and Kernels for Vertex Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Astrid Pieterse, Eva-Maria C. Hols, Stefan Kratsch","submitted_at":"2019-05-09T13:47:17Z","abstract_excerpt":"The Vertex Cover problem plays an essential role in the study of polynomial kernelization in parameterized complexity, i.e., the study of provable and efficient preprocessing for NP-hard problems. Motivated by the great variety of positive and negative results for kernelization for Vertex Cover subject to different parameters and graph classes, we seek to unify and generalize them using so-called blocking sets, which have played implicit and explicit roles in many results.\n  We show that in the most-studied setting, parameterized by the size of a deletion set to a specified graph class $\\mathc"},"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":"1905.03631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-09T13:47:17Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9644476fb83e5810b83815198e277956179fde532779f0ed6c4adb52384a0056","abstract_canon_sha256":"4ab2f930d05a61dbf2b68dd9f0cebdd88c15f02be5c5302f7ec7647ef1356ba2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:37.140525Z","signature_b64":"VXxL8TGwQYLdg/n32MTJt7abLJ0WW0kOYU2nOSjlqBZ96PKop7sZYIIyHI3Sj8Hdwz2lugmEKwCnblD2OozeCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"009cb62c126342197c35f26beb526716cff9e1b7d640ca42805afb6ddca65d0c","last_reissued_at":"2026-05-17T23:46:37.139956Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:37.139956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Elimination Distances, Blocking Sets, and Kernels for Vertex Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Astrid Pieterse, Eva-Maria C. Hols, Stefan Kratsch","submitted_at":"2019-05-09T13:47:17Z","abstract_excerpt":"The Vertex Cover problem plays an essential role in the study of polynomial kernelization in parameterized complexity, i.e., the study of provable and efficient preprocessing for NP-hard problems. Motivated by the great variety of positive and negative results for kernelization for Vertex Cover subject to different parameters and graph classes, we seek to unify and generalize them using so-called blocking sets, which have played implicit and explicit roles in many results.\n  We show that in the most-studied setting, parameterized by the size of a deletion set to a specified graph class $\\mathc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03631","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":"1905.03631","created_at":"2026-05-17T23:46:37.140031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03631v1","created_at":"2026-05-17T23:46:37.140031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03631","created_at":"2026-05-17T23:46:37.140031+00:00"},{"alias_kind":"pith_short_12","alias_value":"ACOLMLASMNBB","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"ACOLMLASMNBBS7BV","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"ACOLMLAS","created_at":"2026-05-18T12:33:12.712433+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/ACOLMLASMNBBS7BV6JV6WUTHC3","json":"https://pith.science/pith/ACOLMLASMNBBS7BV6JV6WUTHC3.json","graph_json":"https://pith.science/api/pith-number/ACOLMLASMNBBS7BV6JV6WUTHC3/graph.json","events_json":"https://pith.science/api/pith-number/ACOLMLASMNBBS7BV6JV6WUTHC3/events.json","paper":"https://pith.science/paper/ACOLMLAS"},"agent_actions":{"view_html":"https://pith.science/pith/ACOLMLASMNBBS7BV6JV6WUTHC3","download_json":"https://pith.science/pith/ACOLMLASMNBBS7BV6JV6WUTHC3.json","view_paper":"https://pith.science/paper/ACOLMLAS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03631&json=true","fetch_graph":"https://pith.science/api/pith-number/ACOLMLASMNBBS7BV6JV6WUTHC3/graph.json","fetch_events":"https://pith.science/api/pith-number/ACOLMLASMNBBS7BV6JV6WUTHC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ACOLMLASMNBBS7BV6JV6WUTHC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ACOLMLASMNBBS7BV6JV6WUTHC3/action/storage_attestation","attest_author":"https://pith.science/pith/ACOLMLASMNBBS7BV6JV6WUTHC3/action/author_attestation","sign_citation":"https://pith.science/pith/ACOLMLASMNBBS7BV6JV6WUTHC3/action/citation_signature","submit_replication":"https://pith.science/pith/ACOLMLASMNBBS7BV6JV6WUTHC3/action/replication_record"}},"created_at":"2026-05-17T23:46:37.140031+00:00","updated_at":"2026-05-17T23:46:37.140031+00:00"}