{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7T4OD3QZHF2D3KTHVWUSBXS2BP","short_pith_number":"pith:7T4OD3QZ","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"},"canonical_sha256":"fcf8e1ee1939743daa67ada920de5a0be9d4c6af6016610d66000bc75481a361","source":{"kind":"arxiv","id":"1507.06341","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7T4OD3QZHF2D3KTHVWUSBXS2BP","target":"record","payload":{"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"},"canonical_sha256":"fcf8e1ee1939743daa67ada920de5a0be9d4c6af6016610d66000bc75481a361","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"},"source_kind":"arxiv","source_id":"1507.06341","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:33:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"amphS7WWTZCrx4+ihgn6HLruCnZaUE+jmCoIoYvA5WIv02KLdEqhT5fstt35mO3fiDNy1PxHi/fyRsITHgfCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:33:43.808405Z"},"content_sha256":"598db075b6bc14ab588ac6d40dbd35d5c3af009fac8c59acca53fb3c5e3db787","schema_version":"1.0","event_id":"sha256:598db075b6bc14ab588ac6d40dbd35d5c3af009fac8c59acca53fb3c5e3db787"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7T4OD3QZHF2D3KTHVWUSBXS2BP","target":"graph","payload":{"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"},"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:33:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xa3WMH3xq06gJLm+Jf1YDRdMIq0cF+pKzQ9TuqiwCHHSFVp5JU3IiUAxoqrQeLS98V/8kBm2h0xtXCTtxizqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:33:43.808771Z"},"content_sha256":"cbf4c60d9cb03a7405840d9bd616733033e2c6e7bb86d4d6737fe7190acde06c","schema_version":"1.0","event_id":"sha256:cbf4c60d9cb03a7405840d9bd616733033e2c6e7bb86d4d6737fe7190acde06c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7T4OD3QZHF2D3KTHVWUSBXS2BP/bundle.json","state_url":"https://pith.science/pith/7T4OD3QZHF2D3KTHVWUSBXS2BP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7T4OD3QZHF2D3KTHVWUSBXS2BP/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-24T04:33:43Z","links":{"resolver":"https://pith.science/pith/7T4OD3QZHF2D3KTHVWUSBXS2BP","bundle":"https://pith.science/pith/7T4OD3QZHF2D3KTHVWUSBXS2BP/bundle.json","state":"https://pith.science/pith/7T4OD3QZHF2D3KTHVWUSBXS2BP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7T4OD3QZHF2D3KTHVWUSBXS2BP/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ez3KLwYFErYCVm8fl8Olqsj7MidM0NUdyJx9C9rmHrxDpEAWG2X0XvXtsbakX1E5tUs6xIJOzu7u/CAetq5ZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:33:43.810702Z","bundle_sha256":"4281b2a5b4dccb9b555db6b976d8bdf869eb318a27a60b38fa56ead8c103b6a3"}}