{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BEH32RIGUROOLXHFFWA76BMSM5","short_pith_number":"pith:BEH32RIG","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"},"canonical_sha256":"090fbd4506a45ce5dce52d81ff05926744b000f43723401d10b7638f937fb09d","source":{"kind":"arxiv","id":"1706.04918","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04918","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04918v1","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04918","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"pith_short_12","alias_value":"BEH32RIGUROO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BEH32RIGUROOLXHF","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BEH32RIG","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BEH32RIGUROOLXHFFWA76BMSM5","target":"record","payload":{"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"},"canonical_sha256":"090fbd4506a45ce5dce52d81ff05926744b000f43723401d10b7638f937fb09d","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"},"source_kind":"arxiv","source_id":"1706.04918","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-18T00:42:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aCta/cgBrNZUZvMQGyvdadNTIS3U4GJQIcAbqbgC3LYJz7h8XnjcZtrLtJSbkr61wk+JWqdAdg+UzjMPcc2cBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:59:12.792142Z"},"content_sha256":"c524840b2a492f01d5597ee929314e86b82f1b1a883d22ccf0779f490b5e48de","schema_version":"1.0","event_id":"sha256:c524840b2a492f01d5597ee929314e86b82f1b1a883d22ccf0779f490b5e48de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BEH32RIGUROOLXHFFWA76BMSM5","target":"graph","payload":{"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"},"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-18T00:42:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qrawQsMQX2fpz1k1XAIMBgXc8t9MjSzHfjnDOJonLFZYNCWeE+S7vbcLvf4aRzsAqDnJhnb/jNCMTBa5d7YBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:59:12.792775Z"},"content_sha256":"1aad6b7390a3702680cd6158da697e387dd9a2119d15d4f4ce1cfb09fe0cdbbd","schema_version":"1.0","event_id":"sha256:1aad6b7390a3702680cd6158da697e387dd9a2119d15d4f4ce1cfb09fe0cdbbd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BEH32RIGUROOLXHFFWA76BMSM5/bundle.json","state_url":"https://pith.science/pith/BEH32RIGUROOLXHFFWA76BMSM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BEH32RIGUROOLXHFFWA76BMSM5/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-05-25T10:59:12Z","links":{"resolver":"https://pith.science/pith/BEH32RIGUROOLXHFFWA76BMSM5","bundle":"https://pith.science/pith/BEH32RIGUROOLXHFFWA76BMSM5/bundle.json","state":"https://pith.science/pith/BEH32RIGUROOLXHFFWA76BMSM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BEH32RIGUROOLXHFFWA76BMSM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BEH32RIGUROOLXHFFWA76BMSM5","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":"7837bb998ef90d2f9e2355f04324d2eae8c943a549adce124f5282f171132f35","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-15T15:15:10Z","title_canon_sha256":"0d2929a9ffd6678644111533b243b4a40ab0e5e23dec3c5f57c5fb95f779f14f"},"schema_version":"1.0","source":{"id":"1706.04918","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04918","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04918v1","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04918","created_at":"2026-05-18T00:42:18Z"},{"alias_kind":"pith_short_12","alias_value":"BEH32RIGUROO","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BEH32RIGUROOLXHF","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BEH32RIG","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:1aad6b7390a3702680cd6158da697e387dd9a2119d15d4f4ce1cfb09fe0cdbbd","target":"graph","created_at":"2026-05-18T00:42:18Z","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":"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","authors_text":"Ilija Bogunovic, Jonathan Scarlett, Slobodan Mitrovi\\'c, Volkan Cevher","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-15T15:15:10Z","title":"Robust Submodular Maximization: A Non-Uniform Partitioning Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04918","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:c524840b2a492f01d5597ee929314e86b82f1b1a883d22ccf0779f490b5e48de","target":"record","created_at":"2026-05-18T00:42:18Z","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":"7837bb998ef90d2f9e2355f04324d2eae8c943a549adce124f5282f171132f35","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-15T15:15:10Z","title_canon_sha256":"0d2929a9ffd6678644111533b243b4a40ab0e5e23dec3c5f57c5fb95f779f14f"},"schema_version":"1.0","source":{"id":"1706.04918","kind":"arxiv","version":1}},"canonical_sha256":"090fbd4506a45ce5dce52d81ff05926744b000f43723401d10b7638f937fb09d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"090fbd4506a45ce5dce52d81ff05926744b000f43723401d10b7638f937fb09d","first_computed_at":"2026-05-18T00:42:18.538137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:18.538137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cn5+6kJVRNm7eyP2FhJ5lBXhNfSxTJ5kHQAAXaptU5hxmahi2v+c/r4sPfOTfKOYSHVEVb4vuSnH9Fuu9nj4Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:18.538874Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.04918","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c524840b2a492f01d5597ee929314e86b82f1b1a883d22ccf0779f490b5e48de","sha256:1aad6b7390a3702680cd6158da697e387dd9a2119d15d4f4ce1cfb09fe0cdbbd"],"state_sha256":"18ac46b0aa2488d7f278783e19b2e31292372b77a4bdbe25040702d056e26dc6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CHNCf+SkC8GMaW6ZqTIGjTKI7afn9P9cgdSfGR5DIro8U+koLyYlQF9mZhYWo9zu/t1IaLzov69ma+rpOHE1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:59:12.797457Z","bundle_sha256":"2c1419d21e27008f44f2e901510210024851712c4b15a423090cedd915ac6467"}}