{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MICQGMSZXJKCA4YB6SEJAK5RNC","short_pith_number":"pith:MICQGMSZ","schema_version":"1.0","canonical_sha256":"6205033259ba54207301f488902bb168aa54ec85ddf4e098e7aa369422da1d06","source":{"kind":"arxiv","id":"1603.05945","version":1},"attestation_state":"computed","paper":{"title":"Parameterized vertex deletion problems for hereditary graph classes with a block property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, \\'Edouard Bonnet, Nick Brettell, O-joung Kwon","submitted_at":"2016-03-18T18:02:04Z","abstract_excerpt":"For a class of graphs $\\mathcal{P}$, the Bounded $\\mathcal{P}$-Block Vertex Deletion problem asks, given a graph $G$ on $n$ vertices and positive integers $k$ and $d$, whether there is a set $S$ of at most $k$ vertices such that each block of $G-S$ has at most $d$ vertices and is in $\\mathcal{P}$. We show that when $\\mathcal{P}$ satisfies a natural hereditary property and is recognizable in polynomial time, Bounded $\\mathcal{P}$-Block Vertex Deletion can be solved in time $2^{O(k \\log d)}n^{O(1)}$. When $\\mathcal{P}$ contains all split graphs, we show that this running time is essentially opti"},"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":"1603.05945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-18T18:02:04Z","cross_cats_sorted":[],"title_canon_sha256":"66864a33a03a23eecc518cb1b589e8afa3a0850476b3dfa5670bd77828ba7469","abstract_canon_sha256":"11d7f6781c0aadf94dee3b0b6923c6651f221f5aa3f1550a4b9442e5c7cf2835"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:53.226706Z","signature_b64":"EiMD4NdxXJdr18nXP+cNjMOdoZ5Ig5J50m/jya6bv6mjFlgLAHbe4wlO7ajHr+o4xrtdGuvY7VsBHFkvSV3eDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6205033259ba54207301f488902bb168aa54ec85ddf4e098e7aa369422da1d06","last_reissued_at":"2026-05-18T01:18:53.226246Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:53.226246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized vertex deletion problems for hereditary graph classes with a block property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, \\'Edouard Bonnet, Nick Brettell, O-joung Kwon","submitted_at":"2016-03-18T18:02:04Z","abstract_excerpt":"For a class of graphs $\\mathcal{P}$, the Bounded $\\mathcal{P}$-Block Vertex Deletion problem asks, given a graph $G$ on $n$ vertices and positive integers $k$ and $d$, whether there is a set $S$ of at most $k$ vertices such that each block of $G-S$ has at most $d$ vertices and is in $\\mathcal{P}$. We show that when $\\mathcal{P}$ satisfies a natural hereditary property and is recognizable in polynomial time, Bounded $\\mathcal{P}$-Block Vertex Deletion can be solved in time $2^{O(k \\log d)}n^{O(1)}$. When $\\mathcal{P}$ contains all split graphs, we show that this running time is essentially opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05945","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":"1603.05945","created_at":"2026-05-18T01:18:53.226321+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05945v1","created_at":"2026-05-18T01:18:53.226321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05945","created_at":"2026-05-18T01:18:53.226321+00:00"},{"alias_kind":"pith_short_12","alias_value":"MICQGMSZXJKC","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MICQGMSZXJKCA4YB","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MICQGMSZ","created_at":"2026-05-18T12:30:32.724797+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/MICQGMSZXJKCA4YB6SEJAK5RNC","json":"https://pith.science/pith/MICQGMSZXJKCA4YB6SEJAK5RNC.json","graph_json":"https://pith.science/api/pith-number/MICQGMSZXJKCA4YB6SEJAK5RNC/graph.json","events_json":"https://pith.science/api/pith-number/MICQGMSZXJKCA4YB6SEJAK5RNC/events.json","paper":"https://pith.science/paper/MICQGMSZ"},"agent_actions":{"view_html":"https://pith.science/pith/MICQGMSZXJKCA4YB6SEJAK5RNC","download_json":"https://pith.science/pith/MICQGMSZXJKCA4YB6SEJAK5RNC.json","view_paper":"https://pith.science/paper/MICQGMSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05945&json=true","fetch_graph":"https://pith.science/api/pith-number/MICQGMSZXJKCA4YB6SEJAK5RNC/graph.json","fetch_events":"https://pith.science/api/pith-number/MICQGMSZXJKCA4YB6SEJAK5RNC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MICQGMSZXJKCA4YB6SEJAK5RNC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MICQGMSZXJKCA4YB6SEJAK5RNC/action/storage_attestation","attest_author":"https://pith.science/pith/MICQGMSZXJKCA4YB6SEJAK5RNC/action/author_attestation","sign_citation":"https://pith.science/pith/MICQGMSZXJKCA4YB6SEJAK5RNC/action/citation_signature","submit_replication":"https://pith.science/pith/MICQGMSZXJKCA4YB6SEJAK5RNC/action/replication_record"}},"created_at":"2026-05-18T01:18:53.226321+00:00","updated_at":"2026-05-18T01:18:53.226321+00:00"}