{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LDWR7YECRKTITV4AD5VKFOU6QZ","short_pith_number":"pith:LDWR7YEC","schema_version":"1.0","canonical_sha256":"58ed1fe0828aa689d7801f6aa2ba9e866631fc27682074744bc4edabbc242eb3","source":{"kind":"arxiv","id":"1908.07318","version":1},"attestation_state":"computed","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)$."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.07318","created_at":"2026-07-04T23:58:33.208523+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.07318v1","created_at":"2026-07-04T23:58:33.208523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07318","created_at":"2026-07-04T23:58:33.208523+00:00"},{"alias_kind":"pith_short_12","alias_value":"LDWR7YECRKTI","created_at":"2026-07-04T23:58:33.208523+00:00"},{"alias_kind":"pith_short_16","alias_value":"LDWR7YECRKTITV4A","created_at":"2026-07-04T23:58:33.208523+00:00"},{"alias_kind":"pith_short_8","alias_value":"LDWR7YEC","created_at":"2026-07-04T23:58:33.208523+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/LDWR7YECRKTITV4AD5VKFOU6QZ","json":"https://pith.science/pith/LDWR7YECRKTITV4AD5VKFOU6QZ.json","graph_json":"https://pith.science/api/pith-number/LDWR7YECRKTITV4AD5VKFOU6QZ/graph.json","events_json":"https://pith.science/api/pith-number/LDWR7YECRKTITV4AD5VKFOU6QZ/events.json","paper":"https://pith.science/paper/LDWR7YEC"},"agent_actions":{"view_html":"https://pith.science/pith/LDWR7YECRKTITV4AD5VKFOU6QZ","download_json":"https://pith.science/pith/LDWR7YECRKTITV4AD5VKFOU6QZ.json","view_paper":"https://pith.science/paper/LDWR7YEC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.07318&json=true","fetch_graph":"https://pith.science/api/pith-number/LDWR7YECRKTITV4AD5VKFOU6QZ/graph.json","fetch_events":"https://pith.science/api/pith-number/LDWR7YECRKTITV4AD5VKFOU6QZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LDWR7YECRKTITV4AD5VKFOU6QZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LDWR7YECRKTITV4AD5VKFOU6QZ/action/storage_attestation","attest_author":"https://pith.science/pith/LDWR7YECRKTITV4AD5VKFOU6QZ/action/author_attestation","sign_citation":"https://pith.science/pith/LDWR7YECRKTITV4AD5VKFOU6QZ/action/citation_signature","submit_replication":"https://pith.science/pith/LDWR7YECRKTITV4AD5VKFOU6QZ/action/replication_record"}},"created_at":"2026-07-04T23:58:33.208523+00:00","updated_at":"2026-07-04T23:58:33.208523+00:00"}