{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JW6TBXARW7PCMYU2BZJCBR6WJN","short_pith_number":"pith:JW6TBXAR","schema_version":"1.0","canonical_sha256":"4dbd30dc11b7de26629a0e5220c7d64b6f6a324e01476f1b6a7ba67687e97f4c","source":{"kind":"arxiv","id":"1901.07609","version":1},"attestation_state":"computed","paper":{"title":"Faster parameterized algorithm for Cluster Vertex Deletion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dekel Tsur","submitted_at":"2019-01-22T20:33:34Z","abstract_excerpt":"In the Cluster Vertex Deletion problem the input is a graph $G$ and an integer $k$. The goal is to decide whether there is a set of vertices $S$ of size at most $k$ such that the deletion of the vertices of $S$ from $G$ results a graph in which every connected component is a clique. We give an algorithm for Cluster Vertex Deletion whose running time is $O^*(1.811^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":"1901.07609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-22T20:33:34Z","cross_cats_sorted":[],"title_canon_sha256":"d5ed635dca0386565a6563f3d5cb8e45d7174607620e515a8cd201d112632622","abstract_canon_sha256":"26f95ae895d76207f233b0fd5a4a819df5bd8ca84325004db2599499af1c3a1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:42.059570Z","signature_b64":"unGs/oMWpNnXNyb/k8WwOcey6TKl3MWkFlbeGO/YWNHScHPgAvmczX5WuXdUtwngQsKHXxprlhQAv4jusfUBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dbd30dc11b7de26629a0e5220c7d64b6f6a324e01476f1b6a7ba67687e97f4c","last_reissued_at":"2026-05-17T23:55:42.059130Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:42.059130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster parameterized algorithm for Cluster Vertex Deletion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dekel Tsur","submitted_at":"2019-01-22T20:33:34Z","abstract_excerpt":"In the Cluster Vertex Deletion problem the input is a graph $G$ and an integer $k$. The goal is to decide whether there is a set of vertices $S$ of size at most $k$ such that the deletion of the vertices of $S$ from $G$ results a graph in which every connected component is a clique. We give an algorithm for Cluster Vertex Deletion whose running time is $O^*(1.811^k)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07609","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":""},"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":"1901.07609","created_at":"2026-05-17T23:55:42.059201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07609v1","created_at":"2026-05-17T23:55:42.059201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07609","created_at":"2026-05-17T23:55:42.059201+00:00"},{"alias_kind":"pith_short_12","alias_value":"JW6TBXARW7PC","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"JW6TBXARW7PCMYU2","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"JW6TBXAR","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.10523","citing_title":"l-path vertex cover is easier than l-hitting set for small l","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JW6TBXARW7PCMYU2BZJCBR6WJN","json":"https://pith.science/pith/JW6TBXARW7PCMYU2BZJCBR6WJN.json","graph_json":"https://pith.science/api/pith-number/JW6TBXARW7PCMYU2BZJCBR6WJN/graph.json","events_json":"https://pith.science/api/pith-number/JW6TBXARW7PCMYU2BZJCBR6WJN/events.json","paper":"https://pith.science/paper/JW6TBXAR"},"agent_actions":{"view_html":"https://pith.science/pith/JW6TBXARW7PCMYU2BZJCBR6WJN","download_json":"https://pith.science/pith/JW6TBXARW7PCMYU2BZJCBR6WJN.json","view_paper":"https://pith.science/paper/JW6TBXAR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07609&json=true","fetch_graph":"https://pith.science/api/pith-number/JW6TBXARW7PCMYU2BZJCBR6WJN/graph.json","fetch_events":"https://pith.science/api/pith-number/JW6TBXARW7PCMYU2BZJCBR6WJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JW6TBXARW7PCMYU2BZJCBR6WJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JW6TBXARW7PCMYU2BZJCBR6WJN/action/storage_attestation","attest_author":"https://pith.science/pith/JW6TBXARW7PCMYU2BZJCBR6WJN/action/author_attestation","sign_citation":"https://pith.science/pith/JW6TBXARW7PCMYU2BZJCBR6WJN/action/citation_signature","submit_replication":"https://pith.science/pith/JW6TBXARW7PCMYU2BZJCBR6WJN/action/replication_record"}},"created_at":"2026-05-17T23:55:42.059201+00:00","updated_at":"2026-05-17T23:55:42.059201+00:00"}