{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XJZ4THUEZ2YMPQ2YVX6YDXFWFX","short_pith_number":"pith:XJZ4THUE","schema_version":"1.0","canonical_sha256":"ba73c99e84ceb0c7c358adfd81dcb62df71c44fe2cc4b76b9c679afd8db2289e","source":{"kind":"arxiv","id":"1611.00980","version":2},"attestation_state":"computed","paper":{"title":"Sampling methods for multistage robust convex optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fabrizio Dabbene, Francesca Maggioni, Marida Bertocchi, Roberto Tempo","submitted_at":"2016-11-03T12:37:10Z","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1611.00980","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-03T12:37:10Z","cross_cats_sorted":[],"title_canon_sha256":"c79fc51d05bfa962aa09fd0379b7c269912e35a240921b15c816765fb7047d42","abstract_canon_sha256":"c7518e25f0e0d0fbc5471cacc5375026dbbc2a272d6f47db3ac19ae781ecfb1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:05.150624Z","signature_b64":"It5xEEePfHun/vNlvFeCtacjqqdDtv+ZXqEl5EQVlqriTCx6bFcK0DH+F8NmY/sEv/ygd8Fli7yyZ4BR1lUbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba73c99e84ceb0c7c358adfd81dcb62df71c44fe2cc4b76b9c679afd8db2289e","last_reissued_at":"2026-05-18T01:00:05.150170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:05.150170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sampling methods for multistage robust convex optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fabrizio Dabbene, Francesca Maggioni, Marida Bertocchi, Roberto Tempo","submitted_at":"2016-11-03T12:37:10Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00980","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.00980","created_at":"2026-05-18T01:00:05.150236+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00980v2","created_at":"2026-05-18T01:00:05.150236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00980","created_at":"2026-05-18T01:00:05.150236+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJZ4THUEZ2YM","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJZ4THUEZ2YMPQ2Y","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJZ4THUE","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XJZ4THUEZ2YMPQ2YVX6YDXFWFX","json":"https://pith.science/pith/XJZ4THUEZ2YMPQ2YVX6YDXFWFX.json","graph_json":"https://pith.science/api/pith-number/XJZ4THUEZ2YMPQ2YVX6YDXFWFX/graph.json","events_json":"https://pith.science/api/pith-number/XJZ4THUEZ2YMPQ2YVX6YDXFWFX/events.json","paper":"https://pith.science/paper/XJZ4THUE"},"agent_actions":{"view_html":"https://pith.science/pith/XJZ4THUEZ2YMPQ2YVX6YDXFWFX","download_json":"https://pith.science/pith/XJZ4THUEZ2YMPQ2YVX6YDXFWFX.json","view_paper":"https://pith.science/paper/XJZ4THUE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00980&json=true","fetch_graph":"https://pith.science/api/pith-number/XJZ4THUEZ2YMPQ2YVX6YDXFWFX/graph.json","fetch_events":"https://pith.science/api/pith-number/XJZ4THUEZ2YMPQ2YVX6YDXFWFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJZ4THUEZ2YMPQ2YVX6YDXFWFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJZ4THUEZ2YMPQ2YVX6YDXFWFX/action/storage_attestation","attest_author":"https://pith.science/pith/XJZ4THUEZ2YMPQ2YVX6YDXFWFX/action/author_attestation","sign_citation":"https://pith.science/pith/XJZ4THUEZ2YMPQ2YVX6YDXFWFX/action/citation_signature","submit_replication":"https://pith.science/pith/XJZ4THUEZ2YMPQ2YVX6YDXFWFX/action/replication_record"}},"created_at":"2026-05-18T01:00:05.150236+00:00","updated_at":"2026-05-18T01:00:05.150236+00:00"}