{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XQQNJYGUVNG2CIMAUNN4PPN6PM","short_pith_number":"pith:XQQNJYGU","schema_version":"1.0","canonical_sha256":"bc20d4e0d4ab4da12180a35bc7bdbe7b06251a41b8ab74dd0957b8930b1dbe76","source":{"kind":"arxiv","id":"1609.02640","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.02640","created_at":"2026-05-18T01:04:52.911145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.02640v1","created_at":"2026-05-18T01:04:52.911145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02640","created_at":"2026-05-18T01:04:52.911145+00:00"},{"alias_kind":"pith_short_12","alias_value":"XQQNJYGUVNG2","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XQQNJYGUVNG2CIMA","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XQQNJYGU","created_at":"2026-05-18T12:30:51.357362+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/XQQNJYGUVNG2CIMAUNN4PPN6PM","json":"https://pith.science/pith/XQQNJYGUVNG2CIMAUNN4PPN6PM.json","graph_json":"https://pith.science/api/pith-number/XQQNJYGUVNG2CIMAUNN4PPN6PM/graph.json","events_json":"https://pith.science/api/pith-number/XQQNJYGUVNG2CIMAUNN4PPN6PM/events.json","paper":"https://pith.science/paper/XQQNJYGU"},"agent_actions":{"view_html":"https://pith.science/pith/XQQNJYGUVNG2CIMAUNN4PPN6PM","download_json":"https://pith.science/pith/XQQNJYGUVNG2CIMAUNN4PPN6PM.json","view_paper":"https://pith.science/paper/XQQNJYGU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.02640&json=true","fetch_graph":"https://pith.science/api/pith-number/XQQNJYGUVNG2CIMAUNN4PPN6PM/graph.json","fetch_events":"https://pith.science/api/pith-number/XQQNJYGUVNG2CIMAUNN4PPN6PM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XQQNJYGUVNG2CIMAUNN4PPN6PM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XQQNJYGUVNG2CIMAUNN4PPN6PM/action/storage_attestation","attest_author":"https://pith.science/pith/XQQNJYGUVNG2CIMAUNN4PPN6PM/action/author_attestation","sign_citation":"https://pith.science/pith/XQQNJYGUVNG2CIMAUNN4PPN6PM/action/citation_signature","submit_replication":"https://pith.science/pith/XQQNJYGUVNG2CIMAUNN4PPN6PM/action/replication_record"}},"created_at":"2026-05-18T01:04:52.911145+00:00","updated_at":"2026-05-18T01:04:52.911145+00:00"}