{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YOY7V5SWRZI6LESQXXGZFIIVCC","short_pith_number":"pith:YOY7V5SW","canonical_record":{"source":{"id":"1601.00163","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-02T11:09:23Z","cross_cats_sorted":[],"title_canon_sha256":"4ab635cf0045c9df42f50bb0563b3ba9595a9bff0da8d8f1753f6c7087959360","abstract_canon_sha256":"eaeba6f84a068319d75b02b307bb92618a793e5ee1f081cd8e880ec0c9cce4d7"},"schema_version":"1.0"},"canonical_sha256":"c3b1faf6568e51e59250bdcd92a11510a02321253d168d52b1a63939560921c3","source":{"kind":"arxiv","id":"1601.00163","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00163","created_at":"2026-05-18T01:08:26Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00163v2","created_at":"2026-05-18T01:08:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00163","created_at":"2026-05-18T01:08:26Z"},{"alias_kind":"pith_short_12","alias_value":"YOY7V5SWRZI6","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YOY7V5SWRZI6LESQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YOY7V5SW","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YOY7V5SWRZI6LESQXXGZFIIVCC","target":"record","payload":{"canonical_record":{"source":{"id":"1601.00163","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-02T11:09:23Z","cross_cats_sorted":[],"title_canon_sha256":"4ab635cf0045c9df42f50bb0563b3ba9595a9bff0da8d8f1753f6c7087959360","abstract_canon_sha256":"eaeba6f84a068319d75b02b307bb92618a793e5ee1f081cd8e880ec0c9cce4d7"},"schema_version":"1.0"},"canonical_sha256":"c3b1faf6568e51e59250bdcd92a11510a02321253d168d52b1a63939560921c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:26.046268Z","signature_b64":"gQOy0WVGAiev92+z448Z89Z2rbw3aZj/DFiB1FhkH2dqbnYn02EkzzvZrWIGdOmNkk/XdH8Uve8p/ZL5SewqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3b1faf6568e51e59250bdcd92a11510a02321253d168d52b1a63939560921c3","last_reissued_at":"2026-05-18T01:08:26.045595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:26.045595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.00163","source_version":2,"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-18T01:08:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gLM00L+d06Vbhg9O7CCToBqLKSD7SkZsrckz56rkcRR5cLldAbQPtD+j2IfCY5b/Gka44k+JPQANEKqiT3O0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:09:48.508601Z"},"content_sha256":"10adb8a726f2d0aebd69eb938350570ea2087983c0da5f6e782753a555b69ad4","schema_version":"1.0","event_id":"sha256:10adb8a726f2d0aebd69eb938350570ea2087983c0da5f6e782753a555b69ad4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YOY7V5SWRZI6LESQXXGZFIIVCC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Parameterized Algorithm for Bounded-Degree Vertex Deletion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mingyu Xiao","submitted_at":"2016-01-02T11:09:23Z","abstract_excerpt":"The $d$-bounded-degree vertex deletion problem, to delete at most $k$ vertices in a given graph to make the maximum degree of the remaining graph at most $d$, finds applications in computational biology, social network analysis and some others. It can be regarded as a special case of the $(d+2)$-hitting set problem and generates the famous vertex cover problem. The $d$-bounded-degree vertex deletion problem is NP-hard for each fixed $d\\geq 0$. In terms of parameterized complexity, the problem parameterized by $k$ is W[2]-hard for unbounded $d$ and fixed-parameter tractable for each fixed $d\\ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00163","kind":"arxiv","version":2},"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-18T01:08:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHJg9Uv+WARRuB1HcQygp0djiGvYZJK/RcsDxGVLaSq1Dy3zluZWGNbyasm7uiDWaXcwscynpx+vctq3aSrmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:09:48.508972Z"},"content_sha256":"1274181e5f2f713aa461fea5de53a64a8a7fa0a1a2da13fc6308c4e9ed6691ac","schema_version":"1.0","event_id":"sha256:1274181e5f2f713aa461fea5de53a64a8a7fa0a1a2da13fc6308c4e9ed6691ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YOY7V5SWRZI6LESQXXGZFIIVCC/bundle.json","state_url":"https://pith.science/pith/YOY7V5SWRZI6LESQXXGZFIIVCC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YOY7V5SWRZI6LESQXXGZFIIVCC/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-05-28T12:09:48Z","links":{"resolver":"https://pith.science/pith/YOY7V5SWRZI6LESQXXGZFIIVCC","bundle":"https://pith.science/pith/YOY7V5SWRZI6LESQXXGZFIIVCC/bundle.json","state":"https://pith.science/pith/YOY7V5SWRZI6LESQXXGZFIIVCC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YOY7V5SWRZI6LESQXXGZFIIVCC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YOY7V5SWRZI6LESQXXGZFIIVCC","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":"eaeba6f84a068319d75b02b307bb92618a793e5ee1f081cd8e880ec0c9cce4d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-02T11:09:23Z","title_canon_sha256":"4ab635cf0045c9df42f50bb0563b3ba9595a9bff0da8d8f1753f6c7087959360"},"schema_version":"1.0","source":{"id":"1601.00163","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00163","created_at":"2026-05-18T01:08:26Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00163v2","created_at":"2026-05-18T01:08:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00163","created_at":"2026-05-18T01:08:26Z"},{"alias_kind":"pith_short_12","alias_value":"YOY7V5SWRZI6","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YOY7V5SWRZI6LESQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YOY7V5SW","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:1274181e5f2f713aa461fea5de53a64a8a7fa0a1a2da13fc6308c4e9ed6691ac","target":"graph","created_at":"2026-05-18T01:08:26Z","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":"The $d$-bounded-degree vertex deletion problem, to delete at most $k$ vertices in a given graph to make the maximum degree of the remaining graph at most $d$, finds applications in computational biology, social network analysis and some others. It can be regarded as a special case of the $(d+2)$-hitting set problem and generates the famous vertex cover problem. The $d$-bounded-degree vertex deletion problem is NP-hard for each fixed $d\\geq 0$. In terms of parameterized complexity, the problem parameterized by $k$ is W[2]-hard for unbounded $d$ and fixed-parameter tractable for each fixed $d\\ge","authors_text":"Mingyu Xiao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-02T11:09:23Z","title":"A Parameterized Algorithm for Bounded-Degree Vertex Deletion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00163","kind":"arxiv","version":2},"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:10adb8a726f2d0aebd69eb938350570ea2087983c0da5f6e782753a555b69ad4","target":"record","created_at":"2026-05-18T01:08:26Z","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":"eaeba6f84a068319d75b02b307bb92618a793e5ee1f081cd8e880ec0c9cce4d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-02T11:09:23Z","title_canon_sha256":"4ab635cf0045c9df42f50bb0563b3ba9595a9bff0da8d8f1753f6c7087959360"},"schema_version":"1.0","source":{"id":"1601.00163","kind":"arxiv","version":2}},"canonical_sha256":"c3b1faf6568e51e59250bdcd92a11510a02321253d168d52b1a63939560921c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3b1faf6568e51e59250bdcd92a11510a02321253d168d52b1a63939560921c3","first_computed_at":"2026-05-18T01:08:26.045595Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:26.045595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gQOy0WVGAiev92+z448Z89Z2rbw3aZj/DFiB1FhkH2dqbnYn02EkzzvZrWIGdOmNkk/XdH8Uve8p/ZL5SewqDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:26.046268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.00163","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10adb8a726f2d0aebd69eb938350570ea2087983c0da5f6e782753a555b69ad4","sha256:1274181e5f2f713aa461fea5de53a64a8a7fa0a1a2da13fc6308c4e9ed6691ac"],"state_sha256":"900aaddab53356f8c4eec1cf72c317ab34f02fc88924e4a298999f9389098ad5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VJM9yJsNarRf/7hAXBeqvOOqOm0q9QWNpi+VjqniwCjHmXbbgVEtsuje5mHYcIGjPakI22+8nt5ugydLt4IpAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:09:48.510983Z","bundle_sha256":"4bffe876dacba8ccacf5360f87ba551198618ece79d0dc5b516679fd7eab0517"}}