{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:DCPYQ2CTCRLUJNE74OYXCLP32J","short_pith_number":"pith:DCPYQ2CT","canonical_record":{"source":{"id":"1012.2573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-12T18:47:05Z","cross_cats_sorted":[],"title_canon_sha256":"24d1b203b850089d2bbf681a5b4746bd623c2747b2ac17055395bb08b4ffd945","abstract_canon_sha256":"0cf98a3cc19b758667e06f6f89d27785adf33892266a2126d5a10df4e038304d"},"schema_version":"1.0"},"canonical_sha256":"189f886853145744b49fe3b1712dfbd27c0e2e740fea2c2d9a1a7ff4ea0f588c","source":{"kind":"arxiv","id":"1012.2573","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2573","created_at":"2026-05-18T04:33:28Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2573v1","created_at":"2026-05-18T04:33:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2573","created_at":"2026-05-18T04:33:28Z"},{"alias_kind":"pith_short_12","alias_value":"DCPYQ2CTCRLU","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DCPYQ2CTCRLUJNE7","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DCPYQ2CT","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:DCPYQ2CTCRLUJNE74OYXCLP32J","target":"record","payload":{"canonical_record":{"source":{"id":"1012.2573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-12T18:47:05Z","cross_cats_sorted":[],"title_canon_sha256":"24d1b203b850089d2bbf681a5b4746bd623c2747b2ac17055395bb08b4ffd945","abstract_canon_sha256":"0cf98a3cc19b758667e06f6f89d27785adf33892266a2126d5a10df4e038304d"},"schema_version":"1.0"},"canonical_sha256":"189f886853145744b49fe3b1712dfbd27c0e2e740fea2c2d9a1a7ff4ea0f588c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:28.302365Z","signature_b64":"2zj1Vyk27Zi2cv3mSpjNmJnWv9jP18ciMGpkDNTkwihNoDzMeG0ZvszingquwPzcpFo5QiGqPodMk+ssFqyKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"189f886853145744b49fe3b1712dfbd27c0e2e740fea2c2d9a1a7ff4ea0f588c","last_reissued_at":"2026-05-18T04:33:28.301862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:28.301862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.2573","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-18T04:33:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HjzneyfSryXqetd575jlyYeXsRQcAWDXzNH64sQpLrR0mI9LO2zlAwJ/2HcCvIZCkQSbgtpdTEvM7pGY+fmKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:15:29.510057Z"},"content_sha256":"764f23f785a325987490d9d51a7048186030ae560a34a70e7387f0b49c7ba1ac","schema_version":"1.0","event_id":"sha256:764f23f785a325987490d9d51a7048186030ae560a34a70e7387f0b49c7ba1ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:DCPYQ2CTCRLUJNE74OYXCLP32J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Vertex Cover in Dense Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Claus Viehmann, Jean Cardinal, Marek Karpinski, Richard Schmied","submitted_at":"2010-12-12T18:47:05Z","abstract_excerpt":"We consider the minimum vertex cover problem in hypergraphs in which every hyperedge has size k (also known as minimum hitting set problem, or minimum set cover with element frequency k). Simple algorithms exist that provide k-approximations, and this is believed to be the best possible approximation achievable in polynomial time. We show how to exploit density and regularity properties of the input hypergraph to break this barrier. In particular, we provide a randomized polynomial-time algorithm with approximation factor k/(1 +(k-1)d/(k Delta)), where d and Delta are the average and maximum d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2573","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-18T04:33:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qyhVVOrv2Qfb1X2jrH2CkTBD0qRR8SvR0TBjfn/fSZB11TNLoSigwTqFW+Lq4iUcAkyL22WTtqZyV1LfSbYpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:15:29.510569Z"},"content_sha256":"65c8e0945add4b436e5ce0bf3e52744dfc40b78bd51a53b4e942be86d9783375","schema_version":"1.0","event_id":"sha256:65c8e0945add4b436e5ce0bf3e52744dfc40b78bd51a53b4e942be86d9783375"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCPYQ2CTCRLUJNE74OYXCLP32J/bundle.json","state_url":"https://pith.science/pith/DCPYQ2CTCRLUJNE74OYXCLP32J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCPYQ2CTCRLUJNE74OYXCLP32J/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-28T13:15:29Z","links":{"resolver":"https://pith.science/pith/DCPYQ2CTCRLUJNE74OYXCLP32J","bundle":"https://pith.science/pith/DCPYQ2CTCRLUJNE74OYXCLP32J/bundle.json","state":"https://pith.science/pith/DCPYQ2CTCRLUJNE74OYXCLP32J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCPYQ2CTCRLUJNE74OYXCLP32J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:DCPYQ2CTCRLUJNE74OYXCLP32J","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":"0cf98a3cc19b758667e06f6f89d27785adf33892266a2126d5a10df4e038304d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-12T18:47:05Z","title_canon_sha256":"24d1b203b850089d2bbf681a5b4746bd623c2747b2ac17055395bb08b4ffd945"},"schema_version":"1.0","source":{"id":"1012.2573","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2573","created_at":"2026-05-18T04:33:28Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2573v1","created_at":"2026-05-18T04:33:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2573","created_at":"2026-05-18T04:33:28Z"},{"alias_kind":"pith_short_12","alias_value":"DCPYQ2CTCRLU","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DCPYQ2CTCRLUJNE7","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DCPYQ2CT","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:65c8e0945add4b436e5ce0bf3e52744dfc40b78bd51a53b4e942be86d9783375","target":"graph","created_at":"2026-05-18T04:33:28Z","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":"We consider the minimum vertex cover problem in hypergraphs in which every hyperedge has size k (also known as minimum hitting set problem, or minimum set cover with element frequency k). Simple algorithms exist that provide k-approximations, and this is believed to be the best possible approximation achievable in polynomial time. We show how to exploit density and regularity properties of the input hypergraph to break this barrier. In particular, we provide a randomized polynomial-time algorithm with approximation factor k/(1 +(k-1)d/(k Delta)), where d and Delta are the average and maximum d","authors_text":"Claus Viehmann, Jean Cardinal, Marek Karpinski, Richard Schmied","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-12T18:47:05Z","title":"Approximating Vertex Cover in Dense Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2573","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:764f23f785a325987490d9d51a7048186030ae560a34a70e7387f0b49c7ba1ac","target":"record","created_at":"2026-05-18T04:33:28Z","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":"0cf98a3cc19b758667e06f6f89d27785adf33892266a2126d5a10df4e038304d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-12T18:47:05Z","title_canon_sha256":"24d1b203b850089d2bbf681a5b4746bd623c2747b2ac17055395bb08b4ffd945"},"schema_version":"1.0","source":{"id":"1012.2573","kind":"arxiv","version":1}},"canonical_sha256":"189f886853145744b49fe3b1712dfbd27c0e2e740fea2c2d9a1a7ff4ea0f588c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"189f886853145744b49fe3b1712dfbd27c0e2e740fea2c2d9a1a7ff4ea0f588c","first_computed_at":"2026-05-18T04:33:28.301862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:28.301862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2zj1Vyk27Zi2cv3mSpjNmJnWv9jP18ciMGpkDNTkwihNoDzMeG0ZvszingquwPzcpFo5QiGqPodMk+ssFqyKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:28.302365Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.2573","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:764f23f785a325987490d9d51a7048186030ae560a34a70e7387f0b49c7ba1ac","sha256:65c8e0945add4b436e5ce0bf3e52744dfc40b78bd51a53b4e942be86d9783375"],"state_sha256":"79a3024f80c6352fbfcf5f51133ac30a196ec07a787b6d91fd4d29e849f8fb19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IsBvjXjFvLbSeT+CFcdyDhaYfNDBx0WtIIFTBa7/q5wyK4HFfyOhGyu867NZbgDUy1tMSwCXo2bM5C/3lAFXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:15:29.513186Z","bundle_sha256":"6300fa909cbb224595fe7e439da6702a0ed508982557112ebbaa059af1f520d3"}}