{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CF37HATX37QO25EH253VOGDH3C","short_pith_number":"pith:CF37HATX","schema_version":"1.0","canonical_sha256":"1177f38277dfe0ed7487d777571867d89d67dfdf7961fbcca65472858ea8f673","source":{"kind":"arxiv","id":"1511.05449","version":2},"attestation_state":"computed","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 $"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.05449","created_at":"2026-05-18T01:14:44.661812+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.05449v2","created_at":"2026-05-18T01:14:44.661812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05449","created_at":"2026-05-18T01:14:44.661812+00:00"},{"alias_kind":"pith_short_12","alias_value":"CF37HATX37QO","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CF37HATX37QO25EH","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CF37HATX","created_at":"2026-05-18T12:29:14.074870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.24280","citing_title":"A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CF37HATX37QO25EH253VOGDH3C","json":"https://pith.science/pith/CF37HATX37QO25EH253VOGDH3C.json","graph_json":"https://pith.science/api/pith-number/CF37HATX37QO25EH253VOGDH3C/graph.json","events_json":"https://pith.science/api/pith-number/CF37HATX37QO25EH253VOGDH3C/events.json","paper":"https://pith.science/paper/CF37HATX"},"agent_actions":{"view_html":"https://pith.science/pith/CF37HATX37QO25EH253VOGDH3C","download_json":"https://pith.science/pith/CF37HATX37QO25EH253VOGDH3C.json","view_paper":"https://pith.science/paper/CF37HATX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.05449&json=true","fetch_graph":"https://pith.science/api/pith-number/CF37HATX37QO25EH253VOGDH3C/graph.json","fetch_events":"https://pith.science/api/pith-number/CF37HATX37QO25EH253VOGDH3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CF37HATX37QO25EH253VOGDH3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CF37HATX37QO25EH253VOGDH3C/action/storage_attestation","attest_author":"https://pith.science/pith/CF37HATX37QO25EH253VOGDH3C/action/author_attestation","sign_citation":"https://pith.science/pith/CF37HATX37QO25EH253VOGDH3C/action/citation_signature","submit_replication":"https://pith.science/pith/CF37HATX37QO25EH253VOGDH3C/action/replication_record"}},"created_at":"2026-05-18T01:14:44.661812+00:00","updated_at":"2026-05-18T01:14:44.661812+00:00"}