{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7BH7OWWFHT6NR5QV7OWBPM4SEL","short_pith_number":"pith:7BH7OWWF","schema_version":"1.0","canonical_sha256":"f84ff75ac53cfcd8f615fbac17b39222cfc65daee40c62fa1461353c50506046","source":{"kind":"arxiv","id":"1204.0982","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.0982","created_at":"2026-05-18T03:58:36.504001+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.0982v2","created_at":"2026-05-18T03:58:36.504001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0982","created_at":"2026-05-18T03:58:36.504001+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BH7OWWFHT6N","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BH7OWWFHT6NR5QV","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BH7OWWF","created_at":"2026-05-18T12:26:56.085431+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/7BH7OWWFHT6NR5QV7OWBPM4SEL","json":"https://pith.science/pith/7BH7OWWFHT6NR5QV7OWBPM4SEL.json","graph_json":"https://pith.science/api/pith-number/7BH7OWWFHT6NR5QV7OWBPM4SEL/graph.json","events_json":"https://pith.science/api/pith-number/7BH7OWWFHT6NR5QV7OWBPM4SEL/events.json","paper":"https://pith.science/paper/7BH7OWWF"},"agent_actions":{"view_html":"https://pith.science/pith/7BH7OWWFHT6NR5QV7OWBPM4SEL","download_json":"https://pith.science/pith/7BH7OWWFHT6NR5QV7OWBPM4SEL.json","view_paper":"https://pith.science/paper/7BH7OWWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.0982&json=true","fetch_graph":"https://pith.science/api/pith-number/7BH7OWWFHT6NR5QV7OWBPM4SEL/graph.json","fetch_events":"https://pith.science/api/pith-number/7BH7OWWFHT6NR5QV7OWBPM4SEL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BH7OWWFHT6NR5QV7OWBPM4SEL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BH7OWWFHT6NR5QV7OWBPM4SEL/action/storage_attestation","attest_author":"https://pith.science/pith/7BH7OWWFHT6NR5QV7OWBPM4SEL/action/author_attestation","sign_citation":"https://pith.science/pith/7BH7OWWFHT6NR5QV7OWBPM4SEL/action/citation_signature","submit_replication":"https://pith.science/pith/7BH7OWWFHT6NR5QV7OWBPM4SEL/action/replication_record"}},"created_at":"2026-05-18T03:58:36.504001+00:00","updated_at":"2026-05-18T03:58:36.504001+00:00"}