{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CF5HIRDUQKPCIAZV5CKJIHI5H3","short_pith_number":"pith:CF5HIRDU","canonical_record":{"source":{"id":"1905.00640","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-02T09:44:28Z","cross_cats_sorted":[],"title_canon_sha256":"9d337dee2ddaeb00cec10c6fe45cd9b1f295e89e693e93bc5b57dc23e7185279","abstract_canon_sha256":"5ccd7946664e981ba854983c5e69871b085b39cad816a017effe5e2ed52c5b3e"},"schema_version":"1.0"},"canonical_sha256":"117a744474829e240335e894941d1d3ef106173db67f8cb4fc3e199f299f36a3","source":{"kind":"arxiv","id":"1905.00640","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CF5HIRDUQKPCIAZV5CKJIHI5H3","target":"record","payload":{"canonical_record":{"source":{"id":"1905.00640","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-02T09:44:28Z","cross_cats_sorted":[],"title_canon_sha256":"9d337dee2ddaeb00cec10c6fe45cd9b1f295e89e693e93bc5b57dc23e7185279","abstract_canon_sha256":"5ccd7946664e981ba854983c5e69871b085b39cad816a017effe5e2ed52c5b3e"},"schema_version":"1.0"},"canonical_sha256":"117a744474829e240335e894941d1d3ef106173db67f8cb4fc3e199f299f36a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:25:07.188573Z","signature_b64":"mYoEa9rHk9S7TlpiPZdEkB/8rfCwhGSM6saMVJsXJjAMUaobvxseXpebVG2KATdsatV6OXztHlBGfRzF8GzgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"117a744474829e240335e894941d1d3ef106173db67f8cb4fc3e199f299f36a3","last_reissued_at":"2026-07-05T04:25:07.188066Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:25:07.188066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.00640","source_version":2,"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-07-05T04:25:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WVu4xIPnKboP2GG80Fh0Wu0W4iT4tnfz2oPXMZ9xtvV/8Jjbt6qjpm4nW/hPzOlFohXxd+A1iZftM9vWOMkGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:36:47.951677Z"},"content_sha256":"e00b1e7d35d120af32015401a74b7916ec76657fd3748978fbce043b7a1a1e5b","schema_version":"1.0","event_id":"sha256:e00b1e7d35d120af32015401a74b7916ec76657fd3748978fbce043b7a1a1e5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CF5HIRDUQKPCIAZV5CKJIHI5H3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Approximation Bounds for Maximum Multi-Coverage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Emirhan G\\\"urp{\\i}nar, Omar Fawzi, Siddharth Barman, Suprovat Ghoshal","submitted_at":"2019-05-02T09:44:28Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00640","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.00640/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:25:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EwFNKslAe7tiSEc0mVoXowbbVJCaFTmy3YfHqa+yWLoV3avB6i0o7ulI9KyJEQ3rvNZ55/OMQuWjju6AIRLuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:36:47.953741Z"},"content_sha256":"48cb5585dd0e2e4d932d9e590c10f997194c3e993010df36342d7aff1d5ced79","schema_version":"1.0","event_id":"sha256:48cb5585dd0e2e4d932d9e590c10f997194c3e993010df36342d7aff1d5ced79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CF5HIRDUQKPCIAZV5CKJIHI5H3/bundle.json","state_url":"https://pith.science/pith/CF5HIRDUQKPCIAZV5CKJIHI5H3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CF5HIRDUQKPCIAZV5CKJIHI5H3/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-08-06T09:36:47Z","links":{"resolver":"https://pith.science/pith/CF5HIRDUQKPCIAZV5CKJIHI5H3","bundle":"https://pith.science/pith/CF5HIRDUQKPCIAZV5CKJIHI5H3/bundle.json","state":"https://pith.science/pith/CF5HIRDUQKPCIAZV5CKJIHI5H3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CF5HIRDUQKPCIAZV5CKJIHI5H3/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m/SV1k7oSYuey1SECgoYlQ5o2/G9TyZxbnEZW+AEWXBL22b6CAE0uBKkX/njnaAubH3WMSu9+OKxBXrTma8ZDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T09:36:47.967429Z","bundle_sha256":"d6d03452b7f8b5c011245f507c9e126146056d2ecfddcbe2553219c45de9e0aa"}}