{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XJZ4THUEZ2YMPQ2YVX6YDXFWFX","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":"c7518e25f0e0d0fbc5471cacc5375026dbbc2a272d6f47db3ac19ae781ecfb1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-03T12:37:10Z","title_canon_sha256":"c79fc51d05bfa962aa09fd0379b7c269912e35a240921b15c816765fb7047d42"},"schema_version":"1.0","source":{"id":"1611.00980","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00980","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00980v2","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00980","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"pith_short_12","alias_value":"XJZ4THUEZ2YM","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XJZ4THUEZ2YMPQ2Y","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XJZ4THUE","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:eac735d1981ae0c82a99f7ea9f397a5ec7be7e4746d0588756a08199640a0abd","target":"graph","created_at":"2026-05-18T01:00:05Z","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":"In this paper, probabilistic guarantees for constraint sampling of multistage robust convex optimization problems are derived. The dynamic nature of these problems is tackled via the so-called scenario-with-certificates approach. This allows to avoid the conservative use of explicit parametrizations through decision rules, and provides a significant reduction of the sample complexity to satisfy a given level of reliability. An explicit bound on the probability of violation is also given. Numerical results dealing with a multistage inventory management problem show the efficacy of the proposed ","authors_text":"Fabrizio Dabbene, Francesca Maggioni, Marida Bertocchi, Roberto Tempo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-03T12:37:10Z","title":"Sampling methods for multistage robust convex optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00980","kind":"arxiv","version":2},"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:357988a63d1627b36c049b61748e20e831f6ecc69544a8e16c35eccbc4380517","target":"record","created_at":"2026-05-18T01:00:05Z","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":"c7518e25f0e0d0fbc5471cacc5375026dbbc2a272d6f47db3ac19ae781ecfb1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-03T12:37:10Z","title_canon_sha256":"c79fc51d05bfa962aa09fd0379b7c269912e35a240921b15c816765fb7047d42"},"schema_version":"1.0","source":{"id":"1611.00980","kind":"arxiv","version":2}},"canonical_sha256":"ba73c99e84ceb0c7c358adfd81dcb62df71c44fe2cc4b76b9c679afd8db2289e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba73c99e84ceb0c7c358adfd81dcb62df71c44fe2cc4b76b9c679afd8db2289e","first_computed_at":"2026-05-18T01:00:05.150170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:05.150170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"It5xEEePfHun/vNlvFeCtacjqqdDtv+ZXqEl5EQVlqriTCx6bFcK0DH+F8NmY/sEv/ygd8Fli7yyZ4BR1lUbAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:05.150624Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00980","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:357988a63d1627b36c049b61748e20e831f6ecc69544a8e16c35eccbc4380517","sha256:eac735d1981ae0c82a99f7ea9f397a5ec7be7e4746d0588756a08199640a0abd"],"state_sha256":"63d723480a8501e1f3c9e7cd15abb5c02d2fe8dae29ea263d17732a8aaae772c"}