{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:62OHQ3SXX66U3W6MYVGXOYJWQX","short_pith_number":"pith:62OHQ3SX","schema_version":"1.0","canonical_sha256":"f69c786e57bfbd4ddbccc54d77613685fecec97ffcd5c0c6c58402fa4fbdad48","source":{"kind":"arxiv","id":"1903.05948","version":1},"attestation_state":"computed","paper":{"title":"An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Bo Jin, Chu-Min Li, Junping Zhou, Luzhi Wang, Minghao Yin","submitted_at":"2019-03-14T12:44:55Z","abstract_excerpt":"This paper proposes a novel branch-and-bound(BMWVC) algorithm to exactly solve the minimum weight vertex cover problem (MWVC) in large graphs. The original contribution is several new graph reduction rules, allowing to reduce a graph G and the time needed to find a minimum weight vertex cover in G. Experiments on large graphs from real-world applications show that the reduction rules are effective and the resulting BMWVC algorithm outperforms relevant exact and heuristic MWVC algorithms."},"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":"1903.05948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-14T12:44:55Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8cdad0dcd544810099fdade7f2083867929f7fed740b26359f3c6cd5a3e319aa","abstract_canon_sha256":"fe051d75cd7155fd0956111357a43a8239be51610f48c7d3e74eab2cab26f5a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:15.740227Z","signature_b64":"l6pFwIHnoqFMis9sR6wHTrr9EQ356ErqnlBH5yEfE8bJo4VlNlIF8+Py3WMsZ4b9qqzrHR1JPlLvRlmpvKCECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f69c786e57bfbd4ddbccc54d77613685fecec97ffcd5c0c6c58402fa4fbdad48","last_reissued_at":"2026-05-17T23:51:15.739802Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:15.739802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Bo Jin, Chu-Min Li, Junping Zhou, Luzhi Wang, Minghao Yin","submitted_at":"2019-03-14T12:44:55Z","abstract_excerpt":"This paper proposes a novel branch-and-bound(BMWVC) algorithm to exactly solve the minimum weight vertex cover problem (MWVC) in large graphs. The original contribution is several new graph reduction rules, allowing to reduce a graph G and the time needed to find a minimum weight vertex cover in G. Experiments on large graphs from real-world applications show that the reduction rules are effective and the resulting BMWVC algorithm outperforms relevant exact and heuristic MWVC algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05948","kind":"arxiv","version":1},"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":"1903.05948","created_at":"2026-05-17T23:51:15.739866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.05948v1","created_at":"2026-05-17T23:51:15.739866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05948","created_at":"2026-05-17T23:51:15.739866+00:00"},{"alias_kind":"pith_short_12","alias_value":"62OHQ3SXX66U","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"62OHQ3SXX66U3W6M","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"62OHQ3SX","created_at":"2026-05-18T12:33:10.108867+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/62OHQ3SXX66U3W6MYVGXOYJWQX","json":"https://pith.science/pith/62OHQ3SXX66U3W6MYVGXOYJWQX.json","graph_json":"https://pith.science/api/pith-number/62OHQ3SXX66U3W6MYVGXOYJWQX/graph.json","events_json":"https://pith.science/api/pith-number/62OHQ3SXX66U3W6MYVGXOYJWQX/events.json","paper":"https://pith.science/paper/62OHQ3SX"},"agent_actions":{"view_html":"https://pith.science/pith/62OHQ3SXX66U3W6MYVGXOYJWQX","download_json":"https://pith.science/pith/62OHQ3SXX66U3W6MYVGXOYJWQX.json","view_paper":"https://pith.science/paper/62OHQ3SX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.05948&json=true","fetch_graph":"https://pith.science/api/pith-number/62OHQ3SXX66U3W6MYVGXOYJWQX/graph.json","fetch_events":"https://pith.science/api/pith-number/62OHQ3SXX66U3W6MYVGXOYJWQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62OHQ3SXX66U3W6MYVGXOYJWQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62OHQ3SXX66U3W6MYVGXOYJWQX/action/storage_attestation","attest_author":"https://pith.science/pith/62OHQ3SXX66U3W6MYVGXOYJWQX/action/author_attestation","sign_citation":"https://pith.science/pith/62OHQ3SXX66U3W6MYVGXOYJWQX/action/citation_signature","submit_replication":"https://pith.science/pith/62OHQ3SXX66U3W6MYVGXOYJWQX/action/replication_record"}},"created_at":"2026-05-17T23:51:15.739866+00:00","updated_at":"2026-05-17T23:51:15.739866+00:00"}