{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7T4OD3QZHF2D3KTHVWUSBXS2BP","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":"655daf8dd0c405c50dfe69839c589abe7b31f6f0e87387222561364051e0f434","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-22T21:05:26Z","title_canon_sha256":"17f1ff2e8d9da61bc4d616176a88520489dbf811055b6fdbdc0a6dcb5e4cd3c7"},"schema_version":"1.0","source":{"id":"1507.06341","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06341","created_at":"2026-05-18T01:33:15Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06341v2","created_at":"2026-05-18T01:33:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06341","created_at":"2026-05-18T01:33:15Z"},{"alias_kind":"pith_short_12","alias_value":"7T4OD3QZHF2D","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7T4OD3QZHF2D3KTH","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7T4OD3QZ","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:cbf4c60d9cb03a7405840d9bd616733033e2c6e7bb86d4d6737fe7190acde06c","target":"graph","created_at":"2026-05-18T01:33:15Z","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 $H$, the $H$-free Edge Deletion problem asks whether there exist at most $k$ edges whose deletion from the input graph $G$ results in a graph without any induced copy of $H$. We prove that $H$-free Edge Deletion is NP-complete if $H$ is a graph with at least two edges and $H$ has a component with maximum number of vertices which is a tree or a regular graph. Furthermore, we obtain that these NP-complete problems cannot be solved in parameterized subexponential time, i.e., in time $2^{o(k)}\\cdot |G|^{O(1)}$, unless Exponential Time Hypothesis fails.","authors_text":"Naveen Sivadasan, N. R. Aravind, R. B. Sandeep","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-22T21:05:26Z","title":"Parameterized lower bound and NP-completeness of some $H$-free Edge Deletion problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06341","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:598db075b6bc14ab588ac6d40dbd35d5c3af009fac8c59acca53fb3c5e3db787","target":"record","created_at":"2026-05-18T01:33:15Z","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":"655daf8dd0c405c50dfe69839c589abe7b31f6f0e87387222561364051e0f434","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-22T21:05:26Z","title_canon_sha256":"17f1ff2e8d9da61bc4d616176a88520489dbf811055b6fdbdc0a6dcb5e4cd3c7"},"schema_version":"1.0","source":{"id":"1507.06341","kind":"arxiv","version":2}},"canonical_sha256":"fcf8e1ee1939743daa67ada920de5a0be9d4c6af6016610d66000bc75481a361","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcf8e1ee1939743daa67ada920de5a0be9d4c6af6016610d66000bc75481a361","first_computed_at":"2026-05-18T01:33:15.395228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:15.395228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q3aNrvAML/wPmG2tR3STZhrTLeAVXQSL030vppoe+AQtGRQyIjPwlZcVurP+2fLtEnNc2ezqVgYFHMBnRyt3DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:15.395812Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.06341","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:598db075b6bc14ab588ac6d40dbd35d5c3af009fac8c59acca53fb3c5e3db787","sha256:cbf4c60d9cb03a7405840d9bd616733033e2c6e7bb86d4d6737fe7190acde06c"],"state_sha256":"0cfba919e94215974a50c5878fa39ebe2eb8192eb5613defedcd32e67fc3ef5e"}