{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BEH32RIGUROOLXHFFWA76BMSM5","short_pith_number":"pith:BEH32RIG","schema_version":"1.0","canonical_sha256":"090fbd4506a45ce5dce52d81ff05926744b000f43723401d10b7638f937fb09d","source":{"kind":"arxiv","id":"1706.04918","version":1},"attestation_state":"computed","paper":{"title":"Robust Submodular Maximization: A Non-Uniform Partitioning Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ilija Bogunovic, Jonathan Scarlett, Slobodan Mitrovi\\'c, Volkan Cevher","submitted_at":"2017-06-15T15:15:10Z","abstract_excerpt":"We study the problem of maximizing a monotone submodular function subject to a cardinality constraint $k$, with the added twist that a number of items $\\tau$ from the returned set may be removed. We focus on the worst-case setting considered in (Orlin et al., 2016), in which a constant-factor approximation guarantee was given for $\\tau = o(\\sqrt{k})$. In this paper, we solve a key open problem raised therein, presenting a new Partitioned Robust (PRo) submodular maximization algorithm that achieves the same guarantee for more general $\\tau = o(k)$. Our algorithm constructs partitions consisting"},"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":"1706.04918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-15T15:15:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0d2929a9ffd6678644111533b243b4a40ab0e5e23dec3c5f57c5fb95f779f14f","abstract_canon_sha256":"7837bb998ef90d2f9e2355f04324d2eae8c943a549adce124f5282f171132f35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:18.538874Z","signature_b64":"Cn5+6kJVRNm7eyP2FhJ5lBXhNfSxTJ5kHQAAXaptU5hxmahi2v+c/r4sPfOTfKOYSHVEVb4vuSnH9Fuu9nj4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"090fbd4506a45ce5dce52d81ff05926744b000f43723401d10b7638f937fb09d","last_reissued_at":"2026-05-18T00:42:18.538137Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:18.538137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Submodular Maximization: A Non-Uniform Partitioning Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ilija Bogunovic, Jonathan Scarlett, Slobodan Mitrovi\\'c, Volkan Cevher","submitted_at":"2017-06-15T15:15:10Z","abstract_excerpt":"We study the problem of maximizing a monotone submodular function subject to a cardinality constraint $k$, with the added twist that a number of items $\\tau$ from the returned set may be removed. We focus on the worst-case setting considered in (Orlin et al., 2016), in which a constant-factor approximation guarantee was given for $\\tau = o(\\sqrt{k})$. In this paper, we solve a key open problem raised therein, presenting a new Partitioned Robust (PRo) submodular maximization algorithm that achieves the same guarantee for more general $\\tau = o(k)$. Our algorithm constructs partitions consisting"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04918","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":"1706.04918","created_at":"2026-05-18T00:42:18.538263+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04918v1","created_at":"2026-05-18T00:42:18.538263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04918","created_at":"2026-05-18T00:42:18.538263+00:00"},{"alias_kind":"pith_short_12","alias_value":"BEH32RIGUROO","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BEH32RIGUROOLXHF","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BEH32RIG","created_at":"2026-05-18T12:31:08.081275+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/BEH32RIGUROOLXHFFWA76BMSM5","json":"https://pith.science/pith/BEH32RIGUROOLXHFFWA76BMSM5.json","graph_json":"https://pith.science/api/pith-number/BEH32RIGUROOLXHFFWA76BMSM5/graph.json","events_json":"https://pith.science/api/pith-number/BEH32RIGUROOLXHFFWA76BMSM5/events.json","paper":"https://pith.science/paper/BEH32RIG"},"agent_actions":{"view_html":"https://pith.science/pith/BEH32RIGUROOLXHFFWA76BMSM5","download_json":"https://pith.science/pith/BEH32RIGUROOLXHFFWA76BMSM5.json","view_paper":"https://pith.science/paper/BEH32RIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04918&json=true","fetch_graph":"https://pith.science/api/pith-number/BEH32RIGUROOLXHFFWA76BMSM5/graph.json","fetch_events":"https://pith.science/api/pith-number/BEH32RIGUROOLXHFFWA76BMSM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BEH32RIGUROOLXHFFWA76BMSM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BEH32RIGUROOLXHFFWA76BMSM5/action/storage_attestation","attest_author":"https://pith.science/pith/BEH32RIGUROOLXHFFWA76BMSM5/action/author_attestation","sign_citation":"https://pith.science/pith/BEH32RIGUROOLXHFFWA76BMSM5/action/citation_signature","submit_replication":"https://pith.science/pith/BEH32RIGUROOLXHFFWA76BMSM5/action/replication_record"}},"created_at":"2026-05-18T00:42:18.538263+00:00","updated_at":"2026-05-18T00:42:18.538263+00:00"}