{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NUUU2OA3ZAZBYSHT6LPNSAYAST","short_pith_number":"pith:NUUU2OA3","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"},"canonical_sha256":"6d294d381bc8321c48f3f2ded9030094f0e7271efe9b62a3e77132e1c6455f46","source":{"kind":"arxiv","id":"1603.04376","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04376","created_at":"2026-05-18T01:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04376v3","created_at":"2026-05-18T01:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04376","created_at":"2026-05-18T01:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"NUUU2OA3ZAZB","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NUUU2OA3ZAZBYSHT","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NUUU2OA3","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NUUU2OA3ZAZBYSHT6LPNSAYAST","target":"record","payload":{"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"},"canonical_sha256":"6d294d381bc8321c48f3f2ded9030094f0e7271efe9b62a3e77132e1c6455f46","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"},"source_kind":"arxiv","source_id":"1603.04376","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:10:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VN24SskuriOxR6Slszo5Xda4Q7/SGcTKRHIyfdx/86TNgABH/SBxD3wg5qJ8rtuniEaYSvDHmK2oXcklhqvkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:29:25.832852Z"},"content_sha256":"158cf1f319ae04f65b29a6021bfffd4aef1f600839033d881bb83156739ce61d","schema_version":"1.0","event_id":"sha256:158cf1f319ae04f65b29a6021bfffd4aef1f600839033d881bb83156739ce61d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NUUU2OA3ZAZBYSHT6LPNSAYAST","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:10:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/+Njzb/9XdAKR+kTB4WFUb7v4YWKmJ4x+wsmtPdDv/859Q+TY0Xc1KsX35KxkA8JBkhTDCsGy6tGzbZOdIU2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:29:25.833247Z"},"content_sha256":"733149d3d910c4f20f8c1c67be286abde7ba212f814edbea6cf8df1979576cf0","schema_version":"1.0","event_id":"sha256:733149d3d910c4f20f8c1c67be286abde7ba212f814edbea6cf8df1979576cf0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NUUU2OA3ZAZBYSHT6LPNSAYAST/bundle.json","state_url":"https://pith.science/pith/NUUU2OA3ZAZBYSHT6LPNSAYAST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NUUU2OA3ZAZBYSHT6LPNSAYAST/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T08:29:25Z","links":{"resolver":"https://pith.science/pith/NUUU2OA3ZAZBYSHT6LPNSAYAST","bundle":"https://pith.science/pith/NUUU2OA3ZAZBYSHT6LPNSAYAST/bundle.json","state":"https://pith.science/pith/NUUU2OA3ZAZBYSHT6LPNSAYAST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NUUU2OA3ZAZBYSHT6LPNSAYAST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NUUU2OA3ZAZBYSHT6LPNSAYAST","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d77b1e81752616e267d9a8f84fb4e67e45b718101a95d8e98dbd73874e8ce295","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-14T18:11:21Z","title_canon_sha256":"266a451b7cf9cc4dfdd0ae78119aa6c0501ab4bd9915420eada30abf0e1f6529"},"schema_version":"1.0","source":{"id":"1603.04376","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04376","created_at":"2026-05-18T01:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04376v3","created_at":"2026-05-18T01:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04376","created_at":"2026-05-18T01:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"NUUU2OA3ZAZB","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NUUU2OA3ZAZBYSHT","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NUUU2OA3","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:733149d3d910c4f20f8c1c67be286abde7ba212f814edbea6cf8df1979576cf0","target":"graph","created_at":"2026-05-18T01:10:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Andrew van der Poel, Blair D. Sullivan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-14T18:11:21Z","title":"A Fast Parameterized Algorithm for Co-Path Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04376","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:158cf1f319ae04f65b29a6021bfffd4aef1f600839033d881bb83156739ce61d","target":"record","created_at":"2026-05-18T01:10:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d77b1e81752616e267d9a8f84fb4e67e45b718101a95d8e98dbd73874e8ce295","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-14T18:11:21Z","title_canon_sha256":"266a451b7cf9cc4dfdd0ae78119aa6c0501ab4bd9915420eada30abf0e1f6529"},"schema_version":"1.0","source":{"id":"1603.04376","kind":"arxiv","version":3}},"canonical_sha256":"6d294d381bc8321c48f3f2ded9030094f0e7271efe9b62a3e77132e1c6455f46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d294d381bc8321c48f3f2ded9030094f0e7271efe9b62a3e77132e1c6455f46","first_computed_at":"2026-05-18T01:10:20.033810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:20.033810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m3UrEeUc/VIIjWwGrt2fIZx0F1A9Wj7CM1lO4X5nduM4P0fn5HqT8NotVPUKPA2BCHgfNvCch3yCVUlQq2P1Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:20.034683Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04376","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:158cf1f319ae04f65b29a6021bfffd4aef1f600839033d881bb83156739ce61d","sha256:733149d3d910c4f20f8c1c67be286abde7ba212f814edbea6cf8df1979576cf0"],"state_sha256":"641ebebcccdc0a9747feadb0caacc1fde58d19fce01e994137c61bbf5063399e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WsOMbMLXf1RyZfjawm1iapBYbug4B6F5D1gP/F/Gf78z3rPBbg4FcaMOt9nFG6d9+wvw2z6x5eP2LwLS6O6YAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T08:29:25.835534Z","bundle_sha256":"3bb6168fff912b1a6abc2909c7a709154abb1ca8c210d86e4d050c0f43c4e0bc"}}