{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WU6ANEWYE5VIOGTCO2J3AIVDRG","short_pith_number":"pith:WU6ANEWY","schema_version":"1.0","canonical_sha256":"b53c0692d8276a871a627693b022a389aff3b8622b4cff7aa1035e7517cc7568","source":{"kind":"arxiv","id":"2605.19870","version":1},"attestation_state":"computed","paper":{"title":"Deterministic Single Exponential Time Algorithms for Co-Path Packing and Co-Path Set Parameterized by Treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kangyi Tian, Mingyu Xiao, Yuxi Liu","submitted_at":"2026-05-19T14:01:40Z","abstract_excerpt":"The \\textsc{Co-Path Packing} (resp., \\textsc{Co-Path Set}) problem asks whether a given graph can be edited to a collection of induced paths by deleting at most $k$ vertices (resp., $k$ edges). Both are fundamental problems with significant applications in bioinformatics and have been extensively studied within the framework of exact and parameterized algorithms. Currently, the state-of-the-art approach utilizes the randomized ``Cut \\& Count'' technique, which solves \\textsc{Co-Path Set} in $O^*(4^{\\mathbf{tw}})$ time and \\textsc{Co-Path Packing} in $O^*(5^{\\mathbf{pw}})$ time, where $\\mathbf{"},"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":"2605.19870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-19T14:01:40Z","cross_cats_sorted":[],"title_canon_sha256":"68c8379ddca476361e52e96f040bc6b0096a55e71a1308bea8948d3d1a859a31","abstract_canon_sha256":"667faef27554e92c9fe7acc8fbc7f5af1e7e9bf1823918eb51e43cd82c07315d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:06:18.397352Z","signature_b64":"Y7ofotXdM4iYxW4+AU7lx8rbZugYV9SrQZ+dIkup5RFYQDpDWknPpDepvrAV2et5hhO88UgyzosZijpKf+eTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b53c0692d8276a871a627693b022a389aff3b8622b4cff7aa1035e7517cc7568","last_reissued_at":"2026-05-20T01:06:18.396718Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:06:18.396718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Single Exponential Time Algorithms for Co-Path Packing and Co-Path Set Parameterized by Treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kangyi Tian, Mingyu Xiao, Yuxi Liu","submitted_at":"2026-05-19T14:01:40Z","abstract_excerpt":"The \\textsc{Co-Path Packing} (resp., \\textsc{Co-Path Set}) problem asks whether a given graph can be edited to a collection of induced paths by deleting at most $k$ vertices (resp., $k$ edges). Both are fundamental problems with significant applications in bioinformatics and have been extensively studied within the framework of exact and parameterized algorithms. Currently, the state-of-the-art approach utilizes the randomized ``Cut \\& Count'' technique, which solves \\textsc{Co-Path Set} in $O^*(4^{\\mathbf{tw}})$ time and \\textsc{Co-Path Packing} in $O^*(5^{\\mathbf{pw}})$ time, where $\\mathbf{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19870","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.19870/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.19870","created_at":"2026-05-20T01:06:18.396807+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19870v1","created_at":"2026-05-20T01:06:18.396807+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19870","created_at":"2026-05-20T01:06:18.396807+00:00"},{"alias_kind":"pith_short_12","alias_value":"WU6ANEWYE5VI","created_at":"2026-05-20T01:06:18.396807+00:00"},{"alias_kind":"pith_short_16","alias_value":"WU6ANEWYE5VIOGTC","created_at":"2026-05-20T01:06:18.396807+00:00"},{"alias_kind":"pith_short_8","alias_value":"WU6ANEWY","created_at":"2026-05-20T01:06:18.396807+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/WU6ANEWYE5VIOGTCO2J3AIVDRG","json":"https://pith.science/pith/WU6ANEWYE5VIOGTCO2J3AIVDRG.json","graph_json":"https://pith.science/api/pith-number/WU6ANEWYE5VIOGTCO2J3AIVDRG/graph.json","events_json":"https://pith.science/api/pith-number/WU6ANEWYE5VIOGTCO2J3AIVDRG/events.json","paper":"https://pith.science/paper/WU6ANEWY"},"agent_actions":{"view_html":"https://pith.science/pith/WU6ANEWYE5VIOGTCO2J3AIVDRG","download_json":"https://pith.science/pith/WU6ANEWYE5VIOGTCO2J3AIVDRG.json","view_paper":"https://pith.science/paper/WU6ANEWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19870&json=true","fetch_graph":"https://pith.science/api/pith-number/WU6ANEWYE5VIOGTCO2J3AIVDRG/graph.json","fetch_events":"https://pith.science/api/pith-number/WU6ANEWYE5VIOGTCO2J3AIVDRG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WU6ANEWYE5VIOGTCO2J3AIVDRG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WU6ANEWYE5VIOGTCO2J3AIVDRG/action/storage_attestation","attest_author":"https://pith.science/pith/WU6ANEWYE5VIOGTCO2J3AIVDRG/action/author_attestation","sign_citation":"https://pith.science/pith/WU6ANEWYE5VIOGTCO2J3AIVDRG/action/citation_signature","submit_replication":"https://pith.science/pith/WU6ANEWYE5VIOGTCO2J3AIVDRG/action/replication_record"}},"created_at":"2026-05-20T01:06:18.396807+00:00","updated_at":"2026-05-20T01:06:18.396807+00:00"}