{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5VE7W2Y6T3ZYC24QNLIL5P7ZLW","short_pith_number":"pith:5VE7W2Y6","schema_version":"1.0","canonical_sha256":"ed49fb6b1e9ef3816b906ad0bebff95d9d414bb9c0879a92d7cba349556cf7a1","source":{"kind":"arxiv","id":"1906.10012","version":3},"attestation_state":"computed","paper":{"title":"Algorithms for deletion problems on split graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dekel Tsur","submitted_at":"2019-06-24T15:06:40Z","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."},"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":"1906.10012","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-24T15:06:40Z","cross_cats_sorted":[],"title_canon_sha256":"11a4f39c11454ba11cd73f16186cd43282cd67025a13d5761b8797632cad55c7","abstract_canon_sha256":"18823140e7935f491ef48fc8d351a653faa57f21ab08e3255285a5ba3b99a8ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:35.224198Z","signature_b64":"/n2/R5kwjB0++Rb64+0rER7x+3HiPj7Hd+Xh5DzhvbkJdp7xJ3D/I3ipgG7VidJrlcsjKiqk/MiCtm+4p94ZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed49fb6b1e9ef3816b906ad0bebff95d9d414bb9c0879a92d7cba349556cf7a1","last_reissued_at":"2026-05-17T23:39:35.223433Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:35.223433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for deletion problems on split graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dekel Tsur","submitted_at":"2019-06-24T15:06:40Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10012","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":""},"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":"1906.10012","created_at":"2026-05-17T23:39:35.223547+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10012v3","created_at":"2026-05-17T23:39:35.223547+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10012","created_at":"2026-05-17T23:39:35.223547+00:00"},{"alias_kind":"pith_short_12","alias_value":"5VE7W2Y6T3ZY","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5VE7W2Y6T3ZYC24Q","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5VE7W2Y6","created_at":"2026-05-18T12:33:10.108867+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/5VE7W2Y6T3ZYC24QNLIL5P7ZLW","json":"https://pith.science/pith/5VE7W2Y6T3ZYC24QNLIL5P7ZLW.json","graph_json":"https://pith.science/api/pith-number/5VE7W2Y6T3ZYC24QNLIL5P7ZLW/graph.json","events_json":"https://pith.science/api/pith-number/5VE7W2Y6T3ZYC24QNLIL5P7ZLW/events.json","paper":"https://pith.science/paper/5VE7W2Y6"},"agent_actions":{"view_html":"https://pith.science/pith/5VE7W2Y6T3ZYC24QNLIL5P7ZLW","download_json":"https://pith.science/pith/5VE7W2Y6T3ZYC24QNLIL5P7ZLW.json","view_paper":"https://pith.science/paper/5VE7W2Y6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10012&json=true","fetch_graph":"https://pith.science/api/pith-number/5VE7W2Y6T3ZYC24QNLIL5P7ZLW/graph.json","fetch_events":"https://pith.science/api/pith-number/5VE7W2Y6T3ZYC24QNLIL5P7ZLW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5VE7W2Y6T3ZYC24QNLIL5P7ZLW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5VE7W2Y6T3ZYC24QNLIL5P7ZLW/action/storage_attestation","attest_author":"https://pith.science/pith/5VE7W2Y6T3ZYC24QNLIL5P7ZLW/action/author_attestation","sign_citation":"https://pith.science/pith/5VE7W2Y6T3ZYC24QNLIL5P7ZLW/action/citation_signature","submit_replication":"https://pith.science/pith/5VE7W2Y6T3ZYC24QNLIL5P7ZLW/action/replication_record"}},"created_at":"2026-05-17T23:39:35.223547+00:00","updated_at":"2026-05-17T23:39:35.223547+00:00"}