{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:T6OYELRTBS4DBFE5SF47LR3UTZ","short_pith_number":"pith:T6OYELRT","schema_version":"1.0","canonical_sha256":"9f9d822e330cb830949d9179f5c7749e55472e61500efa1295e9997479a4769e","source":{"kind":"arxiv","id":"2010.00970","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2010.00970","created_at":"2026-07-05T02:36:45.590395+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.00970v3","created_at":"2026-07-05T02:36:45.590395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.00970","created_at":"2026-07-05T02:36:45.590395+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6OYELRTBS4D","created_at":"2026-07-05T02:36:45.590395+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6OYELRTBS4DBFE5","created_at":"2026-07-05T02:36:45.590395+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6OYELRT","created_at":"2026-07-05T02:36:45.590395+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/T6OYELRTBS4DBFE5SF47LR3UTZ","json":"https://pith.science/pith/T6OYELRTBS4DBFE5SF47LR3UTZ.json","graph_json":"https://pith.science/api/pith-number/T6OYELRTBS4DBFE5SF47LR3UTZ/graph.json","events_json":"https://pith.science/api/pith-number/T6OYELRTBS4DBFE5SF47LR3UTZ/events.json","paper":"https://pith.science/paper/T6OYELRT"},"agent_actions":{"view_html":"https://pith.science/pith/T6OYELRTBS4DBFE5SF47LR3UTZ","download_json":"https://pith.science/pith/T6OYELRTBS4DBFE5SF47LR3UTZ.json","view_paper":"https://pith.science/paper/T6OYELRT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.00970&json=true","fetch_graph":"https://pith.science/api/pith-number/T6OYELRTBS4DBFE5SF47LR3UTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/T6OYELRTBS4DBFE5SF47LR3UTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6OYELRTBS4DBFE5SF47LR3UTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6OYELRTBS4DBFE5SF47LR3UTZ/action/storage_attestation","attest_author":"https://pith.science/pith/T6OYELRTBS4DBFE5SF47LR3UTZ/action/author_attestation","sign_citation":"https://pith.science/pith/T6OYELRTBS4DBFE5SF47LR3UTZ/action/citation_signature","submit_replication":"https://pith.science/pith/T6OYELRTBS4DBFE5SF47LR3UTZ/action/replication_record"}},"created_at":"2026-07-05T02:36:45.590395+00:00","updated_at":"2026-07-05T02:36:45.590395+00:00"}