{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2001:MJL3IUOZBKJ5S7OHZEZP4SWJCC","short_pith_number":"pith:MJL3IUOZ","canonical_record":{"source":{"id":"cs/0110025","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"2001-10-10T15:02:35Z","cross_cats_sorted":[],"title_canon_sha256":"89896e61a4d2624a04d44e750c790326f49f70d4c9f32cec8c77b24ab52d4624","abstract_canon_sha256":"1edb022821f4f9d308819e2d16707802aa85a416e945b3a7ee70d8ed83708d81"},"schema_version":"1.0"},"canonical_sha256":"6257b451d90a93d97dc7c932fe4ac910861c836b115c9e1f97753d1ceacd7732","source":{"kind":"arxiv","id":"cs/0110025","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0110025","created_at":"2026-05-18T01:09:08Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0110025v2","created_at":"2026-05-18T01:09:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0110025","created_at":"2026-05-18T01:09:08Z"},{"alias_kind":"pith_short_12","alias_value":"MJL3IUOZBKJ5","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"MJL3IUOZBKJ5S7OH","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"MJL3IUOZ","created_at":"2026-05-18T12:25:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2001:MJL3IUOZBKJ5S7OHZEZP4SWJCC","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0110025","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"2001-10-10T15:02:35Z","cross_cats_sorted":[],"title_canon_sha256":"89896e61a4d2624a04d44e750c790326f49f70d4c9f32cec8c77b24ab52d4624","abstract_canon_sha256":"1edb022821f4f9d308819e2d16707802aa85a416e945b3a7ee70d8ed83708d81"},"schema_version":"1.0"},"canonical_sha256":"6257b451d90a93d97dc7c932fe4ac910861c836b115c9e1f97753d1ceacd7732","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:08.424972Z","signature_b64":"Es0BskyFBPByeP0jFNd+Q2Dmfk9OgFelf5r/1kFy4aqWqMNFpSjAf69n4JdTXB+Gcww7DOeV+8acSh8hx8rRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6257b451d90a93d97dc7c932fe4ac910861c836b115c9e1f97753d1ceacd7732","last_reissued_at":"2026-05-18T01:09:08.424527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:08.424527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0110025","source_version":2,"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:09:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lOE4tq1FrJ66F0RnbP5M504iJwGL7IV/HSyKGzyys8WUOxtEWKd2rkqxfKI+9goms+pD4bWSM7kX7wDtV0oyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:55:10.608595Z"},"content_sha256":"0fb020d493a9ebbe967669caa6b0c3d1d4d8975ce3611f6f7bdf232fdfb04907","schema_version":"1.0","event_id":"sha256:0fb020d493a9ebbe967669caa6b0c3d1d4d8975ce3611f6f7bdf232fdfb04907"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2001:MJL3IUOZBKJ5S7OHZEZP4SWJCC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Edith Hemaspaandra, Holger Spakowski, J\\\"org Rothe","submitted_at":"2001-10-10T15:02:35Z","abstract_excerpt":"For both the edge deletion heuristic and the maximum-degree greedy heuristic, we study the problem of recognizing those graphs for which that heuristic can approximate the size of a minimum vertex cover within a constant factor of r, where r is a fixed rational number. Our main results are that these problems are complete for the class of problems solvable via parallel access to NP. To achieve these main results, we also show that the restriction of the vertex cover problem to those graphs for which either of these heuristics can find an optimal solution remains NP-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0110025","kind":"arxiv","version":2},"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:09:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2MCyxRzeZekZED0y0hBX9oSHoTk06zxUJFbU3Hp2f2l6M5qmsmO5Rjb3QbHen3UHppo9RwlRI8y5aNd0yeeKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:55:10.608935Z"},"content_sha256":"c336f18d3ee54e0f2821591af8eeecb2842de9dd176f2c1ceb2d660798e42382","schema_version":"1.0","event_id":"sha256:c336f18d3ee54e0f2821591af8eeecb2842de9dd176f2c1ceb2d660798e42382"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MJL3IUOZBKJ5S7OHZEZP4SWJCC/bundle.json","state_url":"https://pith.science/pith/MJL3IUOZBKJ5S7OHZEZP4SWJCC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MJL3IUOZBKJ5S7OHZEZP4SWJCC/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-04T03:55:10Z","links":{"resolver":"https://pith.science/pith/MJL3IUOZBKJ5S7OHZEZP4SWJCC","bundle":"https://pith.science/pith/MJL3IUOZBKJ5S7OHZEZP4SWJCC/bundle.json","state":"https://pith.science/pith/MJL3IUOZBKJ5S7OHZEZP4SWJCC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MJL3IUOZBKJ5S7OHZEZP4SWJCC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2001:MJL3IUOZBKJ5S7OHZEZP4SWJCC","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":"1edb022821f4f9d308819e2d16707802aa85a416e945b3a7ee70d8ed83708d81","cross_cats_sorted":[],"license":"","primary_cat":"cs.CC","submitted_at":"2001-10-10T15:02:35Z","title_canon_sha256":"89896e61a4d2624a04d44e750c790326f49f70d4c9f32cec8c77b24ab52d4624"},"schema_version":"1.0","source":{"id":"cs/0110025","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0110025","created_at":"2026-05-18T01:09:08Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0110025v2","created_at":"2026-05-18T01:09:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0110025","created_at":"2026-05-18T01:09:08Z"},{"alias_kind":"pith_short_12","alias_value":"MJL3IUOZBKJ5","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"MJL3IUOZBKJ5S7OH","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"MJL3IUOZ","created_at":"2026-05-18T12:25:50Z"}],"graph_snapshots":[{"event_id":"sha256:c336f18d3ee54e0f2821591af8eeecb2842de9dd176f2c1ceb2d660798e42382","target":"graph","created_at":"2026-05-18T01:09:08Z","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":"For both the edge deletion heuristic and the maximum-degree greedy heuristic, we study the problem of recognizing those graphs for which that heuristic can approximate the size of a minimum vertex cover within a constant factor of r, where r is a fixed rational number. Our main results are that these problems are complete for the class of problems solvable via parallel access to NP. To achieve these main results, we also show that the restriction of the vertex cover problem to those graphs for which either of these heuristics can find an optimal solution remains NP-hard.","authors_text":"Edith Hemaspaandra, Holger Spakowski, J\\\"org Rothe","cross_cats":[],"headline":"","license":"","primary_cat":"cs.CC","submitted_at":"2001-10-10T15:02:35Z","title":"Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0110025","kind":"arxiv","version":2},"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:0fb020d493a9ebbe967669caa6b0c3d1d4d8975ce3611f6f7bdf232fdfb04907","target":"record","created_at":"2026-05-18T01:09:08Z","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":"1edb022821f4f9d308819e2d16707802aa85a416e945b3a7ee70d8ed83708d81","cross_cats_sorted":[],"license":"","primary_cat":"cs.CC","submitted_at":"2001-10-10T15:02:35Z","title_canon_sha256":"89896e61a4d2624a04d44e750c790326f49f70d4c9f32cec8c77b24ab52d4624"},"schema_version":"1.0","source":{"id":"cs/0110025","kind":"arxiv","version":2}},"canonical_sha256":"6257b451d90a93d97dc7c932fe4ac910861c836b115c9e1f97753d1ceacd7732","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6257b451d90a93d97dc7c932fe4ac910861c836b115c9e1f97753d1ceacd7732","first_computed_at":"2026-05-18T01:09:08.424527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:08.424527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Es0BskyFBPByeP0jFNd+Q2Dmfk9OgFelf5r/1kFy4aqWqMNFpSjAf69n4JdTXB+Gcww7DOeV+8acSh8hx8rRAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:08.424972Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0110025","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fb020d493a9ebbe967669caa6b0c3d1d4d8975ce3611f6f7bdf232fdfb04907","sha256:c336f18d3ee54e0f2821591af8eeecb2842de9dd176f2c1ceb2d660798e42382"],"state_sha256":"4a204a3e79ea69118ac93c1016e79a947d7c8697d01ea348f06d08bf8407f225"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jaf7BfJZ5UBIELRv/jHx/CRhd+cC9223M9dQA2AgQvBjDsdhKWCnVtpbRX5EpURDgDsRZlOVNJqzgN48fj9aBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:55:10.610883Z","bundle_sha256":"8521a902b8172878666c2a361f6eae156f02372a80ffc0675347fb4f0d00e13b"}}