{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3NBPBCKCXAQRCPKPZN7DOHRDWY","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":"771d8ed70e97beb9a36927f678e3edb6a0019388bb5650668c024878236e8c6d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-22T12:59:20Z","title_canon_sha256":"34cf31d8dd1edd45f7daeb9150c6d85d6ca5ec79a6e562bc8f57598c94b91461"},"schema_version":"1.0","source":{"id":"1304.5934","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5934","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5934v1","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5934","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"pith_short_12","alias_value":"3NBPBCKCXAQR","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3NBPBCKCXAQRCPKP","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3NBPBCKC","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:bdc42f4bf611432b297d1d65a854116c019d5faf807f93114f9ed9538c5b4587","target":"graph","created_at":"2026-05-18T03:27:23Z","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":"It is well-known that the Vertex Cover problem is in P on bipartite graphs, however; the computational complexity of the Partial Vertex Cover problem on bipartite graphs is open. In this paper, we first show that the Partial Vertex Cover problem is NP-hard on bipartite graphs. We then identify an interesting special case of bipartite graphs, for which the Partial Vertex Cover problem can be solved in polynomial-time. We also show that the set of acyclic bipartite graphs, i.e., forests, and the set of bipartite graph where the degree of each vertex is at most 3 fall into that special case. Ther","authors_text":"Bugra Caskurlu, K. Subramani","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-22T12:59:20Z","title":"On Partial Vertex Cover on Bipartite Graphs and Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5934","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:b6787a071a098ad455915f0f1feb12187f7c80097cba1136b725482e4d5c0e61","target":"record","created_at":"2026-05-18T03:27:23Z","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":"771d8ed70e97beb9a36927f678e3edb6a0019388bb5650668c024878236e8c6d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-22T12:59:20Z","title_canon_sha256":"34cf31d8dd1edd45f7daeb9150c6d85d6ca5ec79a6e562bc8f57598c94b91461"},"schema_version":"1.0","source":{"id":"1304.5934","kind":"arxiv","version":1}},"canonical_sha256":"db42f08942b821113d4fcb7e371e23b62ecbd442e4981024ff279319be66d48e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db42f08942b821113d4fcb7e371e23b62ecbd442e4981024ff279319be66d48e","first_computed_at":"2026-05-18T03:27:23.730991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:23.730991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"867X4P/KczDit53ljQYOh19VARIXObeUQ41N/wv0RXgWPHK0pt3mVNdRyN7+a/VWv3fyE0jTmPX7Q8R2zCKqDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:23.731692Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5934","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6787a071a098ad455915f0f1feb12187f7c80097cba1136b725482e4d5c0e61","sha256:bdc42f4bf611432b297d1d65a854116c019d5faf807f93114f9ed9538c5b4587"],"state_sha256":"5eb189b026aa698be2006fa2aae35d91f580e452fc2a922e28f70b2063eb4106"}