{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7T4OD3QZHF2D3KTHVWUSBXS2BP","short_pith_number":"pith:7T4OD3QZ","schema_version":"1.0","canonical_sha256":"fcf8e1ee1939743daa67ada920de5a0be9d4c6af6016610d66000bc75481a361","source":{"kind":"arxiv","id":"1507.06341","version":2},"attestation_state":"computed","paper":{"title":"Parameterized lower bound and NP-completeness of some $H$-free Edge Deletion problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Naveen Sivadasan, N. R. Aravind, R. B. Sandeep","submitted_at":"2015-07-22T21:05:26Z","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."},"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":"1507.06341","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-22T21:05:26Z","cross_cats_sorted":[],"title_canon_sha256":"17f1ff2e8d9da61bc4d616176a88520489dbf811055b6fdbdc0a6dcb5e4cd3c7","abstract_canon_sha256":"655daf8dd0c405c50dfe69839c589abe7b31f6f0e87387222561364051e0f434"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:15.395812Z","signature_b64":"Q3aNrvAML/wPmG2tR3STZhrTLeAVXQSL030vppoe+AQtGRQyIjPwlZcVurP+2fLtEnNc2ezqVgYFHMBnRyt3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcf8e1ee1939743daa67ada920de5a0be9d4c6af6016610d66000bc75481a361","last_reissued_at":"2026-05-18T01:33:15.395228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:15.395228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized lower bound and NP-completeness of some $H$-free Edge Deletion problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Naveen Sivadasan, N. R. Aravind, R. B. Sandeep","submitted_at":"2015-07-22T21:05:26Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06341","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":"1507.06341","created_at":"2026-05-18T01:33:15.395328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.06341v2","created_at":"2026-05-18T01:33:15.395328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06341","created_at":"2026-05-18T01:33:15.395328+00:00"},{"alias_kind":"pith_short_12","alias_value":"7T4OD3QZHF2D","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7T4OD3QZHF2D3KTH","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7T4OD3QZ","created_at":"2026-05-18T12:29:10.953037+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7T4OD3QZHF2D3KTHVWUSBXS2BP","json":"https://pith.science/pith/7T4OD3QZHF2D3KTHVWUSBXS2BP.json","graph_json":"https://pith.science/api/pith-number/7T4OD3QZHF2D3KTHVWUSBXS2BP/graph.json","events_json":"https://pith.science/api/pith-number/7T4OD3QZHF2D3KTHVWUSBXS2BP/events.json","paper":"https://pith.science/paper/7T4OD3QZ"},"agent_actions":{"view_html":"https://pith.science/pith/7T4OD3QZHF2D3KTHVWUSBXS2BP","download_json":"https://pith.science/pith/7T4OD3QZHF2D3KTHVWUSBXS2BP.json","view_paper":"https://pith.science/paper/7T4OD3QZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.06341&json=true","fetch_graph":"https://pith.science/api/pith-number/7T4OD3QZHF2D3KTHVWUSBXS2BP/graph.json","fetch_events":"https://pith.science/api/pith-number/7T4OD3QZHF2D3KTHVWUSBXS2BP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7T4OD3QZHF2D3KTHVWUSBXS2BP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7T4OD3QZHF2D3KTHVWUSBXS2BP/action/storage_attestation","attest_author":"https://pith.science/pith/7T4OD3QZHF2D3KTHVWUSBXS2BP/action/author_attestation","sign_citation":"https://pith.science/pith/7T4OD3QZHF2D3KTHVWUSBXS2BP/action/citation_signature","submit_replication":"https://pith.science/pith/7T4OD3QZHF2D3KTHVWUSBXS2BP/action/replication_record"}},"created_at":"2026-05-18T01:33:15.395328+00:00","updated_at":"2026-05-18T01:33:15.395328+00:00"}