{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YHMVZMGE7JNXFO3EC4JPPVDZ6R","short_pith_number":"pith:YHMVZMGE","schema_version":"1.0","canonical_sha256":"c1d95cb0c4fa5b72bb641712f7d479f46e69b1dd08f79743704d94b466cc7cc1","source":{"kind":"arxiv","id":"1501.02024","version":1},"attestation_state":"computed","paper":{"title":"A Uniform-grid Discretization Algorithm for Stochastic Control with Risk Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marco Pavone, Yin-Lam Chow","submitted_at":"2015-01-09T03:07:08Z","abstract_excerpt":"In this paper, we present a discretization algorithm for finite horizon risk constrained dynamic programming algorithm in [Chow_Pavone_13]. Although in a theoretical standpoint, Bellman's recursion provides a systematic way to find optimal value functions and generate optimal history dependent policies, there is a serious computational issue. Even if the state space and action space of this constrained stochastic optimal control problem are finite, the spaces of risk threshold and the feasible risk update are closed bounded subset of real numbers. This prohibits any direct applications of unco"},"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":"1501.02024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-01-09T03:07:08Z","cross_cats_sorted":[],"title_canon_sha256":"02314a9276b05963f668498884c423b380469dbfa80165e8267a0325b84f42d2","abstract_canon_sha256":"ccdec2229cbfc65e64cda11bd5aa2412231ddd1a1347b830e7d323245b23fda4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:45.038283Z","signature_b64":"K0/HE4Xef49KcE2CZ/1xD7HEaxUMFnrXekZlcmoARN8THgXHkYZeRZF7R0ySrmLy2km9GZgKKDjzouPPnLOLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1d95cb0c4fa5b72bb641712f7d479f46e69b1dd08f79743704d94b466cc7cc1","last_reissued_at":"2026-05-18T02:29:45.037830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:45.037830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Uniform-grid Discretization Algorithm for Stochastic Control with Risk Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marco Pavone, Yin-Lam Chow","submitted_at":"2015-01-09T03:07:08Z","abstract_excerpt":"In this paper, we present a discretization algorithm for finite horizon risk constrained dynamic programming algorithm in [Chow_Pavone_13]. Although in a theoretical standpoint, Bellman's recursion provides a systematic way to find optimal value functions and generate optimal history dependent policies, there is a serious computational issue. Even if the state space and action space of this constrained stochastic optimal control problem are finite, the spaces of risk threshold and the feasible risk update are closed bounded subset of real numbers. This prohibits any direct applications of unco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02024","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":""},"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":"1501.02024","created_at":"2026-05-18T02:29:45.037903+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.02024v1","created_at":"2026-05-18T02:29:45.037903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02024","created_at":"2026-05-18T02:29:45.037903+00:00"},{"alias_kind":"pith_short_12","alias_value":"YHMVZMGE7JNX","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YHMVZMGE7JNXFO3E","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YHMVZMGE","created_at":"2026-05-18T12:29:50.041715+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/YHMVZMGE7JNXFO3EC4JPPVDZ6R","json":"https://pith.science/pith/YHMVZMGE7JNXFO3EC4JPPVDZ6R.json","graph_json":"https://pith.science/api/pith-number/YHMVZMGE7JNXFO3EC4JPPVDZ6R/graph.json","events_json":"https://pith.science/api/pith-number/YHMVZMGE7JNXFO3EC4JPPVDZ6R/events.json","paper":"https://pith.science/paper/YHMVZMGE"},"agent_actions":{"view_html":"https://pith.science/pith/YHMVZMGE7JNXFO3EC4JPPVDZ6R","download_json":"https://pith.science/pith/YHMVZMGE7JNXFO3EC4JPPVDZ6R.json","view_paper":"https://pith.science/paper/YHMVZMGE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.02024&json=true","fetch_graph":"https://pith.science/api/pith-number/YHMVZMGE7JNXFO3EC4JPPVDZ6R/graph.json","fetch_events":"https://pith.science/api/pith-number/YHMVZMGE7JNXFO3EC4JPPVDZ6R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YHMVZMGE7JNXFO3EC4JPPVDZ6R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YHMVZMGE7JNXFO3EC4JPPVDZ6R/action/storage_attestation","attest_author":"https://pith.science/pith/YHMVZMGE7JNXFO3EC4JPPVDZ6R/action/author_attestation","sign_citation":"https://pith.science/pith/YHMVZMGE7JNXFO3EC4JPPVDZ6R/action/citation_signature","submit_replication":"https://pith.science/pith/YHMVZMGE7JNXFO3EC4JPPVDZ6R/action/replication_record"}},"created_at":"2026-05-18T02:29:45.037903+00:00","updated_at":"2026-05-18T02:29:45.037903+00:00"}