{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NCIWP4QI4A2ZDHBLKJANWHWJ4E","short_pith_number":"pith:NCIWP4QI","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"},"canonical_sha256":"689167f208e035919c2b5240db1ec9e1134bbce68c64d49c9bf764b045473189","source":{"kind":"arxiv","id":"1507.08792","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08792","created_at":"2026-05-18T01:23:33Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08792v2","created_at":"2026-05-18T01:23:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08792","created_at":"2026-05-18T01:23:33Z"},{"alias_kind":"pith_short_12","alias_value":"NCIWP4QI4A2Z","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NCIWP4QI4A2ZDHBL","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NCIWP4QI","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NCIWP4QI4A2ZDHBLKJANWHWJ4E","target":"record","payload":{"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"},"canonical_sha256":"689167f208e035919c2b5240db1ec9e1134bbce68c64d49c9bf764b045473189","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"},"source_kind":"arxiv","source_id":"1507.08792","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:23:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rmvxlgbqlD//qGG1BH/OWO4/dFTCP7DXmcssmT/j2A6m8dDRNs6+g35OQMP3pYET9CpjcmyW00XBKP/V7ap7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:50:14.984297Z"},"content_sha256":"4068957b9a4b7ebc8462b9accad701c507abe9ce0cfce0590047e25ac95a5f73","schema_version":"1.0","event_id":"sha256:4068957b9a4b7ebc8462b9accad701c507abe9ce0cfce0590047e25ac95a5f73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NCIWP4QI4A2ZDHBLKJANWHWJ4E","target":"graph","payload":{"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"},"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:23:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iOqGh4hcnJFupz7ro4ZHUX9PU2tDw4alekPeQIe6bgPqtGgGIMGJ1CbPs5xgNd4ZNYKonZYAxbBTGKU0ux9ZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:50:14.984665Z"},"content_sha256":"108b59ef7d04f2de95081f6aa1ccfbd72b50a23d4e81075a4bc336693a09fff3","schema_version":"1.0","event_id":"sha256:108b59ef7d04f2de95081f6aa1ccfbd72b50a23d4e81075a4bc336693a09fff3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NCIWP4QI4A2ZDHBLKJANWHWJ4E/bundle.json","state_url":"https://pith.science/pith/NCIWP4QI4A2ZDHBLKJANWHWJ4E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NCIWP4QI4A2ZDHBLKJANWHWJ4E/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-24T08:50:14Z","links":{"resolver":"https://pith.science/pith/NCIWP4QI4A2ZDHBLKJANWHWJ4E","bundle":"https://pith.science/pith/NCIWP4QI4A2ZDHBLKJANWHWJ4E/bundle.json","state":"https://pith.science/pith/NCIWP4QI4A2ZDHBLKJANWHWJ4E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NCIWP4QI4A2ZDHBLKJANWHWJ4E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NCIWP4QI4A2ZDHBLKJANWHWJ4E","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":"e2ffe720b3846afaee80da1d52217e45ed7bcca3214f10eb8877b33600b4c75e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-31T08:06:38Z","title_canon_sha256":"d920bad0c2f74d101d8639dbcb4f4511efa24d0b6a3fd3caf17b0e923b641494"},"schema_version":"1.0","source":{"id":"1507.08792","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08792","created_at":"2026-05-18T01:23:33Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08792v2","created_at":"2026-05-18T01:23:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08792","created_at":"2026-05-18T01:23:33Z"},{"alias_kind":"pith_short_12","alias_value":"NCIWP4QI4A2Z","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NCIWP4QI4A2ZDHBL","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NCIWP4QI","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:108b59ef7d04f2de95081f6aa1ccfbd72b50a23d4e81075a4bc336693a09fff3","target":"graph","created_at":"2026-05-18T01:23:33Z","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":"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,","authors_text":"Naveen Sivadasan, R. B. Sandeep","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-31T08:06:38Z","title":"A cubic vertex kernel for Diamond-free Edge Deletion and more"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08792","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:4068957b9a4b7ebc8462b9accad701c507abe9ce0cfce0590047e25ac95a5f73","target":"record","created_at":"2026-05-18T01:23:33Z","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":"e2ffe720b3846afaee80da1d52217e45ed7bcca3214f10eb8877b33600b4c75e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-31T08:06:38Z","title_canon_sha256":"d920bad0c2f74d101d8639dbcb4f4511efa24d0b6a3fd3caf17b0e923b641494"},"schema_version":"1.0","source":{"id":"1507.08792","kind":"arxiv","version":2}},"canonical_sha256":"689167f208e035919c2b5240db1ec9e1134bbce68c64d49c9bf764b045473189","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"689167f208e035919c2b5240db1ec9e1134bbce68c64d49c9bf764b045473189","first_computed_at":"2026-05-18T01:23:33.424796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:33.424796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vByGx48hxyBA70bGS5VVzjcSJ+0F7NAjywP8xKLl64g+w/wjY8Dh8inZVhbmz/wRxqf9qIxoNGPgjq3cW6hlBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:33.427221Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08792","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4068957b9a4b7ebc8462b9accad701c507abe9ce0cfce0590047e25ac95a5f73","sha256:108b59ef7d04f2de95081f6aa1ccfbd72b50a23d4e81075a4bc336693a09fff3"],"state_sha256":"7578758daa8455a37b108dc12cadbe8ea326246e715ced2870fb4c9f87937d49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OvM2rjrFbVfxoa169F2cTX6A5A6Mpp/tyTT7Xk1xLlZ23eVnAVHBL0bPeiaOxqymjt5CVfYq+D1MoV3IG+VaCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T08:50:14.986691Z","bundle_sha256":"6c425a350058fe5263620d4f5354236360474f6f56660b0644d90e37f2ee1e0f"}}