{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NCIWP4QI4A2ZDHBLKJANWHWJ4E","short_pith_number":"pith:NCIWP4QI","schema_version":"1.0","canonical_sha256":"689167f208e035919c2b5240db1ec9e1134bbce68c64d49c9bf764b045473189","source":{"kind":"arxiv","id":"1507.08792","version":2},"attestation_state":"computed","paper":{"title":"A cubic vertex kernel for Diamond-free Edge Deletion and more","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Naveen Sivadasan, R. B. Sandeep","submitted_at":"2015-07-31T08:06:38Z","abstract_excerpt":"A diamond is a graph obtained by removing an edge from a complete graph on four vertices. A graph is diamond-free if it does not contain an induced diamond. The Diamond-free Edge Deletion problem asks whether there exist at most $k$ edges in the input graph $G$ whose deletion results in a diamond-free graph. For this problem, a polynomial kernel of $O(k^4$) vertices was found by Fellows et. al. (Discrete Optimization, 2011).\n  In this paper, we give an improved kernel of $O(k^3)$ vertices for Diamond-free Edge Deletion. Further, we give an $O(k^2)$ vertex kernel for a related problem {Diamond,"},"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.08792","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-31T08:06:38Z","cross_cats_sorted":[],"title_canon_sha256":"d920bad0c2f74d101d8639dbcb4f4511efa24d0b6a3fd3caf17b0e923b641494","abstract_canon_sha256":"e2ffe720b3846afaee80da1d52217e45ed7bcca3214f10eb8877b33600b4c75e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:33.427221Z","signature_b64":"vByGx48hxyBA70bGS5VVzjcSJ+0F7NAjywP8xKLl64g+w/wjY8Dh8inZVhbmz/wRxqf9qIxoNGPgjq3cW6hlBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"689167f208e035919c2b5240db1ec9e1134bbce68c64d49c9bf764b045473189","last_reissued_at":"2026-05-18T01:23:33.424796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:33.424796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A cubic vertex kernel for Diamond-free Edge Deletion and more","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Naveen Sivadasan, R. B. Sandeep","submitted_at":"2015-07-31T08:06:38Z","abstract_excerpt":"A diamond is a graph obtained by removing an edge from a complete graph on four vertices. A graph is diamond-free if it does not contain an induced diamond. The Diamond-free Edge Deletion problem asks whether there exist at most $k$ edges in the input graph $G$ whose deletion results in a diamond-free graph. For this problem, a polynomial kernel of $O(k^4$) vertices was found by Fellows et. al. (Discrete Optimization, 2011).\n  In this paper, we give an improved kernel of $O(k^3)$ vertices for Diamond-free Edge Deletion. Further, we give an $O(k^2)$ vertex kernel for a related problem {Diamond,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08792","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.08792","created_at":"2026-05-18T01:23:33.424882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.08792v2","created_at":"2026-05-18T01:23:33.424882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08792","created_at":"2026-05-18T01:23:33.424882+00:00"},{"alias_kind":"pith_short_12","alias_value":"NCIWP4QI4A2Z","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NCIWP4QI4A2ZDHBL","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NCIWP4QI","created_at":"2026-05-18T12:29:32.376354+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/NCIWP4QI4A2ZDHBLKJANWHWJ4E","json":"https://pith.science/pith/NCIWP4QI4A2ZDHBLKJANWHWJ4E.json","graph_json":"https://pith.science/api/pith-number/NCIWP4QI4A2ZDHBLKJANWHWJ4E/graph.json","events_json":"https://pith.science/api/pith-number/NCIWP4QI4A2ZDHBLKJANWHWJ4E/events.json","paper":"https://pith.science/paper/NCIWP4QI"},"agent_actions":{"view_html":"https://pith.science/pith/NCIWP4QI4A2ZDHBLKJANWHWJ4E","download_json":"https://pith.science/pith/NCIWP4QI4A2ZDHBLKJANWHWJ4E.json","view_paper":"https://pith.science/paper/NCIWP4QI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.08792&json=true","fetch_graph":"https://pith.science/api/pith-number/NCIWP4QI4A2ZDHBLKJANWHWJ4E/graph.json","fetch_events":"https://pith.science/api/pith-number/NCIWP4QI4A2ZDHBLKJANWHWJ4E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NCIWP4QI4A2ZDHBLKJANWHWJ4E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NCIWP4QI4A2ZDHBLKJANWHWJ4E/action/storage_attestation","attest_author":"https://pith.science/pith/NCIWP4QI4A2ZDHBLKJANWHWJ4E/action/author_attestation","sign_citation":"https://pith.science/pith/NCIWP4QI4A2ZDHBLKJANWHWJ4E/action/citation_signature","submit_replication":"https://pith.science/pith/NCIWP4QI4A2ZDHBLKJANWHWJ4E/action/replication_record"}},"created_at":"2026-05-18T01:23:33.424882+00:00","updated_at":"2026-05-18T01:23:33.424882+00:00"}