{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LCNBTTPFNYKO7HQTYL4WCRXFKC","short_pith_number":"pith:LCNBTTPF","schema_version":"1.0","canonical_sha256":"589a19cde56e14ef9e13c2f96146e550b72733b6c5ca407071ad9821f7b984a5","source":{"kind":"arxiv","id":"2404.05230","version":2},"attestation_state":"computed","paper":{"title":"Non-concave stochastic optimal control in finite discrete time under model uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","q-fin.MF"],"primary_cat":"math.OC","authors_text":"Ariel Neufeld, Julian Sester","submitted_at":"2024-04-08T06:53:05Z","abstract_excerpt":"In this article we present a general framework for non-concave robust stochastic control problems under model uncertainty in a discrete time finite horizon setting. Our framework allows to consider a variety of different path-dependent ambiguity sets of probability measures comprising, as a natural example, the ambiguity set defined via Wasserstein-balls around path-dependent reference measures with path-dependent radii, as well as parametric classes of probability distributions. We establish a dynamic programming principle which allows to derive both optimal control and worst-case measure by "},"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":"2404.05230","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-08T06:53:05Z","cross_cats_sorted":["math.PR","q-fin.MF"],"title_canon_sha256":"7c6f3a2301481a3b6b1bde92f03fb831cdf95757982444c185d7de83328c76c9","abstract_canon_sha256":"45bf3444f53b738838622c154a45480a6fd25898b3ee54debb3f96c4ca5a2d83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:15.743270Z","signature_b64":"CsI9wxSK1i/d+ZDpkMN2pDRgxhNoMWZ7ABB//dtykPdZEycZX2Gcj8RmYKLi+6NWGJjt6rM3araE83vnmXk6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"589a19cde56e14ef9e13c2f96146e550b72733b6c5ca407071ad9821f7b984a5","last_reissued_at":"2026-07-05T10:58:15.742717Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:15.742717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-concave stochastic optimal control in finite discrete time under model uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","q-fin.MF"],"primary_cat":"math.OC","authors_text":"Ariel Neufeld, Julian Sester","submitted_at":"2024-04-08T06:53:05Z","abstract_excerpt":"In this article we present a general framework for non-concave robust stochastic control problems under model uncertainty in a discrete time finite horizon setting. Our framework allows to consider a variety of different path-dependent ambiguity sets of probability measures comprising, as a natural example, the ambiguity set defined via Wasserstein-balls around path-dependent reference measures with path-dependent radii, as well as parametric classes of probability distributions. We establish a dynamic programming principle which allows to derive both optimal control and worst-case measure by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.05230","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.05230/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":"2404.05230","created_at":"2026-07-05T10:58:15.742787+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.05230v2","created_at":"2026-07-05T10:58:15.742787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.05230","created_at":"2026-07-05T10:58:15.742787+00:00"},{"alias_kind":"pith_short_12","alias_value":"LCNBTTPFNYKO","created_at":"2026-07-05T10:58:15.742787+00:00"},{"alias_kind":"pith_short_16","alias_value":"LCNBTTPFNYKO7HQT","created_at":"2026-07-05T10:58:15.742787+00:00"},{"alias_kind":"pith_short_8","alias_value":"LCNBTTPF","created_at":"2026-07-05T10:58:15.742787+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.19058","citing_title":"Distributionally Robust Deep Q-Learning","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LCNBTTPFNYKO7HQTYL4WCRXFKC","json":"https://pith.science/pith/LCNBTTPFNYKO7HQTYL4WCRXFKC.json","graph_json":"https://pith.science/api/pith-number/LCNBTTPFNYKO7HQTYL4WCRXFKC/graph.json","events_json":"https://pith.science/api/pith-number/LCNBTTPFNYKO7HQTYL4WCRXFKC/events.json","paper":"https://pith.science/paper/LCNBTTPF"},"agent_actions":{"view_html":"https://pith.science/pith/LCNBTTPFNYKO7HQTYL4WCRXFKC","download_json":"https://pith.science/pith/LCNBTTPFNYKO7HQTYL4WCRXFKC.json","view_paper":"https://pith.science/paper/LCNBTTPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.05230&json=true","fetch_graph":"https://pith.science/api/pith-number/LCNBTTPFNYKO7HQTYL4WCRXFKC/graph.json","fetch_events":"https://pith.science/api/pith-number/LCNBTTPFNYKO7HQTYL4WCRXFKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LCNBTTPFNYKO7HQTYL4WCRXFKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LCNBTTPFNYKO7HQTYL4WCRXFKC/action/storage_attestation","attest_author":"https://pith.science/pith/LCNBTTPFNYKO7HQTYL4WCRXFKC/action/author_attestation","sign_citation":"https://pith.science/pith/LCNBTTPFNYKO7HQTYL4WCRXFKC/action/citation_signature","submit_replication":"https://pith.science/pith/LCNBTTPFNYKO7HQTYL4WCRXFKC/action/replication_record"}},"created_at":"2026-07-05T10:58:15.742787+00:00","updated_at":"2026-07-05T10:58:15.742787+00:00"}