{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:67FKJUYDOE4CTNWHHNYTDO4IZ5","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":"5e1a38a901f99318ed88369839995643e76deb0bd5494c8d94388d9e78afe4ae","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-26T18:32:44Z","title_canon_sha256":"81df7f0fe24a7168013aaeceac9a731967e7625870e15cadbcdfbc603f5d3927"},"schema_version":"1.0","source":{"id":"1904.12011","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12011","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12011v1","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12011","created_at":"2026-05-17T23:47:39Z"},{"alias_kind":"pith_short_12","alias_value":"67FKJUYDOE4C","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"67FKJUYDOE4CTNWH","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"67FKJUYD","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:2eebf0f0f1ea78bb10e401fb0198b7b7123b904d56975e4861ad9310412bfa78","target":"graph","created_at":"2026-05-17T23:47:39Z","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 weighted partial vertex cover problem (WPVC), we are given a graph $G=(V,E)$, cost function $c:V\\rightarrow N$, profit function $p:E\\rightarrow N$, and positive integers $R$ and $L$. The goal is to check whether there is a subset $V'\\subseteq V$ of cost at most $R$, such that the total profit of edges covered by $V'$ is at least $L$. In this paper we study the fixed-parameter tractability of WPVC in bipartite graphs (WPVCB). By extending the methods of Amini et al., we show that WPVCB is FPT with respect to $R$ if $c\\equiv 1$. On the negative side, it is $W[1]$-hard for arbitrary $c$, e","authors_text":"Garik Petrosyan, K. Subramani, Vahan Mkrtchyan","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-26T18:32:44Z","title":"Parameterized algorithms for Partial vertex covers in bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12011","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:533d4f93bda4d5d2f0efe48666bfd7770b1e5e24ced8801abb263c603c2a4c92","target":"record","created_at":"2026-05-17T23:47:39Z","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":"5e1a38a901f99318ed88369839995643e76deb0bd5494c8d94388d9e78afe4ae","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-26T18:32:44Z","title_canon_sha256":"81df7f0fe24a7168013aaeceac9a731967e7625870e15cadbcdfbc603f5d3927"},"schema_version":"1.0","source":{"id":"1904.12011","kind":"arxiv","version":1}},"canonical_sha256":"f7caa4d303713829b6c73b7131bb88cf591bec74e2e11d55b4b04911f2e990bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7caa4d303713829b6c73b7131bb88cf591bec74e2e11d55b4b04911f2e990bd","first_computed_at":"2026-05-17T23:47:39.062428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:39.062428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fUynEacPsJ0VYma7seZiHDiE5TQMwFCgjFfPHpZUshib62qidJKDZUuCHsglbSSsI//to4lQtAoBvVoG0YbiBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:39.062811Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.12011","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:533d4f93bda4d5d2f0efe48666bfd7770b1e5e24ced8801abb263c603c2a4c92","sha256:2eebf0f0f1ea78bb10e401fb0198b7b7123b904d56975e4861ad9310412bfa78"],"state_sha256":"d410675672168f9f7371c125eeff326d823980c05305896b09e36e41c015fe03"}