{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RFYBNVCLH7WKJRHDEIE2FUGJ2O","short_pith_number":"pith:RFYBNVCL","canonical_record":{"source":{"id":"1707.06779","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-21T07:19:03Z","cross_cats_sorted":[],"title_canon_sha256":"8b2b9fd197f3770ac3a1a5cd32f7b3a9e77a60d8247cf48d2e5311ce3b9c082a","abstract_canon_sha256":"f159c6ced6c25aa41bb2c12b2e513dc420c9051aa3b3bc76275074404efde984"},"schema_version":"1.0"},"canonical_sha256":"897016d44b3feca4c4e32209a2d0c9d3975e330addb5ba8dd9050dd33389d2fb","source":{"kind":"arxiv","id":"1707.06779","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06779","created_at":"2026-07-05T03:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06779v3","created_at":"2026-07-05T03:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06779","created_at":"2026-07-05T03:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"RFYBNVCLH7WK","created_at":"2026-07-05T03:45:22Z"},{"alias_kind":"pith_short_16","alias_value":"RFYBNVCLH7WKJRHD","created_at":"2026-07-05T03:45:22Z"},{"alias_kind":"pith_short_8","alias_value":"RFYBNVCL","created_at":"2026-07-05T03:45:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RFYBNVCLH7WKJRHDEIE2FUGJ2O","target":"record","payload":{"canonical_record":{"source":{"id":"1707.06779","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-21T07:19:03Z","cross_cats_sorted":[],"title_canon_sha256":"8b2b9fd197f3770ac3a1a5cd32f7b3a9e77a60d8247cf48d2e5311ce3b9c082a","abstract_canon_sha256":"f159c6ced6c25aa41bb2c12b2e513dc420c9051aa3b3bc76275074404efde984"},"schema_version":"1.0"},"canonical_sha256":"897016d44b3feca4c4e32209a2d0c9d3975e330addb5ba8dd9050dd33389d2fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:45:22.318496Z","signature_b64":"Xk9hxCQ+o9uj+2iEK5tCQpmxz6re8lPOq6F0zm7xrPcpm/h9nJhm/Pq79J1tIr2vf382VHoPvQhFrt2ktciVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"897016d44b3feca4c4e32209a2d0c9d3975e330addb5ba8dd9050dd33389d2fb","last_reissued_at":"2026-07-05T03:45:22.318086Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:45:22.318086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.06779","source_version":3,"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-07-05T03:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9TxApCFlSpdkOyuF1/U7ifG37Ts+oF4pmxZ9YCl6dLQM15Kh1lg9vCRoNXUB+0ZsSBgq/aEP+ZPTlIEcOnieCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:08:47.802163Z"},"content_sha256":"92fe65628c8f815c11fea56c26c4097a0589176f887ba7fb76ecd2dc9c30d12a","schema_version":"1.0","event_id":"sha256:92fe65628c8f815c11fea56c26c4097a0589176f887ba7fb76ecd2dc9c30d12a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RFYBNVCLH7WKJRHDEIE2FUGJ2O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Kernels and Algorithms for Claw and Diamond Free Edge Deletion Based on Refined Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Huan Peng, Wenjun Li, Yongjie Yang","submitted_at":"2017-07-21T07:19:03Z","abstract_excerpt":"In the {claw, diamond}-free edge deletion problem, we are given a graph $G$ and an integer $k>0$, the question is whether there are at most $k$ edges whose deletion results in a graph without claws and diamonds as induced graphs. Based on some refined observations, we propose a kernel of $O(k^3)$ vertices and $O(k^4)$ edges, significantly improving the previous kernel of $O(k^{12})$ vertices and $O(k^{24})$ edges. In addition, we derive an $O^*(3.792^k)$-time algorithm for the {claw, diamond}-free edge deletion problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06779","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1707.06779/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ltqc2zMT+0yAFYMgebAKHMkyy82q0x0xl9oSEHaLn2Oex7lGXwVUMhyqdMXEXagZu736xdF4RsDlNuyVQYfzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:08:47.802669Z"},"content_sha256":"b39daab0721b476b8500e4281f1d466177fb7b6c03ae9464f1edf9591f7b21c0","schema_version":"1.0","event_id":"sha256:b39daab0721b476b8500e4281f1d466177fb7b6c03ae9464f1edf9591f7b21c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RFYBNVCLH7WKJRHDEIE2FUGJ2O/bundle.json","state_url":"https://pith.science/pith/RFYBNVCLH7WKJRHDEIE2FUGJ2O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RFYBNVCLH7WKJRHDEIE2FUGJ2O/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-08-16T16:08:47Z","links":{"resolver":"https://pith.science/pith/RFYBNVCLH7WKJRHDEIE2FUGJ2O","bundle":"https://pith.science/pith/RFYBNVCLH7WKJRHDEIE2FUGJ2O/bundle.json","state":"https://pith.science/pith/RFYBNVCLH7WKJRHDEIE2FUGJ2O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RFYBNVCLH7WKJRHDEIE2FUGJ2O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RFYBNVCLH7WKJRHDEIE2FUGJ2O","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":"f159c6ced6c25aa41bb2c12b2e513dc420c9051aa3b3bc76275074404efde984","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-21T07:19:03Z","title_canon_sha256":"8b2b9fd197f3770ac3a1a5cd32f7b3a9e77a60d8247cf48d2e5311ce3b9c082a"},"schema_version":"1.0","source":{"id":"1707.06779","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06779","created_at":"2026-07-05T03:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06779v3","created_at":"2026-07-05T03:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06779","created_at":"2026-07-05T03:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"RFYBNVCLH7WK","created_at":"2026-07-05T03:45:22Z"},{"alias_kind":"pith_short_16","alias_value":"RFYBNVCLH7WKJRHD","created_at":"2026-07-05T03:45:22Z"},{"alias_kind":"pith_short_8","alias_value":"RFYBNVCL","created_at":"2026-07-05T03:45:22Z"}],"graph_snapshots":[{"event_id":"sha256:b39daab0721b476b8500e4281f1d466177fb7b6c03ae9464f1edf9591f7b21c0","target":"graph","created_at":"2026-07-05T03:45:22Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1707.06779/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the {claw, diamond}-free edge deletion problem, we are given a graph $G$ and an integer $k>0$, the question is whether there are at most $k$ edges whose deletion results in a graph without claws and diamonds as induced graphs. Based on some refined observations, we propose a kernel of $O(k^3)$ vertices and $O(k^4)$ edges, significantly improving the previous kernel of $O(k^{12})$ vertices and $O(k^{24})$ edges. In addition, we derive an $O^*(3.792^k)$-time algorithm for the {claw, diamond}-free edge deletion problem.","authors_text":"Huan Peng, Wenjun Li, Yongjie Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-21T07:19:03Z","title":"Improved Kernels and Algorithms for Claw and Diamond Free Edge Deletion Based on Refined Observations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06779","kind":"arxiv","version":3},"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:92fe65628c8f815c11fea56c26c4097a0589176f887ba7fb76ecd2dc9c30d12a","target":"record","created_at":"2026-07-05T03:45:22Z","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":"f159c6ced6c25aa41bb2c12b2e513dc420c9051aa3b3bc76275074404efde984","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-21T07:19:03Z","title_canon_sha256":"8b2b9fd197f3770ac3a1a5cd32f7b3a9e77a60d8247cf48d2e5311ce3b9c082a"},"schema_version":"1.0","source":{"id":"1707.06779","kind":"arxiv","version":3}},"canonical_sha256":"897016d44b3feca4c4e32209a2d0c9d3975e330addb5ba8dd9050dd33389d2fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"897016d44b3feca4c4e32209a2d0c9d3975e330addb5ba8dd9050dd33389d2fb","first_computed_at":"2026-07-05T03:45:22.318086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:45:22.318086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xk9hxCQ+o9uj+2iEK5tCQpmxz6re8lPOq6F0zm7xrPcpm/h9nJhm/Pq79J1tIr2vf382VHoPvQhFrt2ktciVCw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:45:22.318496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06779","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92fe65628c8f815c11fea56c26c4097a0589176f887ba7fb76ecd2dc9c30d12a","sha256:b39daab0721b476b8500e4281f1d466177fb7b6c03ae9464f1edf9591f7b21c0"],"state_sha256":"23047640d4ee7de8fa921f902559a885a1ef343da369f0e0fa9c14ca3ca382ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5U8T7NbcmO87m/jyDq3CpR/tXlSD8iUES9RpxLR9sKKzCwaxq1w0+kW7oI/FB7sZ4D5OeMOCfsqpj8tiljX6DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T16:08:47.807481Z","bundle_sha256":"15754edd9850ffa4f54173ac9c3e466fabe501e3b444419881eedd8739e91df3"}}