{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CUQPWMVR5AJOWLZW7ZMCRTXLXR","short_pith_number":"pith:CUQPWMVR","canonical_record":{"source":{"id":"1810.00737","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-01T14:48:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"83b98fdd16af0434b9d38cec91524ab4911ff3ed40f50164aa84ae3db33777a9","abstract_canon_sha256":"8a8df69cf48e029d2c3107025cb57aa162dd583cf7bed00c02dd82c251ccd2c5"},"schema_version":"1.0"},"canonical_sha256":"1520fb32b1e812eb2f36fe5828ceebbc53fefada76762b88e83a8582e67b8de1","source":{"kind":"arxiv","id":"1810.00737","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00737","created_at":"2026-05-18T00:04:24Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00737v1","created_at":"2026-05-18T00:04:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00737","created_at":"2026-05-18T00:04:24Z"},{"alias_kind":"pith_short_12","alias_value":"CUQPWMVR5AJO","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CUQPWMVR5AJOWLZW","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CUQPWMVR","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CUQPWMVR5AJOWLZW7ZMCRTXLXR","target":"record","payload":{"canonical_record":{"source":{"id":"1810.00737","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-01T14:48:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"83b98fdd16af0434b9d38cec91524ab4911ff3ed40f50164aa84ae3db33777a9","abstract_canon_sha256":"8a8df69cf48e029d2c3107025cb57aa162dd583cf7bed00c02dd82c251ccd2c5"},"schema_version":"1.0"},"canonical_sha256":"1520fb32b1e812eb2f36fe5828ceebbc53fefada76762b88e83a8582e67b8de1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:24.961525Z","signature_b64":"Ny++impKSbwOphHbfSD9QKq1y0DFUTYB2CPfedQMVu8qINVzdJjqxQbXrSYohuc1sMyKjXBc2KdChHZIpcL5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1520fb32b1e812eb2f36fe5828ceebbc53fefada76762b88e83a8582e67b8de1","last_reissued_at":"2026-05-18T00:04:24.961073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:24.961073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.00737","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:04:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nUAVPz/AUxTyx8h0a6sGaTfurlnV7ZrgXOUGYKpyXRmLtlIJQ0VpDT19mI8HQBWdxgQdalfldxBlKTMz0RrdCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:21:38.899775Z"},"content_sha256":"c071ece556b1cc6cefeacb5daf31f6bfb1eeee0ee53022887e55dd07ff50db29","schema_version":"1.0","event_id":"sha256:c071ece556b1cc6cefeacb5daf31f6bfb1eeee0ee53022887e55dd07ff50db29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CUQPWMVR5AJOWLZW7ZMCRTXLXR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Risk-Averse Stochastic Convex Bandit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Adrian Rivera Cardoso, Huan Xu","submitted_at":"2018-10-01T14:48:42Z","abstract_excerpt":"Motivated by applications in clinical trials and finance, we study the problem of online convex optimization (with bandit feedback) where the decision maker is risk-averse. We provide two algorithms to solve this problem. The first one is a descent-type algorithm which is easy to implement. The second algorithm, which combines the ellipsoid method and a center point device, achieves (almost) optimal regret bounds with respect to the number of rounds. To the best of our knowledge this is the first attempt to address risk-aversion in the online convex bandit problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00737","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:04:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f3Sx74MhkDZUMTWoQZ6yLyNeMrQTW5jqRayPv+cp4+Waj247PfJYbeBkJMjeGvvrd1nkFj3QCkC0N2Swr5KRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:21:38.900345Z"},"content_sha256":"2f85d0210c9c068b8191788dd9589fb2b91feaffe3f6a5765568bb47f7c60210","schema_version":"1.0","event_id":"sha256:2f85d0210c9c068b8191788dd9589fb2b91feaffe3f6a5765568bb47f7c60210"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CUQPWMVR5AJOWLZW7ZMCRTXLXR/bundle.json","state_url":"https://pith.science/pith/CUQPWMVR5AJOWLZW7ZMCRTXLXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CUQPWMVR5AJOWLZW7ZMCRTXLXR/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-31T05:21:38Z","links":{"resolver":"https://pith.science/pith/CUQPWMVR5AJOWLZW7ZMCRTXLXR","bundle":"https://pith.science/pith/CUQPWMVR5AJOWLZW7ZMCRTXLXR/bundle.json","state":"https://pith.science/pith/CUQPWMVR5AJOWLZW7ZMCRTXLXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CUQPWMVR5AJOWLZW7ZMCRTXLXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CUQPWMVR5AJOWLZW7ZMCRTXLXR","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":"8a8df69cf48e029d2c3107025cb57aa162dd583cf7bed00c02dd82c251ccd2c5","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-01T14:48:42Z","title_canon_sha256":"83b98fdd16af0434b9d38cec91524ab4911ff3ed40f50164aa84ae3db33777a9"},"schema_version":"1.0","source":{"id":"1810.00737","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00737","created_at":"2026-05-18T00:04:24Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00737v1","created_at":"2026-05-18T00:04:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00737","created_at":"2026-05-18T00:04:24Z"},{"alias_kind":"pith_short_12","alias_value":"CUQPWMVR5AJO","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CUQPWMVR5AJOWLZW","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CUQPWMVR","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:2f85d0210c9c068b8191788dd9589fb2b91feaffe3f6a5765568bb47f7c60210","target":"graph","created_at":"2026-05-18T00:04: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":"Motivated by applications in clinical trials and finance, we study the problem of online convex optimization (with bandit feedback) where the decision maker is risk-averse. We provide two algorithms to solve this problem. The first one is a descent-type algorithm which is easy to implement. The second algorithm, which combines the ellipsoid method and a center point device, achieves (almost) optimal regret bounds with respect to the number of rounds. To the best of our knowledge this is the first attempt to address risk-aversion in the online convex bandit problem.","authors_text":"Adrian Rivera Cardoso, Huan Xu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-01T14:48:42Z","title":"Risk-Averse Stochastic Convex Bandit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00737","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:c071ece556b1cc6cefeacb5daf31f6bfb1eeee0ee53022887e55dd07ff50db29","target":"record","created_at":"2026-05-18T00:04: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":"8a8df69cf48e029d2c3107025cb57aa162dd583cf7bed00c02dd82c251ccd2c5","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-01T14:48:42Z","title_canon_sha256":"83b98fdd16af0434b9d38cec91524ab4911ff3ed40f50164aa84ae3db33777a9"},"schema_version":"1.0","source":{"id":"1810.00737","kind":"arxiv","version":1}},"canonical_sha256":"1520fb32b1e812eb2f36fe5828ceebbc53fefada76762b88e83a8582e67b8de1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1520fb32b1e812eb2f36fe5828ceebbc53fefada76762b88e83a8582e67b8de1","first_computed_at":"2026-05-18T00:04:24.961073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:24.961073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ny++impKSbwOphHbfSD9QKq1y0DFUTYB2CPfedQMVu8qINVzdJjqxQbXrSYohuc1sMyKjXBc2KdChHZIpcL5Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:24.961525Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.00737","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c071ece556b1cc6cefeacb5daf31f6bfb1eeee0ee53022887e55dd07ff50db29","sha256:2f85d0210c9c068b8191788dd9589fb2b91feaffe3f6a5765568bb47f7c60210"],"state_sha256":"78ed16b8a0d20c647f77d5429fa502a6511523c319b06d5a5f8be98e754fb9ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WJs+Hc3MSrh9BFRBpjib8nH18ExIKynaQu1BYN+iV1ODLN1gxfsYfsIkVSLrVT1tGyi1rEjPpYZl/QFoDFmKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:21:38.903027Z","bundle_sha256":"7334b365f2d879efceef0b874da2983f78d40ebcd0d23237b82cd4a3aa83e941"}}