{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RIW3MV33VODAMI2S6CSIEMG6PE","short_pith_number":"pith:RIW3MV33","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"},"canonical_sha256":"8a2db6577bab86062352f0a48230de791e3a3fc2112afd323ec44e2e8ec5587f","source":{"kind":"arxiv","id":"1904.09354","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09354","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09354v1","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09354","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"pith_short_12","alias_value":"RIW3MV33VODA","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RIW3MV33VODAMI2S","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RIW3MV33","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RIW3MV33VODAMI2S6CSIEMG6PE","target":"record","payload":{"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"},"canonical_sha256":"8a2db6577bab86062352f0a48230de791e3a3fc2112afd323ec44e2e8ec5587f","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"},"source_kind":"arxiv","source_id":"1904.09354","source_version":1,"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-05-17T23:48:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"69UWZYQD0lgIpvqsaNU4jTVyGXOwmhmAcSBMHcLSqAdyaPcaAz+TkD87HVQ/Xgdre4m7IukmFNLAIMBWBq1gDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:48:05.060382Z"},"content_sha256":"0eebacd641571a98b13f6806e4e9355dd58c93565ae3040109e3ace9106936f2","schema_version":"1.0","event_id":"sha256:0eebacd641571a98b13f6806e4e9355dd58c93565ae3040109e3ace9106936f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RIW3MV33VODAMI2S6CSIEMG6PE","target":"graph","payload":{"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"},"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-05-17T23:48:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zazZ08tKIomxsKjRxKFErDw9dVPId51ParGdzv6E4DWE46miS3i3mgaALOLlCdFQjxfXZe8/vhPNcqQCimL9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:48:05.060748Z"},"content_sha256":"93e62c2fe3a08dd371ea68d1b363937c1eaab657e693b9df12d48169c1906288","schema_version":"1.0","event_id":"sha256:93e62c2fe3a08dd371ea68d1b363937c1eaab657e693b9df12d48169c1906288"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIW3MV33VODAMI2S6CSIEMG6PE/bundle.json","state_url":"https://pith.science/pith/RIW3MV33VODAMI2S6CSIEMG6PE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIW3MV33VODAMI2S6CSIEMG6PE/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-06-03T20:48:05Z","links":{"resolver":"https://pith.science/pith/RIW3MV33VODAMI2S6CSIEMG6PE","bundle":"https://pith.science/pith/RIW3MV33VODAMI2S6CSIEMG6PE/bundle.json","state":"https://pith.science/pith/RIW3MV33VODAMI2S6CSIEMG6PE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIW3MV33VODAMI2S6CSIEMG6PE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RIW3MV33VODAMI2S6CSIEMG6PE","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":"564ad0ee12c6f3f7361c61a870d8ca31abdf67f5c3ab95942756bc09bd5ff5df","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-19T22:00:09Z","title_canon_sha256":"a9b606fee8cb711d45f4e182017a4abbd197c2a668ef7f32328aa1f5302fac75"},"schema_version":"1.0","source":{"id":"1904.09354","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09354","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09354v1","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09354","created_at":"2026-05-17T23:48:07Z"},{"alias_kind":"pith_short_12","alias_value":"RIW3MV33VODA","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RIW3MV33VODAMI2S","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RIW3MV33","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:93e62c2fe3a08dd371ea68d1b363937c1eaab657e693b9df12d48169c1906288","target":"graph","created_at":"2026-05-17T23:48: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"},"paper":{"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) -","authors_text":"Amin Karbasi, Christopher Harshaw, Justin Ward, Moran Feldman","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-19T22:00:09Z","title":"Submodular Maximization Beyond Non-negativity: Guarantees, Fast Algorithms, and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09354","kind":"arxiv","version":1},"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:0eebacd641571a98b13f6806e4e9355dd58c93565ae3040109e3ace9106936f2","target":"record","created_at":"2026-05-17T23:48: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":"564ad0ee12c6f3f7361c61a870d8ca31abdf67f5c3ab95942756bc09bd5ff5df","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-19T22:00:09Z","title_canon_sha256":"a9b606fee8cb711d45f4e182017a4abbd197c2a668ef7f32328aa1f5302fac75"},"schema_version":"1.0","source":{"id":"1904.09354","kind":"arxiv","version":1}},"canonical_sha256":"8a2db6577bab86062352f0a48230de791e3a3fc2112afd323ec44e2e8ec5587f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a2db6577bab86062352f0a48230de791e3a3fc2112afd323ec44e2e8ec5587f","first_computed_at":"2026-05-17T23:48:07.323664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:07.323664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XgDFX16h2/+l35qSWzNLT3LjMqvdtri4uqsyUf4TKflLd3hwV92S6iOudKGxVi2Unzw5MkR3Y7kzN1UJr3hZCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:07.324289Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.09354","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0eebacd641571a98b13f6806e4e9355dd58c93565ae3040109e3ace9106936f2","sha256:93e62c2fe3a08dd371ea68d1b363937c1eaab657e693b9df12d48169c1906288"],"state_sha256":"7007b53128247f42fb1b11c39b3da97a0afe0f290c4b7346a6e6a86afc78420c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SkW6QgG3Xm5ghNVBx4Fb4qFDKQ/dbI7mpgNNLzKc53Xh4EBFJf4SuZVv14Q5jxAzT1pXnhxULAcS0zmweX/LBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:48:05.062759Z","bundle_sha256":"c9ceef3a160e8fe99ad9ec4a9a623970b7867c6511e8e3f6ec3918f694896f65"}}