{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CZ2S5PPH6HVZKS5XIRZ4PJ7GOA","short_pith_number":"pith:CZ2S5PPH","schema_version":"1.0","canonical_sha256":"16752ebde7f1eb954bb74473c7a7e67014563750a24390808d9247d91a45c31f","source":{"kind":"arxiv","id":"2412.19299","version":1},"attestation_state":"computed","paper":{"title":"Sample Complexity of Data-driven Multistage Stochastic Programming under Markovian Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Grani A. Hanasusanto, Hyuk Park","submitted_at":"2024-12-26T17:46:27Z","abstract_excerpt":"This work is motivated by the challenges of applying the sample average approximation (SAA) method to multistage stochastic programming with an unknown continuous-state Markov process. While SAA is widely used in static and two-stage stochastic optimization, it becomes computationally intractable in general multistage settings as the time horizon $T$ increases. Indeed, the number of samples required to obtain a reasonably accurate solution grows exponentially$\\text{ -- }$a phenomenon known as the curse of dimensionality with respect to the time horizon. To overcome this limitation, we propose "},"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":"2412.19299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-26T17:46:27Z","cross_cats_sorted":[],"title_canon_sha256":"a496706d2bc430aea55d45df9d162d9cda5a9edc1944394df9eb51e7a7371e22","abstract_canon_sha256":"3531f387f63cb3a2eaa14007cde678c85ced345bcae798ed469d7a7466b7bf50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:33.631522Z","signature_b64":"hP/KZfwIRbe9NmxEMEpyND01+aSSoGuOtl7ENh8DIFt6GGMK7fhUMRqzAmmFxRT9+glFLAWAol67iCvOapLmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16752ebde7f1eb954bb74473c7a7e67014563750a24390808d9247d91a45c31f","last_reissued_at":"2026-07-05T09:54:33.631091Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:33.631091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sample Complexity of Data-driven Multistage Stochastic Programming under Markovian Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Grani A. Hanasusanto, Hyuk Park","submitted_at":"2024-12-26T17:46:27Z","abstract_excerpt":"This work is motivated by the challenges of applying the sample average approximation (SAA) method to multistage stochastic programming with an unknown continuous-state Markov process. While SAA is widely used in static and two-stage stochastic optimization, it becomes computationally intractable in general multistage settings as the time horizon $T$ increases. Indeed, the number of samples required to obtain a reasonably accurate solution grows exponentially$\\text{ -- }$a phenomenon known as the curse of dimensionality with respect to the time horizon. To overcome this limitation, we propose "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.19299","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.19299/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.19299","created_at":"2026-07-05T09:54:33.631146+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.19299v1","created_at":"2026-07-05T09:54:33.631146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.19299","created_at":"2026-07-05T09:54:33.631146+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZ2S5PPH6HVZ","created_at":"2026-07-05T09:54:33.631146+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZ2S5PPH6HVZKS5X","created_at":"2026-07-05T09:54:33.631146+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZ2S5PPH","created_at":"2026-07-05T09:54:33.631146+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/CZ2S5PPH6HVZKS5XIRZ4PJ7GOA","json":"https://pith.science/pith/CZ2S5PPH6HVZKS5XIRZ4PJ7GOA.json","graph_json":"https://pith.science/api/pith-number/CZ2S5PPH6HVZKS5XIRZ4PJ7GOA/graph.json","events_json":"https://pith.science/api/pith-number/CZ2S5PPH6HVZKS5XIRZ4PJ7GOA/events.json","paper":"https://pith.science/paper/CZ2S5PPH"},"agent_actions":{"view_html":"https://pith.science/pith/CZ2S5PPH6HVZKS5XIRZ4PJ7GOA","download_json":"https://pith.science/pith/CZ2S5PPH6HVZKS5XIRZ4PJ7GOA.json","view_paper":"https://pith.science/paper/CZ2S5PPH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.19299&json=true","fetch_graph":"https://pith.science/api/pith-number/CZ2S5PPH6HVZKS5XIRZ4PJ7GOA/graph.json","fetch_events":"https://pith.science/api/pith-number/CZ2S5PPH6HVZKS5XIRZ4PJ7GOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZ2S5PPH6HVZKS5XIRZ4PJ7GOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZ2S5PPH6HVZKS5XIRZ4PJ7GOA/action/storage_attestation","attest_author":"https://pith.science/pith/CZ2S5PPH6HVZKS5XIRZ4PJ7GOA/action/author_attestation","sign_citation":"https://pith.science/pith/CZ2S5PPH6HVZKS5XIRZ4PJ7GOA/action/citation_signature","submit_replication":"https://pith.science/pith/CZ2S5PPH6HVZKS5XIRZ4PJ7GOA/action/replication_record"}},"created_at":"2026-07-05T09:54:33.631146+00:00","updated_at":"2026-07-05T09:54:33.631146+00:00"}