{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DMBVFBK2CBVDDGKJDUNA4UV7AG","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":"619322ae0304cca8ab2e3314970386559aa7be1452b9d6af8159f2df9d3ebdb7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-22T20:10:54Z","title_canon_sha256":"3c6c260381f6e54414377dfb1ea88ca4aeb363016d893135829b3a175430e38d"},"schema_version":"1.0","source":{"id":"1906.10523","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10523","created_at":"2026-05-17T23:42:16Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10523v1","created_at":"2026-05-17T23:42:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10523","created_at":"2026-05-17T23:42:16Z"},{"alias_kind":"pith_short_12","alias_value":"DMBVFBK2CBVD","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DMBVFBK2CBVDDGKJ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DMBVFBK2","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:6b7e19bcd716f06d3b3a61464def6627ae34062c0774f0baec1fa61a706a3cb7","target":"graph","created_at":"2026-05-17T23:42:16Z","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":"In the $l$-path vertex cover problem the input is an undirected graph $G$ and an integer $k$. The goal is to decide whether there is a set of vertices $S$ of size at most $k$ such that $G-S$ does not contain a path with $l$ vertices. In this paper we give parameterized algorithms for $l$-path vertex cover for $l = 5,6,7$, whose time complexities are $O^*(3.945^k)$, $O^*(4.947^k)$, and $O^*(5.951^k)$, respectively.","authors_text":"Dekel Tsur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-22T20:10:54Z","title":"l-path vertex cover is easier than l-hitting set for small l"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10523","kind":"arxiv","version":1},"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:fc20bdb198df753050cc1640cf82f6dc3fd30c22190810bfd003e54432f7d70c","target":"record","created_at":"2026-05-17T23:42:16Z","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":"619322ae0304cca8ab2e3314970386559aa7be1452b9d6af8159f2df9d3ebdb7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-22T20:10:54Z","title_canon_sha256":"3c6c260381f6e54414377dfb1ea88ca4aeb363016d893135829b3a175430e38d"},"schema_version":"1.0","source":{"id":"1906.10523","kind":"arxiv","version":1}},"canonical_sha256":"1b0352855a106a3199491d1a0e52bf01a5816ee16c2f2792a5bd733afa5ec0d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b0352855a106a3199491d1a0e52bf01a5816ee16c2f2792a5bd733afa5ec0d3","first_computed_at":"2026-05-17T23:42:16.112617Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:16.112617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QdtFsCKZEqBqXQhB8vx44afc/yDT4qCobjq4949QhDSNn4Mim8BotD0vveclacJlGG/nGj+51zrTnH+uBFRgBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:16.113100Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.10523","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc20bdb198df753050cc1640cf82f6dc3fd30c22190810bfd003e54432f7d70c","sha256:6b7e19bcd716f06d3b3a61464def6627ae34062c0774f0baec1fa61a706a3cb7"],"state_sha256":"f40144e9ba87d8d1101e63e0298093ae8d92eec6dbe1374204148eb503f449fd"}