{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VDLXLPSYYLDNHAMKRRAWZPFQYY","short_pith_number":"pith:VDLXLPSY","schema_version":"1.0","canonical_sha256":"a8d775be58c2c6d3818a8c416cbcb0c60ffa885ebe7c848476a5e621da32ff76","source":{"kind":"arxiv","id":"1604.06056","version":3},"attestation_state":"computed","paper":{"title":"A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eduard Eiben, O-joung Kwon, Robert Ganian","submitted_at":"2016-04-20T18:45:34Z","abstract_excerpt":"Vertex deletion problems ask whether it is possible to delete at most $k$ vertices from a graph so that the resulting graph belongs to a specified graph class. Over the past years, the parameterized complexity of vertex deletion to a plethora of graph classes has been systematically researched. Here we present the first single-exponential fixed-parameter tractable algorithm for vertex deletion to distance-hereditary graphs, a well-studied graph class which is particularly important in the context of vertex deletion due to its connection to the graph parameter rank-width. We complement our resu"},"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":"1604.06056","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-20T18:45:34Z","cross_cats_sorted":[],"title_canon_sha256":"8a630f826d41c9d75aecec7f826fe0118c01c070e4e0fa5b5e94b90e8e2e2e05","abstract_canon_sha256":"e5a70472fff8b9015c9a836ed2ec96d7bd98aac388526de6559b16b37d7e905f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:40.029848Z","signature_b64":"rTewDEQBHUmoFgXuhQU0fYMxycuuI8ywtthPwxtiEwwks0jVvw/Dt3g+CHU4/QdM76KTlfYMCmAjbBjXj1BIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8d775be58c2c6d3818a8c416cbcb0c60ffa885ebe7c848476a5e621da32ff76","last_reissued_at":"2026-05-18T00:38:40.029278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:40.029278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eduard Eiben, O-joung Kwon, Robert Ganian","submitted_at":"2016-04-20T18:45:34Z","abstract_excerpt":"Vertex deletion problems ask whether it is possible to delete at most $k$ vertices from a graph so that the resulting graph belongs to a specified graph class. Over the past years, the parameterized complexity of vertex deletion to a plethora of graph classes has been systematically researched. Here we present the first single-exponential fixed-parameter tractable algorithm for vertex deletion to distance-hereditary graphs, a well-studied graph class which is particularly important in the context of vertex deletion due to its connection to the graph parameter rank-width. We complement our resu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06056","kind":"arxiv","version":3},"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":"1604.06056","created_at":"2026-05-18T00:38:40.029348+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06056v3","created_at":"2026-05-18T00:38:40.029348+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06056","created_at":"2026-05-18T00:38:40.029348+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDLXLPSYYLDN","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDLXLPSYYLDNHAMK","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDLXLPSY","created_at":"2026-05-18T12:30:48.956258+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/VDLXLPSYYLDNHAMKRRAWZPFQYY","json":"https://pith.science/pith/VDLXLPSYYLDNHAMKRRAWZPFQYY.json","graph_json":"https://pith.science/api/pith-number/VDLXLPSYYLDNHAMKRRAWZPFQYY/graph.json","events_json":"https://pith.science/api/pith-number/VDLXLPSYYLDNHAMKRRAWZPFQYY/events.json","paper":"https://pith.science/paper/VDLXLPSY"},"agent_actions":{"view_html":"https://pith.science/pith/VDLXLPSYYLDNHAMKRRAWZPFQYY","download_json":"https://pith.science/pith/VDLXLPSYYLDNHAMKRRAWZPFQYY.json","view_paper":"https://pith.science/paper/VDLXLPSY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06056&json=true","fetch_graph":"https://pith.science/api/pith-number/VDLXLPSYYLDNHAMKRRAWZPFQYY/graph.json","fetch_events":"https://pith.science/api/pith-number/VDLXLPSYYLDNHAMKRRAWZPFQYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDLXLPSYYLDNHAMKRRAWZPFQYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDLXLPSYYLDNHAMKRRAWZPFQYY/action/storage_attestation","attest_author":"https://pith.science/pith/VDLXLPSYYLDNHAMKRRAWZPFQYY/action/author_attestation","sign_citation":"https://pith.science/pith/VDLXLPSYYLDNHAMKRRAWZPFQYY/action/citation_signature","submit_replication":"https://pith.science/pith/VDLXLPSYYLDNHAMKRRAWZPFQYY/action/replication_record"}},"created_at":"2026-05-18T00:38:40.029348+00:00","updated_at":"2026-05-18T00:38:40.029348+00:00"}