{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JW6TBXARW7PCMYU2BZJCBR6WJN","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":"26f95ae895d76207f233b0fd5a4a819df5bd8ca84325004db2599499af1c3a1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-22T20:33:34Z","title_canon_sha256":"d5ed635dca0386565a6563f3d5cb8e45d7174607620e515a8cd201d112632622"},"schema_version":"1.0","source":{"id":"1901.07609","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07609","created_at":"2026-05-17T23:55:42Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07609v1","created_at":"2026-05-17T23:55:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07609","created_at":"2026-05-17T23:55:42Z"},{"alias_kind":"pith_short_12","alias_value":"JW6TBXARW7PC","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JW6TBXARW7PCMYU2","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JW6TBXAR","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:58358e2768a6557c832c37600a2115d27806d93f2e2d4c1ace910d6f24e28b90","target":"graph","created_at":"2026-05-17T23:55:42Z","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 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)$.","authors_text":"Dekel Tsur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-22T20:33:34Z","title":"Faster parameterized algorithm for Cluster Vertex Deletion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07609","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:0b19587b1742dcb9fb36672e1d5a5f3085d25d137974a3489ef27264166244f5","target":"record","created_at":"2026-05-17T23:55:42Z","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":"26f95ae895d76207f233b0fd5a4a819df5bd8ca84325004db2599499af1c3a1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-22T20:33:34Z","title_canon_sha256":"d5ed635dca0386565a6563f3d5cb8e45d7174607620e515a8cd201d112632622"},"schema_version":"1.0","source":{"id":"1901.07609","kind":"arxiv","version":1}},"canonical_sha256":"4dbd30dc11b7de26629a0e5220c7d64b6f6a324e01476f1b6a7ba67687e97f4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4dbd30dc11b7de26629a0e5220c7d64b6f6a324e01476f1b6a7ba67687e97f4c","first_computed_at":"2026-05-17T23:55:42.059130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:42.059130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"unGs/oMWpNnXNyb/k8WwOcey6TKl3MWkFlbeGO/YWNHScHPgAvmczX5WuXdUtwngQsKHXxprlhQAv4jusfUBAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:42.059570Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07609","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b19587b1742dcb9fb36672e1d5a5f3085d25d137974a3489ef27264166244f5","sha256:58358e2768a6557c832c37600a2115d27806d93f2e2d4c1ace910d6f24e28b90"],"state_sha256":"5f56725afcdbec324887fc99e8ad76715b972eddc8a0b926abb180923ec9346e"}