{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CF37HATX37QO25EH253VOGDH3C","short_pith_number":"pith:CF37HATX","canonical_record":{"source":{"id":"1511.05449","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-17T15:59:57Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"3e98f32dc02ab02219246804b8b11301284c2c2924784a9b4c43dafe5b9bb716","abstract_canon_sha256":"d7235fd92e368a25447a60760fe2380577c00ddbdc72a0405f611ad180bec10a"},"schema_version":"1.0"},"canonical_sha256":"1177f38277dfe0ed7487d777571867d89d67dfdf7961fbcca65472858ea8f673","source":{"kind":"arxiv","id":"1511.05449","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05449","created_at":"2026-05-18T01:14:44Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05449v2","created_at":"2026-05-18T01:14:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05449","created_at":"2026-05-18T01:14:44Z"},{"alias_kind":"pith_short_12","alias_value":"CF37HATX37QO","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CF37HATX37QO25EH","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CF37HATX","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CF37HATX37QO25EH253VOGDH3C","target":"record","payload":{"canonical_record":{"source":{"id":"1511.05449","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-17T15:59:57Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"3e98f32dc02ab02219246804b8b11301284c2c2924784a9b4c43dafe5b9bb716","abstract_canon_sha256":"d7235fd92e368a25447a60760fe2380577c00ddbdc72a0405f611ad180bec10a"},"schema_version":"1.0"},"canonical_sha256":"1177f38277dfe0ed7487d777571867d89d67dfdf7961fbcca65472858ea8f673","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:44.662372Z","signature_b64":"zV0U10aAu0dqndP4lRqUB5KMTcOTBzg0Yk+Uxlk/tXLkwUwIehekgSWIeIwNKmqnOM39I0TYNmDE+VnBvz75BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1177f38277dfe0ed7487d777571867d89d67dfdf7961fbcca65472858ea8f673","last_reissued_at":"2026-05-18T01:14:44.661688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:44.661688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.05449","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:14:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cR3zoo/jcb/5W3IY86372H9mvfk0MMvvm41IdN0opm26avt9pBXyItnCzQaD9xre4fD0rCy4M5OhcHdUOCYkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T07:24:55.303983Z"},"content_sha256":"b5deac80fd096d3b9904f38606de11a25384e0fa9e749ff7492ecbf5f14a976f","schema_version":"1.0","event_id":"sha256:b5deac80fd096d3b9904f38606de11a25384e0fa9e749ff7492ecbf5f14a976f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CF37HATX37QO25EH253VOGDH3C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Running Time Lower Bounds for Vertex Deletion Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Christian Komusiewicz","submitted_at":"2015-11-17T15:59:57Z","abstract_excerpt":"For a graph class $\\Pi$, the $\\Pi$-Vertex Deletion problem has as input an undirected graph $G=(V,E)$ and an integer $k$ and asks whether there is a set of at most $k$ vertices that can be deleted from $G$ such that the resulting graph is a member of $\\Pi$. By a classic result of Lewis and Yannakakis [J. Comput. Syst. Sci. '80], $\\Pi$-Vertex Deletion is NP-hard for all hereditary properties $\\Pi$. We adapt the original NP-hardness construction to show that under the Exponential Time Hypothesis (ETH) tight complexity results can be obtained. We show that $\\Pi$-Vertex Deletion does not admit a $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05449","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:14:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WYGvDHWXGzVW7FQOJ90bNv9p23wBruQogMqdya5Lsvaw9FaEWG4mdW0ku8OErCZBFsGGJEfpJcsYWBRHSKTpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T07:24:55.304348Z"},"content_sha256":"9b0e09f6ea8f3087e5b5815b8bfaece04211f3afe943ef22f76b1d355d93b5d8","schema_version":"1.0","event_id":"sha256:9b0e09f6ea8f3087e5b5815b8bfaece04211f3afe943ef22f76b1d355d93b5d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CF37HATX37QO25EH253VOGDH3C/bundle.json","state_url":"https://pith.science/pith/CF37HATX37QO25EH253VOGDH3C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CF37HATX37QO25EH253VOGDH3C/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-07-02T07:24:55Z","links":{"resolver":"https://pith.science/pith/CF37HATX37QO25EH253VOGDH3C","bundle":"https://pith.science/pith/CF37HATX37QO25EH253VOGDH3C/bundle.json","state":"https://pith.science/pith/CF37HATX37QO25EH253VOGDH3C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CF37HATX37QO25EH253VOGDH3C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CF37HATX37QO25EH253VOGDH3C","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":"d7235fd92e368a25447a60760fe2380577c00ddbdc72a0405f611ad180bec10a","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-17T15:59:57Z","title_canon_sha256":"3e98f32dc02ab02219246804b8b11301284c2c2924784a9b4c43dafe5b9bb716"},"schema_version":"1.0","source":{"id":"1511.05449","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05449","created_at":"2026-05-18T01:14:44Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05449v2","created_at":"2026-05-18T01:14:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05449","created_at":"2026-05-18T01:14:44Z"},{"alias_kind":"pith_short_12","alias_value":"CF37HATX37QO","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CF37HATX37QO25EH","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CF37HATX","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:9b0e09f6ea8f3087e5b5815b8bfaece04211f3afe943ef22f76b1d355d93b5d8","target":"graph","created_at":"2026-05-18T01:14:44Z","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":"For a graph class $\\Pi$, the $\\Pi$-Vertex Deletion problem has as input an undirected graph $G=(V,E)$ and an integer $k$ and asks whether there is a set of at most $k$ vertices that can be deleted from $G$ such that the resulting graph is a member of $\\Pi$. By a classic result of Lewis and Yannakakis [J. Comput. Syst. Sci. '80], $\\Pi$-Vertex Deletion is NP-hard for all hereditary properties $\\Pi$. We adapt the original NP-hardness construction to show that under the Exponential Time Hypothesis (ETH) tight complexity results can be obtained. We show that $\\Pi$-Vertex Deletion does not admit a $","authors_text":"Christian Komusiewicz","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-17T15:59:57Z","title":"Tight Running Time Lower Bounds for Vertex Deletion Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05449","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:b5deac80fd096d3b9904f38606de11a25384e0fa9e749ff7492ecbf5f14a976f","target":"record","created_at":"2026-05-18T01:14:44Z","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":"d7235fd92e368a25447a60760fe2380577c00ddbdc72a0405f611ad180bec10a","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-17T15:59:57Z","title_canon_sha256":"3e98f32dc02ab02219246804b8b11301284c2c2924784a9b4c43dafe5b9bb716"},"schema_version":"1.0","source":{"id":"1511.05449","kind":"arxiv","version":2}},"canonical_sha256":"1177f38277dfe0ed7487d777571867d89d67dfdf7961fbcca65472858ea8f673","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1177f38277dfe0ed7487d777571867d89d67dfdf7961fbcca65472858ea8f673","first_computed_at":"2026-05-18T01:14:44.661688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:44.661688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zV0U10aAu0dqndP4lRqUB5KMTcOTBzg0Yk+Uxlk/tXLkwUwIehekgSWIeIwNKmqnOM39I0TYNmDE+VnBvz75BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:44.662372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05449","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5deac80fd096d3b9904f38606de11a25384e0fa9e749ff7492ecbf5f14a976f","sha256:9b0e09f6ea8f3087e5b5815b8bfaece04211f3afe943ef22f76b1d355d93b5d8"],"state_sha256":"8dd002c4f22946678fe47032674fb4e3cb964e687ef61ef754887545c8decae0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"00xDrLnrJc1hAnQheM0HnvVAq2khebgbUAyHQ4zKotb7kgnA7YhnaiAVCNB+K2BIXEysZdhIjo5WC1dmPRqqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T07:24:55.306415Z","bundle_sha256":"6a7a4b2e7692ad0dfee96f5fa4ad1667d2c6e98affd297fe3ff2f33f97d8ef8b"}}