{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:T6OYELRTBS4DBFE5SF47LR3UTZ","short_pith_number":"pith:T6OYELRT","canonical_record":{"source":{"id":"2010.00970","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-02T13:03:04Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"536c0ff1c9c369a76d0d32f703bb9f0b84937d3dbc9892f2ac501d9a130d8627","abstract_canon_sha256":"3884b558a868fcca9678cddcd990282671c4581a19034e222c6b7e4bb22385f1"},"schema_version":"1.0"},"canonical_sha256":"9f9d822e330cb830949d9179f5c7749e55472e61500efa1295e9997479a4769e","source":{"kind":"arxiv","id":"2010.00970","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.00970","created_at":"2026-07-05T02:36:45Z"},{"alias_kind":"arxiv_version","alias_value":"2010.00970v3","created_at":"2026-07-05T02:36:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.00970","created_at":"2026-07-05T02:36:45Z"},{"alias_kind":"pith_short_12","alias_value":"T6OYELRTBS4D","created_at":"2026-07-05T02:36:45Z"},{"alias_kind":"pith_short_16","alias_value":"T6OYELRTBS4DBFE5","created_at":"2026-07-05T02:36:45Z"},{"alias_kind":"pith_short_8","alias_value":"T6OYELRT","created_at":"2026-07-05T02:36:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:T6OYELRTBS4DBFE5SF47LR3UTZ","target":"record","payload":{"canonical_record":{"source":{"id":"2010.00970","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-02T13:03:04Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"536c0ff1c9c369a76d0d32f703bb9f0b84937d3dbc9892f2ac501d9a130d8627","abstract_canon_sha256":"3884b558a868fcca9678cddcd990282671c4581a19034e222c6b7e4bb22385f1"},"schema_version":"1.0"},"canonical_sha256":"9f9d822e330cb830949d9179f5c7749e55472e61500efa1295e9997479a4769e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:36:45.590777Z","signature_b64":"k3LkBTa6Bp09pCSsoSu8To0nIyRcy9oqklK/PqevZ3JjbmBLrdSqzo2JkTk+iIH5Vv3eh7u+wdAIarmSp/6PCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f9d822e330cb830949d9179f5c7749e55472e61500efa1295e9997479a4769e","last_reissued_at":"2026-07-05T02:36:45.590337Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:36:45.590337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.00970","source_version":3,"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-05T02:36:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pn6PwsIpwmLGLVkubXBBGCYcXYTch1FfsY2P6i2MI1Jfjv2Vgk7BFRl8qzAWH2X8rErF3CIiTXFI6OSgio0pDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T07:45:33.697952Z"},"content_sha256":"f078ecffa72e1d3e32286720d891ef12df9384d14b18522e1d857b93dbfba399","schema_version":"1.0","event_id":"sha256:f078ecffa72e1d3e32286720d891ef12df9384d14b18522e1d857b93dbfba399"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:T6OYELRTBS4DBFE5SF47LR3UTZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Approximation Guarantees for Concave Coverage Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Omar Fawzi, Paul Ferm\\'e, Siddharth Barman","submitted_at":"2020-10-02T13:03:04Z","abstract_excerpt":"In the maximum coverage problem, we are given subsets $T_1, \\ldots, 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) := \\Big|\\bigcup_{i \\in S} T_i\\Big|$. It is a classic result that the greedy algorithm for this problem achieves an optimal approximation ratio of $1-e^{-1}$.\n  In this work we consider a generalization of this problem wherein an element $a$ can contribute by an amount that depends on the number of times it is covered. Given a concave, nondecreasing function $\\varphi$, we define $C^{\\varphi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.00970","kind":"arxiv","version":3},"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/2010.00970/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-05T02:36:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rysf8ENe+oXxcBjzrKGuQagB0Ix04QyilUsr60qGg9rOLa7NquQoQzyRCx8yd0/XFDqBOs/ycp6PpOPitSluAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T07:45:33.698458Z"},"content_sha256":"8969f600e5c342534ae10c59fdbf27b861bd430aa8be546b4d4df7e293aac881","schema_version":"1.0","event_id":"sha256:8969f600e5c342534ae10c59fdbf27b861bd430aa8be546b4d4df7e293aac881"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T6OYELRTBS4DBFE5SF47LR3UTZ/bundle.json","state_url":"https://pith.science/pith/T6OYELRTBS4DBFE5SF47LR3UTZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T6OYELRTBS4DBFE5SF47LR3UTZ/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-06T07:45:33Z","links":{"resolver":"https://pith.science/pith/T6OYELRTBS4DBFE5SF47LR3UTZ","bundle":"https://pith.science/pith/T6OYELRTBS4DBFE5SF47LR3UTZ/bundle.json","state":"https://pith.science/pith/T6OYELRTBS4DBFE5SF47LR3UTZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T6OYELRTBS4DBFE5SF47LR3UTZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:T6OYELRTBS4DBFE5SF47LR3UTZ","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":"3884b558a868fcca9678cddcd990282671c4581a19034e222c6b7e4bb22385f1","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-02T13:03:04Z","title_canon_sha256":"536c0ff1c9c369a76d0d32f703bb9f0b84937d3dbc9892f2ac501d9a130d8627"},"schema_version":"1.0","source":{"id":"2010.00970","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.00970","created_at":"2026-07-05T02:36:45Z"},{"alias_kind":"arxiv_version","alias_value":"2010.00970v3","created_at":"2026-07-05T02:36:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.00970","created_at":"2026-07-05T02:36:45Z"},{"alias_kind":"pith_short_12","alias_value":"T6OYELRTBS4D","created_at":"2026-07-05T02:36:45Z"},{"alias_kind":"pith_short_16","alias_value":"T6OYELRTBS4DBFE5","created_at":"2026-07-05T02:36:45Z"},{"alias_kind":"pith_short_8","alias_value":"T6OYELRT","created_at":"2026-07-05T02:36:45Z"}],"graph_snapshots":[{"event_id":"sha256:8969f600e5c342534ae10c59fdbf27b861bd430aa8be546b4d4df7e293aac881","target":"graph","created_at":"2026-07-05T02:36:45Z","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/2010.00970/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the maximum coverage problem, we are given subsets $T_1, \\ldots, 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) := \\Big|\\bigcup_{i \\in S} T_i\\Big|$. It is a classic result that the greedy algorithm for this problem achieves an optimal approximation ratio of $1-e^{-1}$.\n  In this work we consider a generalization of this problem wherein an element $a$ can contribute by an amount that depends on the number of times it is covered. Given a concave, nondecreasing function $\\varphi$, we define $C^{\\varphi","authors_text":"Omar Fawzi, Paul Ferm\\'e, Siddharth Barman","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-02T13:03:04Z","title":"Tight Approximation Guarantees for Concave Coverage Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.00970","kind":"arxiv","version":3},"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:f078ecffa72e1d3e32286720d891ef12df9384d14b18522e1d857b93dbfba399","target":"record","created_at":"2026-07-05T02:36:45Z","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":"3884b558a868fcca9678cddcd990282671c4581a19034e222c6b7e4bb22385f1","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-02T13:03:04Z","title_canon_sha256":"536c0ff1c9c369a76d0d32f703bb9f0b84937d3dbc9892f2ac501d9a130d8627"},"schema_version":"1.0","source":{"id":"2010.00970","kind":"arxiv","version":3}},"canonical_sha256":"9f9d822e330cb830949d9179f5c7749e55472e61500efa1295e9997479a4769e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f9d822e330cb830949d9179f5c7749e55472e61500efa1295e9997479a4769e","first_computed_at":"2026-07-05T02:36:45.590337Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:36:45.590337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k3LkBTa6Bp09pCSsoSu8To0nIyRcy9oqklK/PqevZ3JjbmBLrdSqzo2JkTk+iIH5Vv3eh7u+wdAIarmSp/6PCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:36:45.590777Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.00970","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f078ecffa72e1d3e32286720d891ef12df9384d14b18522e1d857b93dbfba399","sha256:8969f600e5c342534ae10c59fdbf27b861bd430aa8be546b4d4df7e293aac881"],"state_sha256":"e24f30c7f0e1fe0ac6db0f806799c83339afa392e5b6a3b14281598ae5d557d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pJcrwQC/GgEL0VjA099mg/RqXHLRbfsdKXQ3bHZGDCx27clQmFN8jM6xvui1S5aPybGWoNKPlPyklZuv5l5XBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T07:45:33.702245Z","bundle_sha256":"8b2269e75c00dc8cf10dda400aee02495d3732bb7ffca2fc0fdfbeae3ac1ddd9"}}