{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YPUA3DNSOIFVLMVMUUKNWW7QU6","short_pith_number":"pith:YPUA3DNS","canonical_record":{"source":{"id":"1610.08461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-24T14:36:20Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"50373e619442bd20c0c1ace4bae1ae048aa53e8f69eec853c96b52b06373345b","abstract_canon_sha256":"36d597be838050cb1659c559364df6b93653fd479960dab3eed870951d376747"},"schema_version":"1.0"},"canonical_sha256":"c3e80d8db2720b55b2aca514db5bf0a7b8fcdbf3835375bced848c2d4c239511","source":{"kind":"arxiv","id":"1610.08461","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08461","created_at":"2026-05-18T01:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08461v1","created_at":"2026-05-18T01:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08461","created_at":"2026-05-18T01:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"YPUA3DNSOIFV","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YPUA3DNSOIFVLMVM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YPUA3DNS","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YPUA3DNSOIFVLMVMUUKNWW7QU6","target":"record","payload":{"canonical_record":{"source":{"id":"1610.08461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-24T14:36:20Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"50373e619442bd20c0c1ace4bae1ae048aa53e8f69eec853c96b52b06373345b","abstract_canon_sha256":"36d597be838050cb1659c559364df6b93653fd479960dab3eed870951d376747"},"schema_version":"1.0"},"canonical_sha256":"c3e80d8db2720b55b2aca514db5bf0a7b8fcdbf3835375bced848c2d4c239511","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:00.801934Z","signature_b64":"Oeu9F5L0WWOvYjgt579Kq+rOL4pKSpnN32lS9SlOX754CCIFqsHwqGk9q/ulCQMWVgoDKULt2kk/GIiJT5LlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3e80d8db2720b55b2aca514db5bf0a7b8fcdbf3835375bced848c2d4c239511","last_reissued_at":"2026-05-18T01:01:00.801102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:00.801102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.08461","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:01:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Za9/BIYZ0+Eyh54Tswai88tcIMA/aYNWnG3nlkTHOP0yTRT8ZeCKhGv0TMN7aNUHqwXtIvIZEx9OG7Ss1fDwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:56:33.104940Z"},"content_sha256":"560f73538651585e1718228bb59bc8b4d9fe636600a1e24de61827f8dc296a2d","schema_version":"1.0","event_id":"sha256:560f73538651585e1718228bb59bc8b4d9fe636600a1e24de61827f8dc296a2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YPUA3DNSOIFVLMVMUUKNWW7QU6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Proposed Algorithm for Minimum Vertex Cover Problem and its Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Gang Hu","submitted_at":"2016-10-24T14:36:20Z","abstract_excerpt":"The paper presents an algorithm for minimum vertex cover problem, which is an NP-Complete problem. The algorithm computes a minimum vertex cover of each input simple graph. Tested by the attached MATLAB programs, Stage 1 of the algorithm is applicable to, i.e., yields a proved minimum vertex cover for, about 99.99% of the tested 610,000 graphs of order 16 and 99.67% of the tested 1,200 graphs of order 32, and Stage 2 of the algorithm is applicable to all of the above tested graphs. All of the tested graphs are randomly generated graphs of random \"edge density\" or in other words, random probabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08461","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:01:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gfGghzOpEMLgmvWEFLAtRFdZtpmcfsTDy3anKjz0iWJum4LK+6JFgOPDkEaoewMql/4B9COBMtRbh2ZvBKwBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:56:33.105286Z"},"content_sha256":"69bc3f5f6dcd3287766c2b7d1475846738b1acaada890a82ecae06eb973dfb34","schema_version":"1.0","event_id":"sha256:69bc3f5f6dcd3287766c2b7d1475846738b1acaada890a82ecae06eb973dfb34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YPUA3DNSOIFVLMVMUUKNWW7QU6/bundle.json","state_url":"https://pith.science/pith/YPUA3DNSOIFVLMVMUUKNWW7QU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YPUA3DNSOIFVLMVMUUKNWW7QU6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T02:56:33Z","links":{"resolver":"https://pith.science/pith/YPUA3DNSOIFVLMVMUUKNWW7QU6","bundle":"https://pith.science/pith/YPUA3DNSOIFVLMVMUUKNWW7QU6/bundle.json","state":"https://pith.science/pith/YPUA3DNSOIFVLMVMUUKNWW7QU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YPUA3DNSOIFVLMVMUUKNWW7QU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YPUA3DNSOIFVLMVMUUKNWW7QU6","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":"36d597be838050cb1659c559364df6b93653fd479960dab3eed870951d376747","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-24T14:36:20Z","title_canon_sha256":"50373e619442bd20c0c1ace4bae1ae048aa53e8f69eec853c96b52b06373345b"},"schema_version":"1.0","source":{"id":"1610.08461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08461","created_at":"2026-05-18T01:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08461v1","created_at":"2026-05-18T01:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08461","created_at":"2026-05-18T01:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"YPUA3DNSOIFV","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YPUA3DNSOIFVLMVM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YPUA3DNS","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:69bc3f5f6dcd3287766c2b7d1475846738b1acaada890a82ecae06eb973dfb34","target":"graph","created_at":"2026-05-18T01:01:00Z","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 paper presents an algorithm for minimum vertex cover problem, which is an NP-Complete problem. The algorithm computes a minimum vertex cover of each input simple graph. Tested by the attached MATLAB programs, Stage 1 of the algorithm is applicable to, i.e., yields a proved minimum vertex cover for, about 99.99% of the tested 610,000 graphs of order 16 and 99.67% of the tested 1,200 graphs of order 32, and Stage 2 of the algorithm is applicable to all of the above tested graphs. All of the tested graphs are randomly generated graphs of random \"edge density\" or in other words, random probabi","authors_text":"Gang Hu","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-24T14:36:20Z","title":"A Proposed Algorithm for Minimum Vertex Cover Problem and its Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08461","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:560f73538651585e1718228bb59bc8b4d9fe636600a1e24de61827f8dc296a2d","target":"record","created_at":"2026-05-18T01:01:00Z","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":"36d597be838050cb1659c559364df6b93653fd479960dab3eed870951d376747","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-24T14:36:20Z","title_canon_sha256":"50373e619442bd20c0c1ace4bae1ae048aa53e8f69eec853c96b52b06373345b"},"schema_version":"1.0","source":{"id":"1610.08461","kind":"arxiv","version":1}},"canonical_sha256":"c3e80d8db2720b55b2aca514db5bf0a7b8fcdbf3835375bced848c2d4c239511","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3e80d8db2720b55b2aca514db5bf0a7b8fcdbf3835375bced848c2d4c239511","first_computed_at":"2026-05-18T01:01:00.801102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:00.801102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Oeu9F5L0WWOvYjgt579Kq+rOL4pKSpnN32lS9SlOX754CCIFqsHwqGk9q/ulCQMWVgoDKULt2kk/GIiJT5LlBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:00.801934Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:560f73538651585e1718228bb59bc8b4d9fe636600a1e24de61827f8dc296a2d","sha256:69bc3f5f6dcd3287766c2b7d1475846738b1acaada890a82ecae06eb973dfb34"],"state_sha256":"22fd585a4c32a641d99ad775030e652267496f1f6878756d38a659098bfc1d16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c5OhQI2vVzODiVpVvVRKrpphtPYKpmgjou1jWMNTZyYjowBBK5X1hRt/QYqiw0d5uHhl//oWKOi8qmWEqQ+iBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:56:33.107307Z","bundle_sha256":"07a866f1337dfc3e0f4321725699875eee0e3b0697f6bd24cbfa0166e7525bdb"}}