{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CF5HIRDUQKPCIAZV5CKJIHI5H3","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":"5ccd7946664e981ba854983c5e69871b085b39cad816a017effe5e2ed52c5b3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-02T09:44:28Z","title_canon_sha256":"9d337dee2ddaeb00cec10c6fe45cd9b1f295e89e693e93bc5b57dc23e7185279"},"schema_version":"1.0","source":{"id":"1905.00640","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00640","created_at":"2026-07-05T04:25:07Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00640v2","created_at":"2026-07-05T04:25:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00640","created_at":"2026-07-05T04:25:07Z"},{"alias_kind":"pith_short_12","alias_value":"CF5HIRDUQKPC","created_at":"2026-07-05T04:25:07Z"},{"alias_kind":"pith_short_16","alias_value":"CF5HIRDUQKPCIAZV","created_at":"2026-07-05T04:25:07Z"},{"alias_kind":"pith_short_8","alias_value":"CF5HIRDU","created_at":"2026-07-05T04:25:07Z"}],"graph_snapshots":[{"event_id":"sha256:48cb5585dd0e2e4d932d9e590c10f997194c3e993010df36342d7aff1d5ced79","target":"graph","created_at":"2026-07-05T04:25:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1905.00640/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the classic maximum coverage problem, we are given subsets $T_1, \\dots, T_m$ of a universe $[n]$ along with an integer $k$ and the objective is to find a subset $S \\subseteq [m]$ of size $k$ that maximizes $C(S) := |\\cup_{i \\in S} T_i|$. It is well-known that the greedy algorithm for this problem achieves an approximation ratio of $(1-e^{-1})$ and there is a matching inapproximability result. We note that in the maximum coverage problem if an element $e \\in [n]$ is covered by several sets, it is still counted only once. By contrast, if we change the problem and count each element $e$ as man","authors_text":"Emirhan G\\\"urp{\\i}nar, Omar Fawzi, Siddharth Barman, Suprovat Ghoshal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-02T09:44:28Z","title":"Tight Approximation Bounds for Maximum Multi-Coverage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00640","kind":"arxiv","version":2},"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:e00b1e7d35d120af32015401a74b7916ec76657fd3748978fbce043b7a1a1e5b","target":"record","created_at":"2026-07-05T04:25:07Z","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":"5ccd7946664e981ba854983c5e69871b085b39cad816a017effe5e2ed52c5b3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-02T09:44:28Z","title_canon_sha256":"9d337dee2ddaeb00cec10c6fe45cd9b1f295e89e693e93bc5b57dc23e7185279"},"schema_version":"1.0","source":{"id":"1905.00640","kind":"arxiv","version":2}},"canonical_sha256":"117a744474829e240335e894941d1d3ef106173db67f8cb4fc3e199f299f36a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"117a744474829e240335e894941d1d3ef106173db67f8cb4fc3e199f299f36a3","first_computed_at":"2026-07-05T04:25:07.188066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:25:07.188066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mYoEa9rHk9S7TlpiPZdEkB/8rfCwhGSM6saMVJsXJjAMUaobvxseXpebVG2KATdsatV6OXztHlBGfRzF8GzgDA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:25:07.188573Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.00640","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e00b1e7d35d120af32015401a74b7916ec76657fd3748978fbce043b7a1a1e5b","sha256:48cb5585dd0e2e4d932d9e590c10f997194c3e993010df36342d7aff1d5ced79"],"state_sha256":"5d49a159c9b912f46b4594b071951433bca2dbf02fd263e231dbfc7101d9e90c"}