{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5VE7W2Y6T3ZYC24QNLIL5P7ZLW","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":"18823140e7935f491ef48fc8d351a653faa57f21ab08e3255285a5ba3b99a8ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-24T15:06:40Z","title_canon_sha256":"11a4f39c11454ba11cd73f16186cd43282cd67025a13d5761b8797632cad55c7"},"schema_version":"1.0","source":{"id":"1906.10012","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10012","created_at":"2026-05-17T23:39:35Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10012v3","created_at":"2026-05-17T23:39:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10012","created_at":"2026-05-17T23:39:35Z"},{"alias_kind":"pith_short_12","alias_value":"5VE7W2Y6T3ZY","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5VE7W2Y6T3ZYC24Q","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5VE7W2Y6","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:ab058eedb4cd0eee4f0adb376cb4fa51ea4b4f16626df7171288748a4e321838","target":"graph","created_at":"2026-05-17T23:39:35Z","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":"In the Split to Block Vertex Deletion and Split to Threshold Vertex Deletion problems the input is a split graph $G$ and an integer $k$, and the goal is to decide whether there is a set $S$ of at most $k$ vertices such that $G-S$ is a block graph and $G-S$ is a threshold graph, respectively. In this paper we give algorithms for these problems whose running times are $O^*(2.076^k)$ and $O^*(2.733^k)$, respectively.","authors_text":"Dekel Tsur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-24T15:06:40Z","title":"Algorithms for deletion problems on split graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10012","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:13f12fdae1066d6a0b3615946c9b4bb428b85615044bccb9af67eed29468fc03","target":"record","created_at":"2026-05-17T23:39:35Z","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":"18823140e7935f491ef48fc8d351a653faa57f21ab08e3255285a5ba3b99a8ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-24T15:06:40Z","title_canon_sha256":"11a4f39c11454ba11cd73f16186cd43282cd67025a13d5761b8797632cad55c7"},"schema_version":"1.0","source":{"id":"1906.10012","kind":"arxiv","version":3}},"canonical_sha256":"ed49fb6b1e9ef3816b906ad0bebff95d9d414bb9c0879a92d7cba349556cf7a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed49fb6b1e9ef3816b906ad0bebff95d9d414bb9c0879a92d7cba349556cf7a1","first_computed_at":"2026-05-17T23:39:35.223433Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:35.223433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/n2/R5kwjB0++Rb64+0rER7x+3HiPj7Hd+Xh5DzhvbkJdp7xJ3D/I3ipgG7VidJrlcsjKiqk/MiCtm+4p94ZCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:35.224198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.10012","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13f12fdae1066d6a0b3615946c9b4bb428b85615044bccb9af67eed29468fc03","sha256:ab058eedb4cd0eee4f0adb376cb4fa51ea4b4f16626df7171288748a4e321838"],"state_sha256":"b53a5ba847f0c8c204fdfcc44ed265a713dc28222caa5a1c89759d4d82801173"}