{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ANRD35IEMEE22A7IKSBIVXDCVW","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":"92f2a192b8f9f093900d25f29865434e8dbd4408802a1fc9e001709d8fad8183","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-09T19:25:09Z","title_canon_sha256":"0cfaf864274048e709747676562e41211e71a54acabe590b4a910200420b9c4c"},"schema_version":"1.0","source":{"id":"1012.2088","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2088","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2088v2","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2088","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"pith_short_12","alias_value":"ANRD35IEMEE2","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"ANRD35IEMEE22A7I","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"ANRD35IE","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:475cbcb06101106331c0db1b31a77d9a98f5027a8b60d6db6d6047209682ff80","target":"graph","created_at":"2026-05-18T04:16:32Z","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":"A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by \\psi_k(G) the minimum cardinality of a k-path vertex cover in G. It is shown that the problem of determining \\psi_k(G) is NP-hard for each k \\geq 2, while for trees the problem can be solved in linear time. We investigate upper bounds on the value of \\psi_k(G) and provide several estimations and exact values of \\psi_k(G). We also prove that \\psi_3(G) \\leq (2n + m)/6, for every graph G with n vertices and m edges.","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Franti\\v{s}ek Kardo\\v{s}, Gabriel Semani\\v{s}in, J\\'an Katreni\\v{c}","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-09T19:25:09Z","title":"Minimum k-path vertex cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2088","kind":"arxiv","version":2},"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:849d76b69d5c812c95a37f80ed2ea2cc22bc007d076c7af9caa2e44fef7a2622","target":"record","created_at":"2026-05-18T04:16:32Z","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":"92f2a192b8f9f093900d25f29865434e8dbd4408802a1fc9e001709d8fad8183","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-09T19:25:09Z","title_canon_sha256":"0cfaf864274048e709747676562e41211e71a54acabe590b4a910200420b9c4c"},"schema_version":"1.0","source":{"id":"1012.2088","kind":"arxiv","version":2}},"canonical_sha256":"03623df5046109ad03e854828adc62adbb80b6a17c13dad57a79dba18a09ca51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03623df5046109ad03e854828adc62adbb80b6a17c13dad57a79dba18a09ca51","first_computed_at":"2026-05-18T04:16:32.104241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:32.104241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fmoE2CDKNP79cWLA18VUXtxP7sokCDB2R9C088OsrK4GhjUWAG1OaasZ/Zg5XgtcelOswZnIULid8kmd5dYUAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:32.104927Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.2088","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:849d76b69d5c812c95a37f80ed2ea2cc22bc007d076c7af9caa2e44fef7a2622","sha256:475cbcb06101106331c0db1b31a77d9a98f5027a8b60d6db6d6047209682ff80"],"state_sha256":"34e96c8c5eecaca7ff97a456dc870d54edc6af779cf6116091a2a221204c8fcd"}