{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VDLXLPSYYLDNHAMKRRAWZPFQYY","short_pith_number":"pith:VDLXLPSY","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"},"canonical_sha256":"a8d775be58c2c6d3818a8c416cbcb0c60ffa885ebe7c848476a5e621da32ff76","source":{"kind":"arxiv","id":"1604.06056","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06056","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06056v3","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06056","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"VDLXLPSYYLDN","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VDLXLPSYYLDNHAMK","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VDLXLPSY","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VDLXLPSYYLDNHAMKRRAWZPFQYY","target":"record","payload":{"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"},"canonical_sha256":"a8d775be58c2c6d3818a8c416cbcb0c60ffa885ebe7c848476a5e621da32ff76","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"},"source_kind":"arxiv","source_id":"1604.06056","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J/bLCl8yHgt7t68tKH1DBdIWPuRbJGNt5I2AkuHE/+gWDRkFrOaZ7sCGfxs8bDzwB9nb0OQkRr51tBQgBoY4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:12:40.187544Z"},"content_sha256":"6ea429e186782847bc4113e9afb8e85e0ba5707b49168eca1e61d0af2cd8ca9b","schema_version":"1.0","event_id":"sha256:6ea429e186782847bc4113e9afb8e85e0ba5707b49168eca1e61d0af2cd8ca9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VDLXLPSYYLDNHAMKRRAWZPFQYY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+AxQabjzKkMfQ6ZpyZkVsEXqjNZHCW2uJNhR4/GT0/mh+zBzJhZXO25WmirLdAga/GPU6VqupG7zPObfGkCUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:12:40.187877Z"},"content_sha256":"35836026cc1de0b8c85dbccaa7488477c72afa5dc83368caf0f0eca85afe8712","schema_version":"1.0","event_id":"sha256:35836026cc1de0b8c85dbccaa7488477c72afa5dc83368caf0f0eca85afe8712"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VDLXLPSYYLDNHAMKRRAWZPFQYY/bundle.json","state_url":"https://pith.science/pith/VDLXLPSYYLDNHAMKRRAWZPFQYY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VDLXLPSYYLDNHAMKRRAWZPFQYY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T20:12:40Z","links":{"resolver":"https://pith.science/pith/VDLXLPSYYLDNHAMKRRAWZPFQYY","bundle":"https://pith.science/pith/VDLXLPSYYLDNHAMKRRAWZPFQYY/bundle.json","state":"https://pith.science/pith/VDLXLPSYYLDNHAMKRRAWZPFQYY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VDLXLPSYYLDNHAMKRRAWZPFQYY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VDLXLPSYYLDNHAMKRRAWZPFQYY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e5a70472fff8b9015c9a836ed2ec96d7bd98aac388526de6559b16b37d7e905f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-20T18:45:34Z","title_canon_sha256":"8a630f826d41c9d75aecec7f826fe0118c01c070e4e0fa5b5e94b90e8e2e2e05"},"schema_version":"1.0","source":{"id":"1604.06056","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06056","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06056v3","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06056","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"VDLXLPSYYLDN","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VDLXLPSYYLDNHAMK","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VDLXLPSY","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:35836026cc1de0b8c85dbccaa7488477c72afa5dc83368caf0f0eca85afe8712","target":"graph","created_at":"2026-05-18T00:38:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Eduard Eiben, O-joung Kwon, Robert Ganian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-20T18:45:34Z","title":"A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06056","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6ea429e186782847bc4113e9afb8e85e0ba5707b49168eca1e61d0af2cd8ca9b","target":"record","created_at":"2026-05-18T00:38:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e5a70472fff8b9015c9a836ed2ec96d7bd98aac388526de6559b16b37d7e905f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-20T18:45:34Z","title_canon_sha256":"8a630f826d41c9d75aecec7f826fe0118c01c070e4e0fa5b5e94b90e8e2e2e05"},"schema_version":"1.0","source":{"id":"1604.06056","kind":"arxiv","version":3}},"canonical_sha256":"a8d775be58c2c6d3818a8c416cbcb0c60ffa885ebe7c848476a5e621da32ff76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8d775be58c2c6d3818a8c416cbcb0c60ffa885ebe7c848476a5e621da32ff76","first_computed_at":"2026-05-18T00:38:40.029278Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:40.029278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rTewDEQBHUmoFgXuhQU0fYMxycuuI8ywtthPwxtiEwwks0jVvw/Dt3g+CHU4/QdM76KTlfYMCmAjbBjXj1BIBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:40.029848Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06056","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ea429e186782847bc4113e9afb8e85e0ba5707b49168eca1e61d0af2cd8ca9b","sha256:35836026cc1de0b8c85dbccaa7488477c72afa5dc83368caf0f0eca85afe8712"],"state_sha256":"489c0509af44fa942ff11e76d071fa134ce70d35ea2d670cb15ab6b7e47c83b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sFNyxYcJpy05jE/DMx4VG/mnh/XmSjGo61skWX6A6Mb2D3xMOTUJ+v9fVukcE7fonyiFar70zeT2UyM7hMTtDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T20:12:40.189699Z","bundle_sha256":"fc52abb99ea6e9d051704b897c6b7dde9ede7305ec7c9af947a01ef9eb0a7c4c"}}