{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XQQNJYGUVNG2CIMAUNN4PPN6PM","short_pith_number":"pith:XQQNJYGU","canonical_record":{"source":{"id":"1609.02640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-09T02:20:45Z","cross_cats_sorted":[],"title_canon_sha256":"e3577fe612f1714019154197501c71ae125de8f6c390c9fe23b53e18fc108226","abstract_canon_sha256":"c9193378356f2b961d0813d91969a06159eaf03d53ce086b2941b9272141e6f6"},"schema_version":"1.0"},"canonical_sha256":"bc20d4e0d4ab4da12180a35bc7bdbe7b06251a41b8ab74dd0957b8930b1dbe76","source":{"kind":"arxiv","id":"1609.02640","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.02640","created_at":"2026-05-18T01:04:52Z"},{"alias_kind":"arxiv_version","alias_value":"1609.02640v1","created_at":"2026-05-18T01:04:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02640","created_at":"2026-05-18T01:04:52Z"},{"alias_kind":"pith_short_12","alias_value":"XQQNJYGUVNG2","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XQQNJYGUVNG2CIMA","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XQQNJYGU","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XQQNJYGUVNG2CIMAUNN4PPN6PM","target":"record","payload":{"canonical_record":{"source":{"id":"1609.02640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-09T02:20:45Z","cross_cats_sorted":[],"title_canon_sha256":"e3577fe612f1714019154197501c71ae125de8f6c390c9fe23b53e18fc108226","abstract_canon_sha256":"c9193378356f2b961d0813d91969a06159eaf03d53ce086b2941b9272141e6f6"},"schema_version":"1.0"},"canonical_sha256":"bc20d4e0d4ab4da12180a35bc7bdbe7b06251a41b8ab74dd0957b8930b1dbe76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:52.911562Z","signature_b64":"Pj8oJWMemuXsuN31y4PfFAyN6dT4JSkQWE2/gx/zsOVFjW7X9bdAPnwzqGhwMkGtUihMzavTUVqt1OBxq/eJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc20d4e0d4ab4da12180a35bc7bdbe7b06251a41b8ab74dd0957b8930b1dbe76","last_reissued_at":"2026-05-18T01:04:52.911080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:52.911080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.02640","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:04:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sNQI2j0A42oBGhvgxeIYSsjhtaR7S7U4q5zdTWiAim1ifMUVrRwdm+LN74meQLksgYGUYgEzdV998paEjH5dBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T13:55:27.040339Z"},"content_sha256":"05b2237b5cfd3ff99d3c9843969081f43ca5863b1af1c88b4cf85c7561a49b6a","schema_version":"1.0","event_id":"sha256:05b2237b5cfd3ff99d3c9843969081f43ca5863b1af1c88b4cf85c7561a49b6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XQQNJYGUVNG2CIMAUNN4PPN6PM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"O(f) Bi-Approximation for Capacitated Covering with Hard Capacities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"D.T. Lee, Hai-Lun Tu, Mong-Jen Kao","submitted_at":"2016-09-09T02:20:45Z","abstract_excerpt":"We consider capacitated vertex cover with hard capacity constraints (VC-HC) on hypergraphs. In this problem we are given a hypergraph $G=(V,E)$ with a maximum edge size $f$. Each edge is associated with a demand and each vertex is associated with a weight (cost), a capacity, and an available multiplicity. The objective is to find a minimum-weight vertex multiset such that the demands of the edges can be covered by the capacities of the vertices and the multiplicity of each vertex does not exceed its available multiplicity.\n  In this paper we present an $O(f)$ bi-approximation for VC-HC that gi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02640","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:04:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tEqpGPc2dNYD+IoYK4J/AOxP7BPdyVteFcogLedkwrrl3dPMfPutxXOyZuPcwRTKQTxOeJkWXUySFX3x9k1qCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T13:55:27.040685Z"},"content_sha256":"5f9e2d8a222ea67212030ce4f21223cb6fbf7ee070918c9387394362800fc7a8","schema_version":"1.0","event_id":"sha256:5f9e2d8a222ea67212030ce4f21223cb6fbf7ee070918c9387394362800fc7a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XQQNJYGUVNG2CIMAUNN4PPN6PM/bundle.json","state_url":"https://pith.science/pith/XQQNJYGUVNG2CIMAUNN4PPN6PM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XQQNJYGUVNG2CIMAUNN4PPN6PM/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-07-03T13:55:27Z","links":{"resolver":"https://pith.science/pith/XQQNJYGUVNG2CIMAUNN4PPN6PM","bundle":"https://pith.science/pith/XQQNJYGUVNG2CIMAUNN4PPN6PM/bundle.json","state":"https://pith.science/pith/XQQNJYGUVNG2CIMAUNN4PPN6PM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XQQNJYGUVNG2CIMAUNN4PPN6PM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XQQNJYGUVNG2CIMAUNN4PPN6PM","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":"c9193378356f2b961d0813d91969a06159eaf03d53ce086b2941b9272141e6f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-09T02:20:45Z","title_canon_sha256":"e3577fe612f1714019154197501c71ae125de8f6c390c9fe23b53e18fc108226"},"schema_version":"1.0","source":{"id":"1609.02640","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.02640","created_at":"2026-05-18T01:04:52Z"},{"alias_kind":"arxiv_version","alias_value":"1609.02640v1","created_at":"2026-05-18T01:04:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02640","created_at":"2026-05-18T01:04:52Z"},{"alias_kind":"pith_short_12","alias_value":"XQQNJYGUVNG2","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XQQNJYGUVNG2CIMA","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XQQNJYGU","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:5f9e2d8a222ea67212030ce4f21223cb6fbf7ee070918c9387394362800fc7a8","target":"graph","created_at":"2026-05-18T01:04:52Z","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 capacitated vertex cover with hard capacity constraints (VC-HC) on hypergraphs. In this problem we are given a hypergraph $G=(V,E)$ with a maximum edge size $f$. Each edge is associated with a demand and each vertex is associated with a weight (cost), a capacity, and an available multiplicity. The objective is to find a minimum-weight vertex multiset such that the demands of the edges can be covered by the capacities of the vertices and the multiplicity of each vertex does not exceed its available multiplicity.\n  In this paper we present an $O(f)$ bi-approximation for VC-HC that gi","authors_text":"D.T. Lee, Hai-Lun Tu, Mong-Jen Kao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-09T02:20:45Z","title":"O(f) Bi-Approximation for Capacitated Covering with Hard Capacities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02640","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:05b2237b5cfd3ff99d3c9843969081f43ca5863b1af1c88b4cf85c7561a49b6a","target":"record","created_at":"2026-05-18T01:04:52Z","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":"c9193378356f2b961d0813d91969a06159eaf03d53ce086b2941b9272141e6f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-09T02:20:45Z","title_canon_sha256":"e3577fe612f1714019154197501c71ae125de8f6c390c9fe23b53e18fc108226"},"schema_version":"1.0","source":{"id":"1609.02640","kind":"arxiv","version":1}},"canonical_sha256":"bc20d4e0d4ab4da12180a35bc7bdbe7b06251a41b8ab74dd0957b8930b1dbe76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc20d4e0d4ab4da12180a35bc7bdbe7b06251a41b8ab74dd0957b8930b1dbe76","first_computed_at":"2026-05-18T01:04:52.911080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:52.911080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pj8oJWMemuXsuN31y4PfFAyN6dT4JSkQWE2/gx/zsOVFjW7X9bdAPnwzqGhwMkGtUihMzavTUVqt1OBxq/eJBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:52.911562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.02640","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05b2237b5cfd3ff99d3c9843969081f43ca5863b1af1c88b4cf85c7561a49b6a","sha256:5f9e2d8a222ea67212030ce4f21223cb6fbf7ee070918c9387394362800fc7a8"],"state_sha256":"fb48e916b1b5757e2f8c7aeb99a7f81dc0777a3ea315dc2f977fc9050c5986a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YRyi01XTT27P+AJ8UZf63sjGqlOV3j+vzUNCzKST9b9V74gZIKHvUstiEmNSNBGv9iUg4qxkz5ju7OKkp3jECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T13:55:27.042541Z","bundle_sha256":"2f06aeec71bdca3fa90b4b09f14bb05b8f9549d33ebb954a4378c5172a3fd66c"}}