{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZNXDKMG3NWYO6NN73FJX6IRMTQ","short_pith_number":"pith:ZNXDKMG3","canonical_record":{"source":{"id":"1905.05339","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-14T01:33:04Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"10c968749428444a3fdedc4cfc39cce826e40be7c1c892e1b38429479e29c8ed","abstract_canon_sha256":"84aa2e42e1769c2ea8aead3739708d241798234cb1839d98cf48d9fadd90de96"},"schema_version":"1.0"},"canonical_sha256":"cb6e3530db6db0ef35bfd9537f222c9c12448470af66189e92cab2012a034df8","source":{"kind":"arxiv","id":"1905.05339","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05339","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05339v3","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05339","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"ZNXDKMG3NWYO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZNXDKMG3NWYO6NN7","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZNXDKMG3","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZNXDKMG3NWYO6NN73FJX6IRMTQ","target":"record","payload":{"canonical_record":{"source":{"id":"1905.05339","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-14T01:33:04Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"10c968749428444a3fdedc4cfc39cce826e40be7c1c892e1b38429479e29c8ed","abstract_canon_sha256":"84aa2e42e1769c2ea8aead3739708d241798234cb1839d98cf48d9fadd90de96"},"schema_version":"1.0"},"canonical_sha256":"cb6e3530db6db0ef35bfd9537f222c9c12448470af66189e92cab2012a034df8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:24.158775Z","signature_b64":"aNRsCX9cuNhkqf2M4p1Gq5qoZXtyWL2vxo+KSLECaFjyBjQFNPejAngJfWIdSPhxcWD4tPd8mnTUM3yylpdiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb6e3530db6db0ef35bfd9537f222c9c12448470af66189e92cab2012a034df8","last_reissued_at":"2026-05-17T23:39:24.156994Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:24.156994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.05339","source_version":3,"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:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DbLkcs5E8OrwBumZNrfEqFoLGolkkZnc8AqZPyMGW0cmWJ4HeLitqBsadN2Zx85BF9mLe0ene5vw8FcXHfkDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:24:00.997017Z"},"content_sha256":"f4013979c4426cdb21bad4eba61918b24e3df2d336cfe78ca3f429aa03c4c712","schema_version":"1.0","event_id":"sha256:f4013979c4426cdb21bad4eba61918b24e3df2d336cfe78ca3f429aa03c4c712"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZNXDKMG3NWYO6NN73FJX6IRMTQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Robust Optimization with Nearly Submodular Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Jing Yuan, Shaojie Tang","submitted_at":"2019-05-14T01:33:04Z","abstract_excerpt":"Constrained submodular maximization has been extensively studied in the recent years. In this paper, we study adaptive robust optimization with nearly submodular structure (ARONSS). Our objective is to randomly select a subset of items that maximizes the worst-case value of several reward functions simultaneously. Our work differs from existing studies in two ways: (1) we study the robust optimization problem under the adaptive setting, i.e., one needs to adaptively select items based on the feedback collected from picked items, and (2) our results apply to a broad range of reward functions ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05339","kind":"arxiv","version":3},"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:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N7InTRt9HwixYe6JTShsJhm8X0OcdSWzN66PzZMtiFqza9cseda6n1Hq3sGIqJMScOwyZKzMLQCXfz8IaY6vCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:24:00.997706Z"},"content_sha256":"f01f9b489ce163da26d695e0cfd3d4bec41eb2ee66ff5c41cfe365dfdba69089","schema_version":"1.0","event_id":"sha256:f01f9b489ce163da26d695e0cfd3d4bec41eb2ee66ff5c41cfe365dfdba69089"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZNXDKMG3NWYO6NN73FJX6IRMTQ/bundle.json","state_url":"https://pith.science/pith/ZNXDKMG3NWYO6NN73FJX6IRMTQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZNXDKMG3NWYO6NN73FJX6IRMTQ/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-06T06:24:01Z","links":{"resolver":"https://pith.science/pith/ZNXDKMG3NWYO6NN73FJX6IRMTQ","bundle":"https://pith.science/pith/ZNXDKMG3NWYO6NN73FJX6IRMTQ/bundle.json","state":"https://pith.science/pith/ZNXDKMG3NWYO6NN73FJX6IRMTQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZNXDKMG3NWYO6NN73FJX6IRMTQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZNXDKMG3NWYO6NN73FJX6IRMTQ","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":"84aa2e42e1769c2ea8aead3739708d241798234cb1839d98cf48d9fadd90de96","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-14T01:33:04Z","title_canon_sha256":"10c968749428444a3fdedc4cfc39cce826e40be7c1c892e1b38429479e29c8ed"},"schema_version":"1.0","source":{"id":"1905.05339","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05339","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05339v3","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05339","created_at":"2026-05-17T23:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"ZNXDKMG3NWYO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZNXDKMG3NWYO6NN7","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZNXDKMG3","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:f01f9b489ce163da26d695e0cfd3d4bec41eb2ee66ff5c41cfe365dfdba69089","target":"graph","created_at":"2026-05-17T23:39:24Z","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":"Constrained submodular maximization has been extensively studied in the recent years. In this paper, we study adaptive robust optimization with nearly submodular structure (ARONSS). Our objective is to randomly select a subset of items that maximizes the worst-case value of several reward functions simultaneously. Our work differs from existing studies in two ways: (1) we study the robust optimization problem under the adaptive setting, i.e., one needs to adaptively select items based on the feedback collected from picked items, and (2) our results apply to a broad range of reward functions ch","authors_text":"Jing Yuan, Shaojie Tang","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-14T01:33:04Z","title":"Adaptive Robust Optimization with Nearly Submodular Structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05339","kind":"arxiv","version":3},"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:f4013979c4426cdb21bad4eba61918b24e3df2d336cfe78ca3f429aa03c4c712","target":"record","created_at":"2026-05-17T23:39:24Z","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":"84aa2e42e1769c2ea8aead3739708d241798234cb1839d98cf48d9fadd90de96","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-14T01:33:04Z","title_canon_sha256":"10c968749428444a3fdedc4cfc39cce826e40be7c1c892e1b38429479e29c8ed"},"schema_version":"1.0","source":{"id":"1905.05339","kind":"arxiv","version":3}},"canonical_sha256":"cb6e3530db6db0ef35bfd9537f222c9c12448470af66189e92cab2012a034df8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb6e3530db6db0ef35bfd9537f222c9c12448470af66189e92cab2012a034df8","first_computed_at":"2026-05-17T23:39:24.156994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:24.156994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aNRsCX9cuNhkqf2M4p1Gq5qoZXtyWL2vxo+KSLECaFjyBjQFNPejAngJfWIdSPhxcWD4tPd8mnTUM3yylpdiBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:24.158775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05339","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4013979c4426cdb21bad4eba61918b24e3df2d336cfe78ca3f429aa03c4c712","sha256:f01f9b489ce163da26d695e0cfd3d4bec41eb2ee66ff5c41cfe365dfdba69089"],"state_sha256":"f6a515d8cd15f50787f90a400a8f237a083034556ede76b1b5d34e72e5624717"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UjvEhyKRU/yOYZArMMp2UIqM6Q87Ebf/MKnf5YHChxgqi0qlrghYn0EUQrXxbRzZ+XN19U62yaCYDoV3cgpzDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:24:01.021858Z","bundle_sha256":"01b5e5849f58f2e2d82a80fe378602610e2636d869f3138a0970cbc91dcb81d1"}}