{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SQSUK76OLIBQEZDHHGBP2OXPJU","short_pith_number":"pith:SQSUK76O","schema_version":"1.0","canonical_sha256":"9425457fce5a030264673982fd3aef4d16503542e023866e84351c7541121496","source":{"kind":"arxiv","id":"1808.03085","version":1},"attestation_state":"computed","paper":{"title":"Generalized budgeted submodular set function maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj","submitted_at":"2018-08-09T11:08:00Z","abstract_excerpt":"In this paper we consider a generalization of the well-known budgeted maximum coverage problem. We are given a ground set of elements and a set of bins. The goal is to find a subset of elements along with an associated set of bins, such that the overall cost is at most a given budget, and the profit is maximized. Each bin has its own cost and the cost of each element depends on its associated bin. The profit is measured by a monotone submodular function over the elements. We first present an algorithm that guarantees an approximation factor of $\\frac{1}{2}\\left(1-\\frac{1}{e^\\alpha}\\right)$, wh"},"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":"1808.03085","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-09T11:08:00Z","cross_cats_sorted":[],"title_canon_sha256":"c07278e93c8dc51814df0038ca8f38e0906f430043936434a707254a36b511d8","abstract_canon_sha256":"7455cd8404c368cc3f2fc58cac9efcbc2b26e8acbf4a690763c01b99c6d506e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:30.223539Z","signature_b64":"/LckRiTLJ+LjtfUp4/w4Hs3DIsr1R7u7sb3yBQmg1rmwkRLjwGvc7RrvGO6C6WrIA2YdNHbDgwJpxutTBhaHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9425457fce5a030264673982fd3aef4d16503542e023866e84351c7541121496","last_reissued_at":"2026-05-18T00:08:30.222949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:30.222949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized budgeted submodular set function maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj","submitted_at":"2018-08-09T11:08:00Z","abstract_excerpt":"In this paper we consider a generalization of the well-known budgeted maximum coverage problem. We are given a ground set of elements and a set of bins. The goal is to find a subset of elements along with an associated set of bins, such that the overall cost is at most a given budget, and the profit is maximized. Each bin has its own cost and the cost of each element depends on its associated bin. The profit is measured by a monotone submodular function over the elements. We first present an algorithm that guarantees an approximation factor of $\\frac{1}{2}\\left(1-\\frac{1}{e^\\alpha}\\right)$, wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03085","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":"1808.03085","created_at":"2026-05-18T00:08:30.223036+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.03085v1","created_at":"2026-05-18T00:08:30.223036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03085","created_at":"2026-05-18T00:08:30.223036+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQSUK76OLIBQ","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQSUK76OLIBQEZDH","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQSUK76O","created_at":"2026-05-18T12:32:53.628368+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/SQSUK76OLIBQEZDHHGBP2OXPJU","json":"https://pith.science/pith/SQSUK76OLIBQEZDHHGBP2OXPJU.json","graph_json":"https://pith.science/api/pith-number/SQSUK76OLIBQEZDHHGBP2OXPJU/graph.json","events_json":"https://pith.science/api/pith-number/SQSUK76OLIBQEZDHHGBP2OXPJU/events.json","paper":"https://pith.science/paper/SQSUK76O"},"agent_actions":{"view_html":"https://pith.science/pith/SQSUK76OLIBQEZDHHGBP2OXPJU","download_json":"https://pith.science/pith/SQSUK76OLIBQEZDHHGBP2OXPJU.json","view_paper":"https://pith.science/paper/SQSUK76O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.03085&json=true","fetch_graph":"https://pith.science/api/pith-number/SQSUK76OLIBQEZDHHGBP2OXPJU/graph.json","fetch_events":"https://pith.science/api/pith-number/SQSUK76OLIBQEZDHHGBP2OXPJU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQSUK76OLIBQEZDHHGBP2OXPJU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQSUK76OLIBQEZDHHGBP2OXPJU/action/storage_attestation","attest_author":"https://pith.science/pith/SQSUK76OLIBQEZDHHGBP2OXPJU/action/author_attestation","sign_citation":"https://pith.science/pith/SQSUK76OLIBQEZDHHGBP2OXPJU/action/citation_signature","submit_replication":"https://pith.science/pith/SQSUK76OLIBQEZDHHGBP2OXPJU/action/replication_record"}},"created_at":"2026-05-18T00:08:30.223036+00:00","updated_at":"2026-05-18T00:08:30.223036+00:00"}