{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ANRD35IEMEE22A7IKSBIVXDCVW","short_pith_number":"pith:ANRD35IE","schema_version":"1.0","canonical_sha256":"03623df5046109ad03e854828adc62adbb80b6a17c13dad57a79dba18a09ca51","source":{"kind":"arxiv","id":"1012.2088","version":2},"attestation_state":"computed","paper":{"title":"Minimum k-path vertex cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"math.CO","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}","submitted_at":"2010-12-09T19:25:09Z","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."},"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":"1012.2088","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-09T19:25:09Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"0cfaf864274048e709747676562e41211e71a54acabe590b4a910200420b9c4c","abstract_canon_sha256":"92f2a192b8f9f093900d25f29865434e8dbd4408802a1fc9e001709d8fad8183"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:32.104927Z","signature_b64":"fmoE2CDKNP79cWLA18VUXtxP7sokCDB2R9C088OsrK4GhjUWAG1OaasZ/Zg5XgtcelOswZnIULid8kmd5dYUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03623df5046109ad03e854828adc62adbb80b6a17c13dad57a79dba18a09ca51","last_reissued_at":"2026-05-18T04:16:32.104241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:32.104241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum k-path vertex cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"math.CO","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}","submitted_at":"2010-12-09T19:25:09Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2088","kind":"arxiv","version":2},"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":"1012.2088","created_at":"2026-05-18T04:16:32.104358+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.2088v2","created_at":"2026-05-18T04:16:32.104358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2088","created_at":"2026-05-18T04:16:32.104358+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANRD35IEMEE2","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANRD35IEMEE22A7I","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANRD35IE","created_at":"2026-05-18T12:26:05.355336+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/ANRD35IEMEE22A7IKSBIVXDCVW","json":"https://pith.science/pith/ANRD35IEMEE22A7IKSBIVXDCVW.json","graph_json":"https://pith.science/api/pith-number/ANRD35IEMEE22A7IKSBIVXDCVW/graph.json","events_json":"https://pith.science/api/pith-number/ANRD35IEMEE22A7IKSBIVXDCVW/events.json","paper":"https://pith.science/paper/ANRD35IE"},"agent_actions":{"view_html":"https://pith.science/pith/ANRD35IEMEE22A7IKSBIVXDCVW","download_json":"https://pith.science/pith/ANRD35IEMEE22A7IKSBIVXDCVW.json","view_paper":"https://pith.science/paper/ANRD35IE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.2088&json=true","fetch_graph":"https://pith.science/api/pith-number/ANRD35IEMEE22A7IKSBIVXDCVW/graph.json","fetch_events":"https://pith.science/api/pith-number/ANRD35IEMEE22A7IKSBIVXDCVW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANRD35IEMEE22A7IKSBIVXDCVW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANRD35IEMEE22A7IKSBIVXDCVW/action/storage_attestation","attest_author":"https://pith.science/pith/ANRD35IEMEE22A7IKSBIVXDCVW/action/author_attestation","sign_citation":"https://pith.science/pith/ANRD35IEMEE22A7IKSBIVXDCVW/action/citation_signature","submit_replication":"https://pith.science/pith/ANRD35IEMEE22A7IKSBIVXDCVW/action/replication_record"}},"created_at":"2026-05-18T04:16:32.104358+00:00","updated_at":"2026-05-18T04:16:32.104358+00:00"}