{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3MAKKLADJ3TII6UWIEKVY6IX6W","short_pith_number":"pith:3MAKKLAD","schema_version":"1.0","canonical_sha256":"db00a52c034ee6847a9641155c7917f58b8e2e6712209adda772e45754723211","source":{"kind":"arxiv","id":"2401.01198","version":2},"attestation_state":"computed","paper":{"title":"Mirror Descent for Stochastic Control Problems with Measure-valued Controls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.PR"],"primary_cat":"math.OC","authors_text":"Bekzhan Kerimkulov, David \\v{S}i\\v{s}ka, {\\L}ukasz Szpruch, Yufei Zhang","submitted_at":"2024-01-02T13:02:36Z","abstract_excerpt":"This paper studies the convergence of the mirror descent algorithm for finite horizon stochastic control problems with measure-valued control processes. The control objective involves a convex regularisation function, denoted as $h$, with regularisation strength determined by the weight $\\tau\\ge 0$. The setting covers regularised relaxed control problems. Under suitable conditions, we establish the relative smoothness and convexity of the control objective with respect to the Bregman divergence of $h$, and prove linear convergence of the algorithm for $\\tau=0$ and exponential convergence for $"},"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":"2401.01198","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-01-02T13:02:36Z","cross_cats_sorted":["cs.NA","math.NA","math.PR"],"title_canon_sha256":"c98a9b6afb68af1165ad1ed8c630ca21c0ca9af6718d96c8e9b9858ae4b381af","abstract_canon_sha256":"7ba7ce736d7c864039dadbe378c58f41797f11bf7f71d8810a7f8ef1eb5e042a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:47.786158Z","signature_b64":"Oc2oOR6unkzC3A9OCIADZKurTowfJbNGyt+0yjbL8TVkbFc6dgsAh+ilpNN84Qa/h+Jghx4EFumstEQzW2YbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db00a52c034ee6847a9641155c7917f58b8e2e6712209adda772e45754723211","last_reissued_at":"2026-07-05T11:56:47.785679Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:47.785679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mirror Descent for Stochastic Control Problems with Measure-valued Controls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.PR"],"primary_cat":"math.OC","authors_text":"Bekzhan Kerimkulov, David \\v{S}i\\v{s}ka, {\\L}ukasz Szpruch, Yufei Zhang","submitted_at":"2024-01-02T13:02:36Z","abstract_excerpt":"This paper studies the convergence of the mirror descent algorithm for finite horizon stochastic control problems with measure-valued control processes. The control objective involves a convex regularisation function, denoted as $h$, with regularisation strength determined by the weight $\\tau\\ge 0$. The setting covers regularised relaxed control problems. Under suitable conditions, we establish the relative smoothness and convexity of the control objective with respect to the Bregman divergence of $h$, and prove linear convergence of the algorithm for $\\tau=0$ and exponential convergence for $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.01198","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/2401.01198/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":"2401.01198","created_at":"2026-07-05T11:56:47.785736+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.01198v2","created_at":"2026-07-05T11:56:47.785736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.01198","created_at":"2026-07-05T11:56:47.785736+00:00"},{"alias_kind":"pith_short_12","alias_value":"3MAKKLADJ3TI","created_at":"2026-07-05T11:56:47.785736+00:00"},{"alias_kind":"pith_short_16","alias_value":"3MAKKLADJ3TII6UW","created_at":"2026-07-05T11:56:47.785736+00:00"},{"alias_kind":"pith_short_8","alias_value":"3MAKKLAD","created_at":"2026-07-05T11:56:47.785736+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2402.08106","citing_title":"Mirror Descent-Ascent for mean-field min-max problems","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3MAKKLADJ3TII6UWIEKVY6IX6W","json":"https://pith.science/pith/3MAKKLADJ3TII6UWIEKVY6IX6W.json","graph_json":"https://pith.science/api/pith-number/3MAKKLADJ3TII6UWIEKVY6IX6W/graph.json","events_json":"https://pith.science/api/pith-number/3MAKKLADJ3TII6UWIEKVY6IX6W/events.json","paper":"https://pith.science/paper/3MAKKLAD"},"agent_actions":{"view_html":"https://pith.science/pith/3MAKKLADJ3TII6UWIEKVY6IX6W","download_json":"https://pith.science/pith/3MAKKLADJ3TII6UWIEKVY6IX6W.json","view_paper":"https://pith.science/paper/3MAKKLAD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.01198&json=true","fetch_graph":"https://pith.science/api/pith-number/3MAKKLADJ3TII6UWIEKVY6IX6W/graph.json","fetch_events":"https://pith.science/api/pith-number/3MAKKLADJ3TII6UWIEKVY6IX6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3MAKKLADJ3TII6UWIEKVY6IX6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3MAKKLADJ3TII6UWIEKVY6IX6W/action/storage_attestation","attest_author":"https://pith.science/pith/3MAKKLADJ3TII6UWIEKVY6IX6W/action/author_attestation","sign_citation":"https://pith.science/pith/3MAKKLADJ3TII6UWIEKVY6IX6W/action/citation_signature","submit_replication":"https://pith.science/pith/3MAKKLADJ3TII6UWIEKVY6IX6W/action/replication_record"}},"created_at":"2026-07-05T11:56:47.785736+00:00","updated_at":"2026-07-05T11:56:47.785736+00:00"}