{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NUUU2OA3ZAZBYSHT6LPNSAYAST","short_pith_number":"pith:NUUU2OA3","schema_version":"1.0","canonical_sha256":"6d294d381bc8321c48f3f2ded9030094f0e7271efe9b62a3e77132e1c6455f46","source":{"kind":"arxiv","id":"1603.04376","version":3},"attestation_state":"computed","paper":{"title":"A Fast Parameterized Algorithm for Co-Path Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew van der Poel, Blair D. Sullivan","submitted_at":"2016-03-14T18:11:21Z","abstract_excerpt":"The k-CO-PATH SET problem asks, given a graph G and a positive integer k, whether one can delete k edges from G so that the remainder is a collection of disjoint paths. We give a linear-time fpt algorithm with complexity O^*(1.588^k) for deciding k-CO-PATH SET, significantly improving the previously best known O^*(2.17^k) of Feng, Zhou, and Wang (2015). Our main tool is a new O^*(4^{tw(G)}) algorithm for CO-PATH SET using the Cut&Count framework, where tw(G) denotes treewidth. In general graphs, we combine this with a branching algorithm which refines a 6k-kernel into reduced instances, which "},"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":"1603.04376","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-14T18:11:21Z","cross_cats_sorted":[],"title_canon_sha256":"266a451b7cf9cc4dfdd0ae78119aa6c0501ab4bd9915420eada30abf0e1f6529","abstract_canon_sha256":"d77b1e81752616e267d9a8f84fb4e67e45b718101a95d8e98dbd73874e8ce295"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:20.034683Z","signature_b64":"m3UrEeUc/VIIjWwGrt2fIZx0F1A9Wj7CM1lO4X5nduM4P0fn5HqT8NotVPUKPA2BCHgfNvCch3yCVUlQq2P1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d294d381bc8321c48f3f2ded9030094f0e7271efe9b62a3e77132e1c6455f46","last_reissued_at":"2026-05-18T01:10:20.033810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:20.033810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Parameterized Algorithm for Co-Path Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew van der Poel, Blair D. Sullivan","submitted_at":"2016-03-14T18:11:21Z","abstract_excerpt":"The k-CO-PATH SET problem asks, given a graph G and a positive integer k, whether one can delete k edges from G so that the remainder is a collection of disjoint paths. We give a linear-time fpt algorithm with complexity O^*(1.588^k) for deciding k-CO-PATH SET, significantly improving the previously best known O^*(2.17^k) of Feng, Zhou, and Wang (2015). Our main tool is a new O^*(4^{tw(G)}) algorithm for CO-PATH SET using the Cut&Count framework, where tw(G) denotes treewidth. In general graphs, we combine this with a branching algorithm which refines a 6k-kernel into reduced instances, which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04376","kind":"arxiv","version":3},"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":"1603.04376","created_at":"2026-05-18T01:10:20.033886+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.04376v3","created_at":"2026-05-18T01:10:20.033886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04376","created_at":"2026-05-18T01:10:20.033886+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUUU2OA3ZAZB","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUUU2OA3ZAZBYSHT","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUUU2OA3","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/NUUU2OA3ZAZBYSHT6LPNSAYAST","json":"https://pith.science/pith/NUUU2OA3ZAZBYSHT6LPNSAYAST.json","graph_json":"https://pith.science/api/pith-number/NUUU2OA3ZAZBYSHT6LPNSAYAST/graph.json","events_json":"https://pith.science/api/pith-number/NUUU2OA3ZAZBYSHT6LPNSAYAST/events.json","paper":"https://pith.science/paper/NUUU2OA3"},"agent_actions":{"view_html":"https://pith.science/pith/NUUU2OA3ZAZBYSHT6LPNSAYAST","download_json":"https://pith.science/pith/NUUU2OA3ZAZBYSHT6LPNSAYAST.json","view_paper":"https://pith.science/paper/NUUU2OA3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.04376&json=true","fetch_graph":"https://pith.science/api/pith-number/NUUU2OA3ZAZBYSHT6LPNSAYAST/graph.json","fetch_events":"https://pith.science/api/pith-number/NUUU2OA3ZAZBYSHT6LPNSAYAST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUUU2OA3ZAZBYSHT6LPNSAYAST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUUU2OA3ZAZBYSHT6LPNSAYAST/action/storage_attestation","attest_author":"https://pith.science/pith/NUUU2OA3ZAZBYSHT6LPNSAYAST/action/author_attestation","sign_citation":"https://pith.science/pith/NUUU2OA3ZAZBYSHT6LPNSAYAST/action/citation_signature","submit_replication":"https://pith.science/pith/NUUU2OA3ZAZBYSHT6LPNSAYAST/action/replication_record"}},"created_at":"2026-05-18T01:10:20.033886+00:00","updated_at":"2026-05-18T01:10:20.033886+00:00"}