{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TS6FCM7NJ3L4DRYVE4LOPHPHXK","short_pith_number":"pith:TS6FCM7N","schema_version":"1.0","canonical_sha256":"9cbc5133ed4ed7c1c7152716e79de7ba91aa67a61262bf3b2d36502be2de2c85","source":{"kind":"arxiv","id":"1811.01162","version":1},"attestation_state":"computed","paper":{"title":"Improved approximation algorithms for path vertex covers in regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"An Zhang, Guohui Lin, Yong Chen, Zhi-Zhong Chen","submitted_at":"2018-11-03T05:05:51Z","abstract_excerpt":"Given a simple graph $G = (V, E)$ and a constant integer $k \\ge 2$, the $k$-path vertex cover problem ({\\sc P$k$VC}) asks for a minimum subset $F \\subseteq V$ of vertices such that the induced subgraph $G[V - F]$ does not contain any path of order $k$. When $k = 2$, this turns out to be the classic vertex cover ({\\sc VC}) problem, which admits a $\\left(2 - {\\rm \\Theta}\\left(\\frac 1{\\log|V|}\\right)\\right)$-approximation. The general {\\sc P$k$VC} admits a trivial $k$-approximation; when $k = 3$ and $k = 4$, the best known approximation results for {\\sc P$3$VC} and {\\sc P$4$VC} are a $2$-approxim"},"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":"1811.01162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-03T05:05:51Z","cross_cats_sorted":[],"title_canon_sha256":"bda9baa1c4c5e15de10ee9828f98827052185f5d63b382d2479308deca2d6961","abstract_canon_sha256":"22949e0a31041aa1dc25a838ac0de8bf89d167a4e3ee169003db8afee0d82484"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:35.179980Z","signature_b64":"koLMch99zfWqM9LVm+iOe72CQmqlsS8QTPwfumBY24Qy/3YuB/odTg0rSh14Nsx3+qv2Y8FE2wgU5cfWNLGuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cbc5133ed4ed7c1c7152716e79de7ba91aa67a61262bf3b2d36502be2de2c85","last_reissued_at":"2026-05-18T00:01:35.179457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:35.179457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved approximation algorithms for path vertex covers in regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"An Zhang, Guohui Lin, Yong Chen, Zhi-Zhong Chen","submitted_at":"2018-11-03T05:05:51Z","abstract_excerpt":"Given a simple graph $G = (V, E)$ and a constant integer $k \\ge 2$, the $k$-path vertex cover problem ({\\sc P$k$VC}) asks for a minimum subset $F \\subseteq V$ of vertices such that the induced subgraph $G[V - F]$ does not contain any path of order $k$. When $k = 2$, this turns out to be the classic vertex cover ({\\sc VC}) problem, which admits a $\\left(2 - {\\rm \\Theta}\\left(\\frac 1{\\log|V|}\\right)\\right)$-approximation. The general {\\sc P$k$VC} admits a trivial $k$-approximation; when $k = 3$ and $k = 4$, the best known approximation results for {\\sc P$3$VC} and {\\sc P$4$VC} are a $2$-approxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01162","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":"1811.01162","created_at":"2026-05-18T00:01:35.179538+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.01162v1","created_at":"2026-05-18T00:01:35.179538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01162","created_at":"2026-05-18T00:01:35.179538+00:00"},{"alias_kind":"pith_short_12","alias_value":"TS6FCM7NJ3L4","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TS6FCM7NJ3L4DRYV","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TS6FCM7N","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/TS6FCM7NJ3L4DRYVE4LOPHPHXK","json":"https://pith.science/pith/TS6FCM7NJ3L4DRYVE4LOPHPHXK.json","graph_json":"https://pith.science/api/pith-number/TS6FCM7NJ3L4DRYVE4LOPHPHXK/graph.json","events_json":"https://pith.science/api/pith-number/TS6FCM7NJ3L4DRYVE4LOPHPHXK/events.json","paper":"https://pith.science/paper/TS6FCM7N"},"agent_actions":{"view_html":"https://pith.science/pith/TS6FCM7NJ3L4DRYVE4LOPHPHXK","download_json":"https://pith.science/pith/TS6FCM7NJ3L4DRYVE4LOPHPHXK.json","view_paper":"https://pith.science/paper/TS6FCM7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.01162&json=true","fetch_graph":"https://pith.science/api/pith-number/TS6FCM7NJ3L4DRYVE4LOPHPHXK/graph.json","fetch_events":"https://pith.science/api/pith-number/TS6FCM7NJ3L4DRYVE4LOPHPHXK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TS6FCM7NJ3L4DRYVE4LOPHPHXK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TS6FCM7NJ3L4DRYVE4LOPHPHXK/action/storage_attestation","attest_author":"https://pith.science/pith/TS6FCM7NJ3L4DRYVE4LOPHPHXK/action/author_attestation","sign_citation":"https://pith.science/pith/TS6FCM7NJ3L4DRYVE4LOPHPHXK/action/citation_signature","submit_replication":"https://pith.science/pith/TS6FCM7NJ3L4DRYVE4LOPHPHXK/action/replication_record"}},"created_at":"2026-05-18T00:01:35.179538+00:00","updated_at":"2026-05-18T00:01:35.179538+00:00"}