{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JKG4DQD7GGHALJKJHGQPLQRQXE","short_pith_number":"pith:JKG4DQD7","canonical_record":{"source":{"id":"1407.6661","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-24T17:37:43Z","cross_cats_sorted":[],"title_canon_sha256":"17f649d075e14ac7a52fce74e4262444b113a6826dfa213f0a00f89d8486c1ce","abstract_canon_sha256":"f32912552a882377c6679bff67fa0b09d5c4bb8f2923390071fae6337dffdd93"},"schema_version":"1.0"},"canonical_sha256":"4a8dc1c07f318e05a54939a0f5c230b92640bdb29ef2b51386eaf5ffd83bfa16","source":{"kind":"arxiv","id":"1407.6661","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6661","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6661v6","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6661","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"pith_short_12","alias_value":"JKG4DQD7GGHA","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JKG4DQD7GGHALJKJ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JKG4DQD7","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JKG4DQD7GGHALJKJHGQPLQRQXE","target":"record","payload":{"canonical_record":{"source":{"id":"1407.6661","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-24T17:37:43Z","cross_cats_sorted":[],"title_canon_sha256":"17f649d075e14ac7a52fce74e4262444b113a6826dfa213f0a00f89d8486c1ce","abstract_canon_sha256":"f32912552a882377c6679bff67fa0b09d5c4bb8f2923390071fae6337dffdd93"},"schema_version":"1.0"},"canonical_sha256":"4a8dc1c07f318e05a54939a0f5c230b92640bdb29ef2b51386eaf5ffd83bfa16","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:23.154237Z","signature_b64":"t31t5t0/2yMaxCc5krksDTNy05pabFsVROHzdwjmO5YgxlmS6CIoN/XsO0nkqUQp4pwvduDr5tm3Jaj6QLT8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a8dc1c07f318e05a54939a0f5c230b92640bdb29ef2b51386eaf5ffd83bfa16","last_reissued_at":"2026-05-18T01:06:23.153530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:23.153530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.6661","source_version":6,"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-18T01:06:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MbPUB9RpWwrAryV2jqC6X0xw8BHIk5z1jWEmNBiHIGR6ikjEcQ55vG7oof97nNLAaRrfNg2bKI2kbpYhJ/hiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:38:39.273188Z"},"content_sha256":"33e18b5af1dcfd6598107f4421e37c088f2ddd3010d48099f1d332d0d461cb85","schema_version":"1.0","event_id":"sha256:33e18b5af1dcfd6598107f4421e37c088f2ddd3010d48099f1d332d0d461cb85"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JKG4DQD7GGHALJKJHGQPLQRQXE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multistep stochastic mirror descent for risk-averse convex stochastic programs based on extended polyhedral risk measures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Vincent Guigues","submitted_at":"2014-07-24T17:37:43Z","abstract_excerpt":"We consider risk-averse convex stochastic programs expressed in terms of extended polyhedral risk measures. We derive computable confidence intervals on the optimal value of such stochastic programs using the Robust Stochastic Approximation and the Stochastic Mirror Descent (SMD) algorithms. When the objective functions are uniformly convex, we also propose a multistep extension of the Stochastic Mirror Descent algorithm and obtain confidence intervals on both the optimal values and optimal solutions. Numerical simulations show that our confidence intervals are much less conservative and are q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6661","kind":"arxiv","version":6},"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-18T01:06:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rY07iAt2AkDAbFdFzakb1w7PVBbMvx1/05biHagNaHj6NmF1jF4yGAD6xgAQktrTEUvc+D88Q5XMdVacw9/SBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:38:39.273614Z"},"content_sha256":"833ce08f56dc0bf2b406ada918b0ed0f4532c10d5e51cb605ac94d311947683a","schema_version":"1.0","event_id":"sha256:833ce08f56dc0bf2b406ada918b0ed0f4532c10d5e51cb605ac94d311947683a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JKG4DQD7GGHALJKJHGQPLQRQXE/bundle.json","state_url":"https://pith.science/pith/JKG4DQD7GGHALJKJHGQPLQRQXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JKG4DQD7GGHALJKJHGQPLQRQXE/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-30T14:38:39Z","links":{"resolver":"https://pith.science/pith/JKG4DQD7GGHALJKJHGQPLQRQXE","bundle":"https://pith.science/pith/JKG4DQD7GGHALJKJHGQPLQRQXE/bundle.json","state":"https://pith.science/pith/JKG4DQD7GGHALJKJHGQPLQRQXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JKG4DQD7GGHALJKJHGQPLQRQXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JKG4DQD7GGHALJKJHGQPLQRQXE","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":"f32912552a882377c6679bff67fa0b09d5c4bb8f2923390071fae6337dffdd93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-24T17:37:43Z","title_canon_sha256":"17f649d075e14ac7a52fce74e4262444b113a6826dfa213f0a00f89d8486c1ce"},"schema_version":"1.0","source":{"id":"1407.6661","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6661","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6661v6","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6661","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"pith_short_12","alias_value":"JKG4DQD7GGHA","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JKG4DQD7GGHALJKJ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JKG4DQD7","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:833ce08f56dc0bf2b406ada918b0ed0f4532c10d5e51cb605ac94d311947683a","target":"graph","created_at":"2026-05-18T01:06:23Z","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 consider risk-averse convex stochastic programs expressed in terms of extended polyhedral risk measures. We derive computable confidence intervals on the optimal value of such stochastic programs using the Robust Stochastic Approximation and the Stochastic Mirror Descent (SMD) algorithms. When the objective functions are uniformly convex, we also propose a multistep extension of the Stochastic Mirror Descent algorithm and obtain confidence intervals on both the optimal values and optimal solutions. Numerical simulations show that our confidence intervals are much less conservative and are q","authors_text":"Vincent Guigues","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-24T17:37:43Z","title":"Multistep stochastic mirror descent for risk-averse convex stochastic programs based on extended polyhedral risk measures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6661","kind":"arxiv","version":6},"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:33e18b5af1dcfd6598107f4421e37c088f2ddd3010d48099f1d332d0d461cb85","target":"record","created_at":"2026-05-18T01:06:23Z","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":"f32912552a882377c6679bff67fa0b09d5c4bb8f2923390071fae6337dffdd93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-24T17:37:43Z","title_canon_sha256":"17f649d075e14ac7a52fce74e4262444b113a6826dfa213f0a00f89d8486c1ce"},"schema_version":"1.0","source":{"id":"1407.6661","kind":"arxiv","version":6}},"canonical_sha256":"4a8dc1c07f318e05a54939a0f5c230b92640bdb29ef2b51386eaf5ffd83bfa16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a8dc1c07f318e05a54939a0f5c230b92640bdb29ef2b51386eaf5ffd83bfa16","first_computed_at":"2026-05-18T01:06:23.153530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:23.153530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t31t5t0/2yMaxCc5krksDTNy05pabFsVROHzdwjmO5YgxlmS6CIoN/XsO0nkqUQp4pwvduDr5tm3Jaj6QLT8Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:23.154237Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.6661","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33e18b5af1dcfd6598107f4421e37c088f2ddd3010d48099f1d332d0d461cb85","sha256:833ce08f56dc0bf2b406ada918b0ed0f4532c10d5e51cb605ac94d311947683a"],"state_sha256":"4012d23753e6facf986e4d23500288414f111aaa327a2f609b38ed83f23ec511"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bNgi7IC+1DB5L7//oYTeEWxUigidr9X03KNWekvbSZCIUsnxFE8/yjVitnUzNXmaznNX1dwVavIACIOzLJEOBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:38:39.277091Z","bundle_sha256":"ac329c58f38903e4db996e29597aa6abdbab61400cad2ebd9eb2dd66a8d7fba1"}}