{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HXSZOEYDWQF3GCP533YG7ZYXZT","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":"93c40d22962dbaf21d83a681a8addf6320446aa093f57ae5f1d1a8f18db6ea01","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-04T01:42:48Z","title_canon_sha256":"12f4cde17eaeb51ee1092a9f45d882947d2c4491eb1d68e3ac7a2d3435e492a1"},"schema_version":"1.0","source":{"id":"1402.0584","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0584","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0584v1","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0584","created_at":"2026-05-18T03:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"HXSZOEYDWQF3","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HXSZOEYDWQF3GCP5","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HXSZOEYD","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:280a3ff49ea07d675cc6b6344e8ea2263abec29b0d6e9f4cd6c906eb1d619c90","target":"graph","created_at":"2026-05-18T03:00:13Z","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":"The Minimum Vertex Cover (MVC) problem is a prominent NP-hard combinatorial optimization problem of great importance in both theory and application. Local search has proved successful for this problem. However, there are two main drawbacks in state-of-the-art MVC local search algorithms. First, they select a pair of vertices to exchange simultaneously, which is time-consuming. Secondly, although using edge weighting techniques to diversify the search, these algorithms lack mechanisms for decreasing the weights. To address these issues, we propose two new strategies: two-stage exchange and edge","authors_text":"Abdul Sattar, Chuan Luo, Kaile Su, Shaowei Cai","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-04T01:42:48Z","title":"NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0584","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:4334b6bf25213f5a39f00d5770b08baced15c53fbd9e2705cd2dadb16fae4722","target":"record","created_at":"2026-05-18T03:00:13Z","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":"93c40d22962dbaf21d83a681a8addf6320446aa093f57ae5f1d1a8f18db6ea01","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-04T01:42:48Z","title_canon_sha256":"12f4cde17eaeb51ee1092a9f45d882947d2c4491eb1d68e3ac7a2d3435e492a1"},"schema_version":"1.0","source":{"id":"1402.0584","kind":"arxiv","version":1}},"canonical_sha256":"3de5971303b40bb309fddef06fe717ccd08e612da92b22cebdcb8a058db17759","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3de5971303b40bb309fddef06fe717ccd08e612da92b22cebdcb8a058db17759","first_computed_at":"2026-05-18T03:00:13.706387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:13.706387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aRkJSr0tdGbG7+00EHojGWp64smDc//Me6nicpMqgdpa17Wu2ml3EolUJk/AerZ7Jq4vMxqHGx5LrOJ68Y5aDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:13.707274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0584","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4334b6bf25213f5a39f00d5770b08baced15c53fbd9e2705cd2dadb16fae4722","sha256:280a3ff49ea07d675cc6b6344e8ea2263abec29b0d6e9f4cd6c906eb1d619c90"],"state_sha256":"c76314e07fdd28c5b4ebb81282a2b2f873666671544a972b918068c4ec66dcb7"}