{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:K3H7TWBY2P4YGTIQ3WRDZ4AYSA","short_pith_number":"pith:K3H7TWBY","schema_version":"1.0","canonical_sha256":"56cff9d838d3f9834d10dda23cf018902d1cf0b2c9d288fcf86efe86ee6a62a2","source":{"kind":"arxiv","id":"1811.08185","version":1},"attestation_state":"computed","paper":{"title":"Approximation Algorithm for the Partial Set Multi-Cover Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Ding-Zhu Du, Guangmo Tong, James Willson, Yingli Ran, Yishuo Shi, Zhao Zhang","submitted_at":"2018-11-20T11:25:54Z","abstract_excerpt":"Partial set cover problem and set multi-cover problem are two generalizations of set cover problem. In this paper, we consider the partial set multi-cover problem which is a combination of them: given an element set $E$, a collection of sets $\\mathcal S\\subseteq 2^E$, a total covering ratio $q$ which is a constant between 0 and 1, each set $S\\in\\mathcal S$ is associated with a cost $c_S$, each element $e\\in E$ is associated with a covering requirement $r_e$, the goal is to find a minimum cost sub-collection $\\mathcal S'\\subseteq\\mathcal S$ to fully cover at least $q|E|$ elements, where element"},"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":"1811.08185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-11-20T11:25:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"abd1faa9f0f945d841467cdcc1ae5dcf314214d218c0b9dde219ab3d125b1ffd","abstract_canon_sha256":"f2491338c9a1590c6a43ccf9cc34b1763c516de51b816e985b3b59cdb24f021b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:30.894771Z","signature_b64":"tgsyaEMu0HHYCDLs3uKWhNiNQulsPU+Wsvq3nWliYm5a7lfXvGiex1qkn+iF3bFku3Fq7qvJEM02lEa5boWJAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56cff9d838d3f9834d10dda23cf018902d1cf0b2c9d288fcf86efe86ee6a62a2","last_reissued_at":"2026-05-17T23:41:30.894044Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:30.894044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithm for the Partial Set Multi-Cover Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Ding-Zhu Du, Guangmo Tong, James Willson, Yingli Ran, Yishuo Shi, Zhao Zhang","submitted_at":"2018-11-20T11:25:54Z","abstract_excerpt":"Partial set cover problem and set multi-cover problem are two generalizations of set cover problem. In this paper, we consider the partial set multi-cover problem which is a combination of them: given an element set $E$, a collection of sets $\\mathcal S\\subseteq 2^E$, a total covering ratio $q$ which is a constant between 0 and 1, each set $S\\in\\mathcal S$ is associated with a cost $c_S$, each element $e\\in E$ is associated with a covering requirement $r_e$, the goal is to find a minimum cost sub-collection $\\mathcal S'\\subseteq\\mathcal S$ to fully cover at least $q|E|$ elements, where element"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08185","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":"1811.08185","created_at":"2026-05-17T23:41:30.894163+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.08185v1","created_at":"2026-05-17T23:41:30.894163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08185","created_at":"2026-05-17T23:41:30.894163+00:00"},{"alias_kind":"pith_short_12","alias_value":"K3H7TWBY2P4Y","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"K3H7TWBY2P4YGTIQ","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"K3H7TWBY","created_at":"2026-05-18T12:32:33.847187+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/K3H7TWBY2P4YGTIQ3WRDZ4AYSA","json":"https://pith.science/pith/K3H7TWBY2P4YGTIQ3WRDZ4AYSA.json","graph_json":"https://pith.science/api/pith-number/K3H7TWBY2P4YGTIQ3WRDZ4AYSA/graph.json","events_json":"https://pith.science/api/pith-number/K3H7TWBY2P4YGTIQ3WRDZ4AYSA/events.json","paper":"https://pith.science/paper/K3H7TWBY"},"agent_actions":{"view_html":"https://pith.science/pith/K3H7TWBY2P4YGTIQ3WRDZ4AYSA","download_json":"https://pith.science/pith/K3H7TWBY2P4YGTIQ3WRDZ4AYSA.json","view_paper":"https://pith.science/paper/K3H7TWBY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.08185&json=true","fetch_graph":"https://pith.science/api/pith-number/K3H7TWBY2P4YGTIQ3WRDZ4AYSA/graph.json","fetch_events":"https://pith.science/api/pith-number/K3H7TWBY2P4YGTIQ3WRDZ4AYSA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K3H7TWBY2P4YGTIQ3WRDZ4AYSA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K3H7TWBY2P4YGTIQ3WRDZ4AYSA/action/storage_attestation","attest_author":"https://pith.science/pith/K3H7TWBY2P4YGTIQ3WRDZ4AYSA/action/author_attestation","sign_citation":"https://pith.science/pith/K3H7TWBY2P4YGTIQ3WRDZ4AYSA/action/citation_signature","submit_replication":"https://pith.science/pith/K3H7TWBY2P4YGTIQ3WRDZ4AYSA/action/replication_record"}},"created_at":"2026-05-17T23:41:30.894163+00:00","updated_at":"2026-05-17T23:41:30.894163+00:00"}