{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TTTR2GHORL3X6OFMT7JJTJGQKJ","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":"475fc99fbf74a565d7af1f0179a89d158e2275c90e2c44fcafe94467f6998e97","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-30T15:59:02Z","title_canon_sha256":"9f2f3d54da6d04a31d694bd277d599b9845ab96bcc32767df3583f016b231f45"},"schema_version":"1.0","source":{"id":"1808.10370","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10370","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10370v2","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10370","created_at":"2026-05-17T23:52:58Z"},{"alias_kind":"pith_short_12","alias_value":"TTTR2GHORL3X","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TTTR2GHORL3X6OFM","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TTTR2GHO","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:d091bed08f4b8d9060f4cbf77135b39d3afd8e570769de9d1306257113a8ca16","target":"graph","created_at":"2026-05-17T23:52:58Z","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":"We study the problem of deleting a minimum cost set of vertices from a given vertex-weighted graph in such a way that the resulting graph has no induced path on three vertices. This problem is often called cluster vertex deletion in the literature and admits a straightforward 3-approximation algorithm since it is a special case of the vertex cover problem on a 3-uniform hypergraph. Recently, You, Wang, and Cao described an efficient 5/2-approximation algorithm for the unweighted version of the problem. Our main result is a 9/4-approximation algorithm for arbitrary weights, using the local rati","authors_text":"Gwena\\\"el Joret, Oliver Schaudt, Samuel Fiorini","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-30T15:59:02Z","title":"Improved approximation algorithms for hitting 3-vertex paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10370","kind":"arxiv","version":2},"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:4b87e5f5e4047fc05c7df3b3994cdde18d5591af64229f70d9846c6115c2227f","target":"record","created_at":"2026-05-17T23:52:58Z","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":"475fc99fbf74a565d7af1f0179a89d158e2275c90e2c44fcafe94467f6998e97","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-30T15:59:02Z","title_canon_sha256":"9f2f3d54da6d04a31d694bd277d599b9845ab96bcc32767df3583f016b231f45"},"schema_version":"1.0","source":{"id":"1808.10370","kind":"arxiv","version":2}},"canonical_sha256":"9ce71d18ee8af77f38ac9fd299a4d0524a0d5d639cdcf43731cb30e3f3fe9ad1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ce71d18ee8af77f38ac9fd299a4d0524a0d5d639cdcf43731cb30e3f3fe9ad1","first_computed_at":"2026-05-17T23:52:58.876422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:58.876422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U5RMN6oRxz4wDmCTEvG3/X7rCsVR+UEhCwHkXsfJa+8DlgOJtjiHAY65et4Eg0M+v3S1ITh+dWrCxprjsschAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:58.877074Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.10370","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b87e5f5e4047fc05c7df3b3994cdde18d5591af64229f70d9846c6115c2227f","sha256:d091bed08f4b8d9060f4cbf77135b39d3afd8e570769de9d1306257113a8ca16"],"state_sha256":"90e0427a44496c0ac82482ab11cb8f1f7bceee0fd3c6ddec8366d86460f13cde"}