{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LDWR7YECRKTITV4AD5VKFOU6QZ","short_pith_number":"pith:LDWR7YEC","canonical_record":{"source":{"id":"1908.07318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-20T13:02:03Z","cross_cats_sorted":[],"title_canon_sha256":"d9275362ba3904825b064d0cc2d91f22452c2978cf39b0626e43374c994689c2","abstract_canon_sha256":"b1b421fe9a3df9c3ec459e40c40b8d81891b0a42c70954b82e215e2c1de6f6f1"},"schema_version":"1.0"},"canonical_sha256":"58ed1fe0828aa689d7801f6aa2ba9e866631fc27682074744bc4edabbc242eb3","source":{"kind":"arxiv","id":"1908.07318","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07318","created_at":"2026-07-04T23:58:33Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07318v1","created_at":"2026-07-04T23:58:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07318","created_at":"2026-07-04T23:58:33Z"},{"alias_kind":"pith_short_12","alias_value":"LDWR7YECRKTI","created_at":"2026-07-04T23:58:33Z"},{"alias_kind":"pith_short_16","alias_value":"LDWR7YECRKTITV4A","created_at":"2026-07-04T23:58:33Z"},{"alias_kind":"pith_short_8","alias_value":"LDWR7YEC","created_at":"2026-07-04T23:58:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LDWR7YECRKTITV4AD5VKFOU6QZ","target":"record","payload":{"canonical_record":{"source":{"id":"1908.07318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-20T13:02:03Z","cross_cats_sorted":[],"title_canon_sha256":"d9275362ba3904825b064d0cc2d91f22452c2978cf39b0626e43374c994689c2","abstract_canon_sha256":"b1b421fe9a3df9c3ec459e40c40b8d81891b0a42c70954b82e215e2c1de6f6f1"},"schema_version":"1.0"},"canonical_sha256":"58ed1fe0828aa689d7801f6aa2ba9e866631fc27682074744bc4edabbc242eb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:33.208809Z","signature_b64":"FmJtxNZSbNU6lIThcCkztZjOwpmqoX94K4XUE+J9/dxJEwKrZtG0UtzozBl6d5FM1eLa1BIn3tTPt2j6gs5UAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58ed1fe0828aa689d7801f6aa2ba9e866631fc27682074744bc4edabbc242eb3","last_reissued_at":"2026-07-04T23:58:33.208460Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:33.208460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.07318","source_version":1,"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-04T23:58:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6VuPKFoEj5SqeCurEE+EfNBgDuhDnUn/dUsRsoOqiUSHm/rY289ZiUB6lRMPjT+iJ8pr8Zk8AtZCMI1wS30nAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T15:55:12.169407Z"},"content_sha256":"7e5ada5e0779c5a97697dc76d595ff50707596682029382e9dbe2bc774c4c821","schema_version":"1.0","event_id":"sha256:7e5ada5e0779c5a97697dc76d595ff50707596682029382e9dbe2bc774c4c821"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LDWR7YECRKTITV4AD5VKFOU6QZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An algorithm for destroying claws and diamonds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dekel Tsur","submitted_at":"2019-08-20T13:02:03Z","abstract_excerpt":"In the {Claw,Diamond}-Free Edge Deletion problem the input is a graph $G$ and an integer $k$, and the goal is to decide whether there is a set of edges of size at most $k$ such that removing the edges of the set from $G$ results a graph that does not contain an induced claw or diamond. In this paper we give an algorithm for this problem whose running time is $O^*(3.562^k)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07318","kind":"arxiv","version":1},"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/1908.07318/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-04T23:58:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3RJx1qEYa/oLIl3d/OByCOaelObvWnFOb8ebZPkUt9dzdzSWslFB+TBgtIyAHFZ7yRlg2ewyNmwJz06XvCjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T15:55:12.170063Z"},"content_sha256":"d9241f84dfd8fdbff4f75761d2b0d3545dc8de14e8f913806544897e0cfefb6a","schema_version":"1.0","event_id":"sha256:d9241f84dfd8fdbff4f75761d2b0d3545dc8de14e8f913806544897e0cfefb6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LDWR7YECRKTITV4AD5VKFOU6QZ/bundle.json","state_url":"https://pith.science/pith/LDWR7YECRKTITV4AD5VKFOU6QZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LDWR7YECRKTITV4AD5VKFOU6QZ/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-16T15:55:12Z","links":{"resolver":"https://pith.science/pith/LDWR7YECRKTITV4AD5VKFOU6QZ","bundle":"https://pith.science/pith/LDWR7YECRKTITV4AD5VKFOU6QZ/bundle.json","state":"https://pith.science/pith/LDWR7YECRKTITV4AD5VKFOU6QZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LDWR7YECRKTITV4AD5VKFOU6QZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LDWR7YECRKTITV4AD5VKFOU6QZ","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":"b1b421fe9a3df9c3ec459e40c40b8d81891b0a42c70954b82e215e2c1de6f6f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-20T13:02:03Z","title_canon_sha256":"d9275362ba3904825b064d0cc2d91f22452c2978cf39b0626e43374c994689c2"},"schema_version":"1.0","source":{"id":"1908.07318","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07318","created_at":"2026-07-04T23:58:33Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07318v1","created_at":"2026-07-04T23:58:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07318","created_at":"2026-07-04T23:58:33Z"},{"alias_kind":"pith_short_12","alias_value":"LDWR7YECRKTI","created_at":"2026-07-04T23:58:33Z"},{"alias_kind":"pith_short_16","alias_value":"LDWR7YECRKTITV4A","created_at":"2026-07-04T23:58:33Z"},{"alias_kind":"pith_short_8","alias_value":"LDWR7YEC","created_at":"2026-07-04T23:58:33Z"}],"graph_snapshots":[{"event_id":"sha256:d9241f84dfd8fdbff4f75761d2b0d3545dc8de14e8f913806544897e0cfefb6a","target":"graph","created_at":"2026-07-04T23:58: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.07318/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 the input is a graph $G$ and an integer $k$, and the goal is to decide whether there is a set of edges of size at most $k$ such that removing the edges of the set from $G$ results a graph that does not contain an induced claw or diamond. In this paper we give an algorithm for this problem whose running time is $O^*(3.562^k)$.","authors_text":"Dekel Tsur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-20T13:02:03Z","title":"An algorithm for destroying claws and diamonds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07318","kind":"arxiv","version":1},"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:7e5ada5e0779c5a97697dc76d595ff50707596682029382e9dbe2bc774c4c821","target":"record","created_at":"2026-07-04T23:58: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":"b1b421fe9a3df9c3ec459e40c40b8d81891b0a42c70954b82e215e2c1de6f6f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-20T13:02:03Z","title_canon_sha256":"d9275362ba3904825b064d0cc2d91f22452c2978cf39b0626e43374c994689c2"},"schema_version":"1.0","source":{"id":"1908.07318","kind":"arxiv","version":1}},"canonical_sha256":"58ed1fe0828aa689d7801f6aa2ba9e866631fc27682074744bc4edabbc242eb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58ed1fe0828aa689d7801f6aa2ba9e866631fc27682074744bc4edabbc242eb3","first_computed_at":"2026-07-04T23:58:33.208460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:33.208460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FmJtxNZSbNU6lIThcCkztZjOwpmqoX94K4XUE+J9/dxJEwKrZtG0UtzozBl6d5FM1eLa1BIn3tTPt2j6gs5UAA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:33.208809Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.07318","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e5ada5e0779c5a97697dc76d595ff50707596682029382e9dbe2bc774c4c821","sha256:d9241f84dfd8fdbff4f75761d2b0d3545dc8de14e8f913806544897e0cfefb6a"],"state_sha256":"c2b51a89fb6b75bd4bae8ae2a5fcfb6a7eb9978518469da5216f24c1410a62ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Qx+ogj+3qCj88Hay60If0qvfx1f4Gpz1Ol8Wy5Gqe2AoCzMU45hG1RJuC5pzQYNRIFkfg0ult1kzxJKHO56Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T15:55:12.175917Z","bundle_sha256":"6fb07f3cc02b8956ee967a82da03299e349618ad1e96daef2cb2511768d4b983"}}