{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7BH7OWWFHT6NR5QV7OWBPM4SEL","short_pith_number":"pith:7BH7OWWF","canonical_record":{"source":{"id":"1204.0982","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-04T16:16:37Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"05852745669196c49cb16d5df990170cd5113329d945701680f12aaaf99feefb","abstract_canon_sha256":"1bbcee982f33bc5035bb2991b4319ad3517ed00022b26619531fa642f7f1febe"},"schema_version":"1.0"},"canonical_sha256":"f84ff75ac53cfcd8f615fbac17b39222cfc65daee40c62fa1461353c50506046","source":{"kind":"arxiv","id":"1204.0982","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0982","created_at":"2026-05-18T03:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0982v2","created_at":"2026-05-18T03:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0982","created_at":"2026-05-18T03:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"7BH7OWWFHT6N","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7BH7OWWFHT6NR5QV","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7BH7OWWF","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7BH7OWWFHT6NR5QV7OWBPM4SEL","target":"record","payload":{"canonical_record":{"source":{"id":"1204.0982","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-04T16:16:37Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"05852745669196c49cb16d5df990170cd5113329d945701680f12aaaf99feefb","abstract_canon_sha256":"1bbcee982f33bc5035bb2991b4319ad3517ed00022b26619531fa642f7f1febe"},"schema_version":"1.0"},"canonical_sha256":"f84ff75ac53cfcd8f615fbac17b39222cfc65daee40c62fa1461353c50506046","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:36.504445Z","signature_b64":"Xg2oHkfpjb4zrOyrt2Wxz2Iq3oBmsr2ogoDXtPgnhWhNPIrbwS4bKN4GhvhSUnySiAJ3iD8jJtB0Q2T+WpvRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f84ff75ac53cfcd8f615fbac17b39222cfc65daee40c62fa1461353c50506046","last_reissued_at":"2026-05-18T03:58:36.503895Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:36.503895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.0982","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-18T03:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6LTgy/t/H06xqsQ8TR+4gJ5DyORYxwzExt00z9hfSVdjYUoktXiw/2BKkflf5bz4Z5uq9n1r41fEhcQK+3bpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:27:49.495257Z"},"content_sha256":"bdb9a04c4fabffc5e1bb52eed900932bb6d3c1954b2a425fe8b8ef2251ae2d20","schema_version":"1.0","event_id":"sha256:bdb9a04c4fabffc5e1bb52eed900932bb6d3c1954b2a425fe8b8ef2251ae2d20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7BH7OWWFHT6NR5QV7OWBPM4SEL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximability of the Vertex Cover Problem in Power Law Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Mathias Hauptmann, Mikael Gast","submitted_at":"2012-04-04T16:16:37Z","abstract_excerpt":"In this paper we construct an approximation algorithm for the Minimum Vertex Cover Problem (Min-VC) with an expected approximation ratio of 2-f(beta) for random Power Law Graphs (PLG) in the (alpha,beta)-model of Aiello et. al., where f(beta) is a strictly positive function of the parameter beta. We obtain this result by combining the Nemhauser and Trotter approach for Min-VC with a new deterministic rounding procedure which achieves an approximation ratio of 3/2 on a subset of low degree vertices for which the expected contribution to the cost of the associated linear program is sufficiently "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0982","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-18T03:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5jBMh6ILuf/nNaTWbMMAcQnaje7pWafvP7LIJdrUYA/hCcJURo8vfdWEJj6NUsKaqPhIhMCbImKY9sOk0e9qBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:27:49.495723Z"},"content_sha256":"30e690c791dae942fbb3a3d20f748863e95d13657eead2c4d8064a79a2ec595f","schema_version":"1.0","event_id":"sha256:30e690c791dae942fbb3a3d20f748863e95d13657eead2c4d8064a79a2ec595f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7BH7OWWFHT6NR5QV7OWBPM4SEL/bundle.json","state_url":"https://pith.science/pith/7BH7OWWFHT6NR5QV7OWBPM4SEL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7BH7OWWFHT6NR5QV7OWBPM4SEL/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-05-30T02:27:49Z","links":{"resolver":"https://pith.science/pith/7BH7OWWFHT6NR5QV7OWBPM4SEL","bundle":"https://pith.science/pith/7BH7OWWFHT6NR5QV7OWBPM4SEL/bundle.json","state":"https://pith.science/pith/7BH7OWWFHT6NR5QV7OWBPM4SEL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7BH7OWWFHT6NR5QV7OWBPM4SEL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7BH7OWWFHT6NR5QV7OWBPM4SEL","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":"1bbcee982f33bc5035bb2991b4319ad3517ed00022b26619531fa642f7f1febe","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-04T16:16:37Z","title_canon_sha256":"05852745669196c49cb16d5df990170cd5113329d945701680f12aaaf99feefb"},"schema_version":"1.0","source":{"id":"1204.0982","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0982","created_at":"2026-05-18T03:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0982v2","created_at":"2026-05-18T03:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0982","created_at":"2026-05-18T03:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"7BH7OWWFHT6N","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7BH7OWWFHT6NR5QV","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7BH7OWWF","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:30e690c791dae942fbb3a3d20f748863e95d13657eead2c4d8064a79a2ec595f","target":"graph","created_at":"2026-05-18T03:58:36Z","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 this paper we construct an approximation algorithm for the Minimum Vertex Cover Problem (Min-VC) with an expected approximation ratio of 2-f(beta) for random Power Law Graphs (PLG) in the (alpha,beta)-model of Aiello et. al., where f(beta) is a strictly positive function of the parameter beta. We obtain this result by combining the Nemhauser and Trotter approach for Min-VC with a new deterministic rounding procedure which achieves an approximation ratio of 3/2 on a subset of low degree vertices for which the expected contribution to the cost of the associated linear program is sufficiently ","authors_text":"Mathias Hauptmann, Mikael Gast","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-04T16:16:37Z","title":"Approximability of the Vertex Cover Problem in Power Law Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0982","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:bdb9a04c4fabffc5e1bb52eed900932bb6d3c1954b2a425fe8b8ef2251ae2d20","target":"record","created_at":"2026-05-18T03:58:36Z","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":"1bbcee982f33bc5035bb2991b4319ad3517ed00022b26619531fa642f7f1febe","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-04T16:16:37Z","title_canon_sha256":"05852745669196c49cb16d5df990170cd5113329d945701680f12aaaf99feefb"},"schema_version":"1.0","source":{"id":"1204.0982","kind":"arxiv","version":2}},"canonical_sha256":"f84ff75ac53cfcd8f615fbac17b39222cfc65daee40c62fa1461353c50506046","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f84ff75ac53cfcd8f615fbac17b39222cfc65daee40c62fa1461353c50506046","first_computed_at":"2026-05-18T03:58:36.503895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:36.503895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xg2oHkfpjb4zrOyrt2Wxz2Iq3oBmsr2ogoDXtPgnhWhNPIrbwS4bKN4GhvhSUnySiAJ3iD8jJtB0Q2T+WpvRCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:36.504445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.0982","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bdb9a04c4fabffc5e1bb52eed900932bb6d3c1954b2a425fe8b8ef2251ae2d20","sha256:30e690c791dae942fbb3a3d20f748863e95d13657eead2c4d8064a79a2ec595f"],"state_sha256":"2ccb13b77d9c906b5c9e18d079aedccce40395bda5becdec62673ab95bdff4ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T14FEI73Meen6/pxU0H0XzU2SQcDX1p4JQkcfG7sm5eC3Y6cLddodxyNFv9DPHFNoRjB7/mcKVcE8PeDir0iBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:27:49.499169Z","bundle_sha256":"76c7813843dd5a75867008b95cbd39e13170a4483b2e908387e3aa6fa9251653"}}