{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TTTR2GHORL3X6OFMT7JJTJGQKJ","short_pith_number":"pith:TTTR2GHO","schema_version":"1.0","canonical_sha256":"9ce71d18ee8af77f38ac9fd299a4d0524a0d5d639cdcf43731cb30e3f3fe9ad1","source":{"kind":"arxiv","id":"1808.10370","version":2},"attestation_state":"computed","paper":{"title":"Improved approximation algorithms for hitting 3-vertex paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Gwena\\\"el Joret, Oliver Schaudt, Samuel Fiorini","submitted_at":"2018-08-30T15:59:02Z","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"},"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":"1808.10370","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-30T15:59:02Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9f2f3d54da6d04a31d694bd277d599b9845ab96bcc32767df3583f016b231f45","abstract_canon_sha256":"475fc99fbf74a565d7af1f0179a89d158e2275c90e2c44fcafe94467f6998e97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:58.877074Z","signature_b64":"U5RMN6oRxz4wDmCTEvG3/X7rCsVR+UEhCwHkXsfJa+8DlgOJtjiHAY65et4Eg0M+v3S1ITh+dWrCxprjsschAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ce71d18ee8af77f38ac9fd299a4d0524a0d5d639cdcf43731cb30e3f3fe9ad1","last_reissued_at":"2026-05-17T23:52:58.876422Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:58.876422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved approximation algorithms for hitting 3-vertex paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Gwena\\\"el Joret, Oliver Schaudt, Samuel Fiorini","submitted_at":"2018-08-30T15:59:02Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10370","kind":"arxiv","version":2},"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":"1808.10370","created_at":"2026-05-17T23:52:58.876532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.10370v2","created_at":"2026-05-17T23:52:58.876532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10370","created_at":"2026-05-17T23:52:58.876532+00:00"},{"alias_kind":"pith_short_12","alias_value":"TTTR2GHORL3X","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TTTR2GHORL3X6OFM","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TTTR2GHO","created_at":"2026-05-18T12:32:56.356000+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/TTTR2GHORL3X6OFMT7JJTJGQKJ","json":"https://pith.science/pith/TTTR2GHORL3X6OFMT7JJTJGQKJ.json","graph_json":"https://pith.science/api/pith-number/TTTR2GHORL3X6OFMT7JJTJGQKJ/graph.json","events_json":"https://pith.science/api/pith-number/TTTR2GHORL3X6OFMT7JJTJGQKJ/events.json","paper":"https://pith.science/paper/TTTR2GHO"},"agent_actions":{"view_html":"https://pith.science/pith/TTTR2GHORL3X6OFMT7JJTJGQKJ","download_json":"https://pith.science/pith/TTTR2GHORL3X6OFMT7JJTJGQKJ.json","view_paper":"https://pith.science/paper/TTTR2GHO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.10370&json=true","fetch_graph":"https://pith.science/api/pith-number/TTTR2GHORL3X6OFMT7JJTJGQKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/TTTR2GHORL3X6OFMT7JJTJGQKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TTTR2GHORL3X6OFMT7JJTJGQKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TTTR2GHORL3X6OFMT7JJTJGQKJ/action/storage_attestation","attest_author":"https://pith.science/pith/TTTR2GHORL3X6OFMT7JJTJGQKJ/action/author_attestation","sign_citation":"https://pith.science/pith/TTTR2GHORL3X6OFMT7JJTJGQKJ/action/citation_signature","submit_replication":"https://pith.science/pith/TTTR2GHORL3X6OFMT7JJTJGQKJ/action/replication_record"}},"created_at":"2026-05-17T23:52:58.876532+00:00","updated_at":"2026-05-17T23:52:58.876532+00:00"}