{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RIW3MV33VODAMI2S6CSIEMG6PE","short_pith_number":"pith:RIW3MV33","schema_version":"1.0","canonical_sha256":"8a2db6577bab86062352f0a48230de791e3a3fc2112afd323ec44e2e8ec5587f","source":{"kind":"arxiv","id":"1904.09354","version":1},"attestation_state":"computed","paper":{"title":"Submodular Maximization Beyond Non-negativity: Guarantees, Fast Algorithms, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.DS","authors_text":"Amin Karbasi, Christopher Harshaw, Justin Ward, Moran Feldman","submitted_at":"2019-04-19T22:00:09Z","abstract_excerpt":"It is generally believed that submodular functions -- and the more general class of $\\gamma$-weakly submodular functions -- may only be optimized under the non-negativity assumption $f(S) \\geq 0$. In this paper, we show that once the function is expressed as the difference $f = g - c$, where $g$ is monotone, non-negative, and $\\gamma$-weakly submodular and $c$ is non-negative modular, then strong approximation guarantees may be obtained. We present an algorithm for maximizing $g - c$ under a $k$-cardinality constraint which produces a random feasible set $S$ such that $\\mathbb{E} \\left[ g(S) -"},"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":"1904.09354","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-19T22:00:09Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"a9b606fee8cb711d45f4e182017a4abbd197c2a668ef7f32328aa1f5302fac75","abstract_canon_sha256":"564ad0ee12c6f3f7361c61a870d8ca31abdf67f5c3ab95942756bc09bd5ff5df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:07.324289Z","signature_b64":"XgDFX16h2/+l35qSWzNLT3LjMqvdtri4uqsyUf4TKflLd3hwV92S6iOudKGxVi2Unzw5MkR3Y7kzN1UJr3hZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a2db6577bab86062352f0a48230de791e3a3fc2112afd323ec44e2e8ec5587f","last_reissued_at":"2026-05-17T23:48:07.323664Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:07.323664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Submodular Maximization Beyond Non-negativity: Guarantees, Fast Algorithms, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.DS","authors_text":"Amin Karbasi, Christopher Harshaw, Justin Ward, Moran Feldman","submitted_at":"2019-04-19T22:00:09Z","abstract_excerpt":"It is generally believed that submodular functions -- and the more general class of $\\gamma$-weakly submodular functions -- may only be optimized under the non-negativity assumption $f(S) \\geq 0$. In this paper, we show that once the function is expressed as the difference $f = g - c$, where $g$ is monotone, non-negative, and $\\gamma$-weakly submodular and $c$ is non-negative modular, then strong approximation guarantees may be obtained. We present an algorithm for maximizing $g - c$ under a $k$-cardinality constraint which produces a random feasible set $S$ such that $\\mathbb{E} \\left[ g(S) -"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09354","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":"1904.09354","created_at":"2026-05-17T23:48:07.323750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.09354v1","created_at":"2026-05-17T23:48:07.323750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09354","created_at":"2026-05-17T23:48:07.323750+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIW3MV33VODA","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIW3MV33VODAMI2S","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIW3MV33","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04428","citing_title":"Submodular Ground-Set Pruning: Monotone Tightness and a Non-Monotone Separation","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RIW3MV33VODAMI2S6CSIEMG6PE","json":"https://pith.science/pith/RIW3MV33VODAMI2S6CSIEMG6PE.json","graph_json":"https://pith.science/api/pith-number/RIW3MV33VODAMI2S6CSIEMG6PE/graph.json","events_json":"https://pith.science/api/pith-number/RIW3MV33VODAMI2S6CSIEMG6PE/events.json","paper":"https://pith.science/paper/RIW3MV33"},"agent_actions":{"view_html":"https://pith.science/pith/RIW3MV33VODAMI2S6CSIEMG6PE","download_json":"https://pith.science/pith/RIW3MV33VODAMI2S6CSIEMG6PE.json","view_paper":"https://pith.science/paper/RIW3MV33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.09354&json=true","fetch_graph":"https://pith.science/api/pith-number/RIW3MV33VODAMI2S6CSIEMG6PE/graph.json","fetch_events":"https://pith.science/api/pith-number/RIW3MV33VODAMI2S6CSIEMG6PE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIW3MV33VODAMI2S6CSIEMG6PE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIW3MV33VODAMI2S6CSIEMG6PE/action/storage_attestation","attest_author":"https://pith.science/pith/RIW3MV33VODAMI2S6CSIEMG6PE/action/author_attestation","sign_citation":"https://pith.science/pith/RIW3MV33VODAMI2S6CSIEMG6PE/action/citation_signature","submit_replication":"https://pith.science/pith/RIW3MV33VODAMI2S6CSIEMG6PE/action/replication_record"}},"created_at":"2026-05-17T23:48:07.323750+00:00","updated_at":"2026-05-17T23:48:07.323750+00:00"}