{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DEI22BD6FNPRP55YCSRY2HGQVP","short_pith_number":"pith:DEI22BD6","canonical_record":{"source":{"id":"1707.08690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T02:57:15Z","cross_cats_sorted":[],"title_canon_sha256":"116444a770727ddebe8dda2646dd3b2c14f1103f56db079df53d8c5a404f47a7","abstract_canon_sha256":"2853559d7b6e8644350b7b2484cf0bc092d1ff57342131beb7ac1535460cba52"},"schema_version":"1.0"},"canonical_sha256":"1911ad047e2b5f17f7b814a38d1cd0abf00ca6cd49a31422e951d33aa1ea2d90","source":{"kind":"arxiv","id":"1707.08690","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08690","created_at":"2026-05-18T00:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08690v2","created_at":"2026-05-18T00:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08690","created_at":"2026-05-18T00:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"DEI22BD6FNPR","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DEI22BD6FNPRP55Y","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DEI22BD6","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DEI22BD6FNPRP55YCSRY2HGQVP","target":"record","payload":{"canonical_record":{"source":{"id":"1707.08690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T02:57:15Z","cross_cats_sorted":[],"title_canon_sha256":"116444a770727ddebe8dda2646dd3b2c14f1103f56db079df53d8c5a404f47a7","abstract_canon_sha256":"2853559d7b6e8644350b7b2484cf0bc092d1ff57342131beb7ac1535460cba52"},"schema_version":"1.0"},"canonical_sha256":"1911ad047e2b5f17f7b814a38d1cd0abf00ca6cd49a31422e951d33aa1ea2d90","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:06.317955Z","signature_b64":"boQuNF9CkCLKbR4I4Sbzqb48rVdapmU/2ydDALAhrq9am2IvTJdh1wJkmgeEg3r/16uefmDBTolWMoPntY0/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1911ad047e2b5f17f7b814a38d1cd0abf00ca6cd49a31422e951d33aa1ea2d90","last_reissued_at":"2026-05-18T00:39:06.317306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:06.317306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.08690","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-18T00:39:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0UIGyH4u41wcFUA/1ZpaxOPzSviG9akQDhG0eq+R1gJe/TyvL2ZW4Rs0W8Yz0RDpNxOvVuSvUVOgtQNiRh21Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:51:15.520580Z"},"content_sha256":"2ea47129481a11380e948eca040e45008e54f91f3a03920bc88db6a9ced17c17","schema_version":"1.0","event_id":"sha256:2ea47129481a11380e948eca040e45008e54f91f3a03920bc88db6a9ced17c17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DEI22BD6FNPRP55YCSRY2HGQVP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vertex Deletion Problems on Chordal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jie You, Yixin Cao, Yota Otachi, Yuping Ke","submitted_at":"2017-07-27T02:57:15Z","abstract_excerpt":"Containing many classic optimization problems, the family of vertex deletion problems has an important position in algorithm and complexity study. The celebrated result of Lewis and Yannakakis gives a complete dichotomy of their complexity. It however has nothing to say about the case when the input graph is also special. This paper initiates a systematic study of vertex deletion problems from one subclass of chordal graphs to another. We give polynomial-time algorithms or proofs of NP-completeness for most of the problems. In particular, we show that the vertex deletion problem from chordal g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08690","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-18T00:39:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ib2/aBgKkLbWXw1TyLaOMNQry3xQCzFdZMvh/a9vHkubtrSqMpNUpkGttCe9JlXzqVDIyNIJsXMX3eZ6UC/XBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:51:15.520934Z"},"content_sha256":"3dae505448633e097d3b0a65ba4a5eb4fb8ae07599b740668de374897d72422f","schema_version":"1.0","event_id":"sha256:3dae505448633e097d3b0a65ba4a5eb4fb8ae07599b740668de374897d72422f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DEI22BD6FNPRP55YCSRY2HGQVP/bundle.json","state_url":"https://pith.science/pith/DEI22BD6FNPRP55YCSRY2HGQVP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DEI22BD6FNPRP55YCSRY2HGQVP/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-02T21:51:15Z","links":{"resolver":"https://pith.science/pith/DEI22BD6FNPRP55YCSRY2HGQVP","bundle":"https://pith.science/pith/DEI22BD6FNPRP55YCSRY2HGQVP/bundle.json","state":"https://pith.science/pith/DEI22BD6FNPRP55YCSRY2HGQVP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DEI22BD6FNPRP55YCSRY2HGQVP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DEI22BD6FNPRP55YCSRY2HGQVP","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":"2853559d7b6e8644350b7b2484cf0bc092d1ff57342131beb7ac1535460cba52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T02:57:15Z","title_canon_sha256":"116444a770727ddebe8dda2646dd3b2c14f1103f56db079df53d8c5a404f47a7"},"schema_version":"1.0","source":{"id":"1707.08690","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08690","created_at":"2026-05-18T00:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08690v2","created_at":"2026-05-18T00:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08690","created_at":"2026-05-18T00:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"DEI22BD6FNPR","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DEI22BD6FNPRP55Y","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DEI22BD6","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:3dae505448633e097d3b0a65ba4a5eb4fb8ae07599b740668de374897d72422f","target":"graph","created_at":"2026-05-18T00:39:06Z","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":"Containing many classic optimization problems, the family of vertex deletion problems has an important position in algorithm and complexity study. The celebrated result of Lewis and Yannakakis gives a complete dichotomy of their complexity. It however has nothing to say about the case when the input graph is also special. This paper initiates a systematic study of vertex deletion problems from one subclass of chordal graphs to another. We give polynomial-time algorithms or proofs of NP-completeness for most of the problems. In particular, we show that the vertex deletion problem from chordal g","authors_text":"Jie You, Yixin Cao, Yota Otachi, Yuping Ke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T02:57:15Z","title":"Vertex Deletion Problems on Chordal Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08690","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:2ea47129481a11380e948eca040e45008e54f91f3a03920bc88db6a9ced17c17","target":"record","created_at":"2026-05-18T00:39:06Z","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":"2853559d7b6e8644350b7b2484cf0bc092d1ff57342131beb7ac1535460cba52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-27T02:57:15Z","title_canon_sha256":"116444a770727ddebe8dda2646dd3b2c14f1103f56db079df53d8c5a404f47a7"},"schema_version":"1.0","source":{"id":"1707.08690","kind":"arxiv","version":2}},"canonical_sha256":"1911ad047e2b5f17f7b814a38d1cd0abf00ca6cd49a31422e951d33aa1ea2d90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1911ad047e2b5f17f7b814a38d1cd0abf00ca6cd49a31422e951d33aa1ea2d90","first_computed_at":"2026-05-18T00:39:06.317306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:06.317306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"boQuNF9CkCLKbR4I4Sbzqb48rVdapmU/2ydDALAhrq9am2IvTJdh1wJkmgeEg3r/16uefmDBTolWMoPntY0/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:06.317955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08690","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ea47129481a11380e948eca040e45008e54f91f3a03920bc88db6a9ced17c17","sha256:3dae505448633e097d3b0a65ba4a5eb4fb8ae07599b740668de374897d72422f"],"state_sha256":"a21121b2717873a6d148ee61baa52c49fd07fd0f66c7fa1f6a894f3a1eded406"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TnmzNwo1zKvXuH2NIhmBKXKGOmV5G86P3z43T7jiLabBh1fyJKDrIEkPrkdnvg+weLbZiGpJzuhJbYJPqF2kBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:51:15.522889Z","bundle_sha256":"724756d28a3bf8eb9bab59fa16f5ccb8d61cc4d7f2a230869303fb87d215eedc"}}