{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ONLWL2HPUCXXOUIDUYI5GKQ3DB","short_pith_number":"pith:ONLWL2HP","schema_version":"1.0","canonical_sha256":"735765e8efa0af775103a611d32a1b186e0264c635ae7d4a1f214083d006f865","source":{"kind":"arxiv","id":"1608.07022","version":1},"attestation_state":"computed","paper":{"title":"Kernelization and Parameterized Algorithms for 3-Path Vertex Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mingyu Xiao, Shaowei Kou","submitted_at":"2016-08-25T06:16:32Z","abstract_excerpt":"A 3-path vertex cover in a graph is a vertex subset $C$ such that every path of three vertices contains at least one vertex from $C$. The parameterized 3-path vertex cover problem asks whether a graph has a 3-path vertex cover of size at most $k$. In this paper, we give a kernel of $5k$ vertices and an $O^*(1.7485^k)$-time and polynomial-space algorithm for this problem, both new results improve previous known bounds."},"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":"1608.07022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-25T06:16:32Z","cross_cats_sorted":[],"title_canon_sha256":"530f0682a89ba0790a7e7f815cac2e779e02a6295ec092fcb8264943362d58a8","abstract_canon_sha256":"d5e738f2f8e977546b7977cb4f4493394a4c512217387681adfa6dc4530ebb66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:36.380683Z","signature_b64":"KD01wa2HeoW/sH/ZO9DUkJ83iHT5R31NcQMvmxzUMWCgsVVmx84aJWfLrLbMVC38Hv/UCcfyLxkiMS2h+qedAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"735765e8efa0af775103a611d32a1b186e0264c635ae7d4a1f214083d006f865","last_reissued_at":"2026-05-18T00:38:36.380235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:36.380235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kernelization and Parameterized Algorithms for 3-Path Vertex Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mingyu Xiao, Shaowei Kou","submitted_at":"2016-08-25T06:16:32Z","abstract_excerpt":"A 3-path vertex cover in a graph is a vertex subset $C$ such that every path of three vertices contains at least one vertex from $C$. The parameterized 3-path vertex cover problem asks whether a graph has a 3-path vertex cover of size at most $k$. In this paper, we give a kernel of $5k$ vertices and an $O^*(1.7485^k)$-time and polynomial-space algorithm for this problem, both new results improve previous known bounds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07022","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":"1608.07022","created_at":"2026-05-18T00:38:36.380305+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.07022v1","created_at":"2026-05-18T00:38:36.380305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07022","created_at":"2026-05-18T00:38:36.380305+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONLWL2HPUCXX","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONLWL2HPUCXXOUID","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONLWL2HP","created_at":"2026-05-18T12:30:36.002864+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/ONLWL2HPUCXXOUIDUYI5GKQ3DB","json":"https://pith.science/pith/ONLWL2HPUCXXOUIDUYI5GKQ3DB.json","graph_json":"https://pith.science/api/pith-number/ONLWL2HPUCXXOUIDUYI5GKQ3DB/graph.json","events_json":"https://pith.science/api/pith-number/ONLWL2HPUCXXOUIDUYI5GKQ3DB/events.json","paper":"https://pith.science/paper/ONLWL2HP"},"agent_actions":{"view_html":"https://pith.science/pith/ONLWL2HPUCXXOUIDUYI5GKQ3DB","download_json":"https://pith.science/pith/ONLWL2HPUCXXOUIDUYI5GKQ3DB.json","view_paper":"https://pith.science/paper/ONLWL2HP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.07022&json=true","fetch_graph":"https://pith.science/api/pith-number/ONLWL2HPUCXXOUIDUYI5GKQ3DB/graph.json","fetch_events":"https://pith.science/api/pith-number/ONLWL2HPUCXXOUIDUYI5GKQ3DB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONLWL2HPUCXXOUIDUYI5GKQ3DB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONLWL2HPUCXXOUIDUYI5GKQ3DB/action/storage_attestation","attest_author":"https://pith.science/pith/ONLWL2HPUCXXOUIDUYI5GKQ3DB/action/author_attestation","sign_citation":"https://pith.science/pith/ONLWL2HPUCXXOUIDUYI5GKQ3DB/action/citation_signature","submit_replication":"https://pith.science/pith/ONLWL2HPUCXXOUIDUYI5GKQ3DB/action/replication_record"}},"created_at":"2026-05-18T00:38:36.380305+00:00","updated_at":"2026-05-18T00:38:36.380305+00:00"}