{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4MSWA5RXAWW7GNSNOGSHZY6TZP","short_pith_number":"pith:4MSWA5RX","schema_version":"1.0","canonical_sha256":"e32560763705adf3364d71a47ce3d3cbcdd6a7f7e50d3f85bbe0ef9700be3a20","source":{"kind":"arxiv","id":"1703.10001","version":1},"attestation_state":"computed","paper":{"title":"Numerical Methods for Mean-Field-Type Optimal Control Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Laurent Pfeiffer","submitted_at":"2017-03-29T12:36:37Z","abstract_excerpt":"In this article, two methods for solving mean-field type optimal control problems are proposed and investigated. The two methods are iterative methods: at each iteration, a Hamilton-Jacobi-Bellman equation is solved, for a terminal condition obtained by linearizing the cost function. The terminal condition is updated by solving a Fokker-Planck equation. The first method can be seen as a gradient method and uses in an essential manner the convexity of the set of probability distributions. A convergence result for this method is provided. The second method incorporates a penalization term and pr"},"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":"1703.10001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-29T12:36:37Z","cross_cats_sorted":[],"title_canon_sha256":"aff47fa75b0acc1dd6b7f4449d93c09f43e0c1aba223b00d2c986350dc79e382","abstract_canon_sha256":"9d3318ec229d398cac8b22890cab76859cdd7658f0023da0d27b294147871194"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:38.847082Z","signature_b64":"MoRQhsSZcyCyVZw1hdO83MwCoyL5UrUBceL/fkCrO+rayPj2ma8gpufkffElh3lfHwfvlZxUvrmt0/xI8RNyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e32560763705adf3364d71a47ce3d3cbcdd6a7f7e50d3f85bbe0ef9700be3a20","last_reissued_at":"2026-05-18T00:47:38.846631Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:38.846631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Numerical Methods for Mean-Field-Type Optimal Control Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Laurent Pfeiffer","submitted_at":"2017-03-29T12:36:37Z","abstract_excerpt":"In this article, two methods for solving mean-field type optimal control problems are proposed and investigated. The two methods are iterative methods: at each iteration, a Hamilton-Jacobi-Bellman equation is solved, for a terminal condition obtained by linearizing the cost function. The terminal condition is updated by solving a Fokker-Planck equation. The first method can be seen as a gradient method and uses in an essential manner the convexity of the set of probability distributions. A convergence result for this method is provided. The second method incorporates a penalization term and pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10001","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":"1703.10001","created_at":"2026-05-18T00:47:38.846701+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.10001v1","created_at":"2026-05-18T00:47:38.846701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10001","created_at":"2026-05-18T00:47:38.846701+00:00"},{"alias_kind":"pith_short_12","alias_value":"4MSWA5RXAWW7","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4MSWA5RXAWW7GNSN","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4MSWA5RX","created_at":"2026-05-18T12:31:00.734936+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/4MSWA5RXAWW7GNSNOGSHZY6TZP","json":"https://pith.science/pith/4MSWA5RXAWW7GNSNOGSHZY6TZP.json","graph_json":"https://pith.science/api/pith-number/4MSWA5RXAWW7GNSNOGSHZY6TZP/graph.json","events_json":"https://pith.science/api/pith-number/4MSWA5RXAWW7GNSNOGSHZY6TZP/events.json","paper":"https://pith.science/paper/4MSWA5RX"},"agent_actions":{"view_html":"https://pith.science/pith/4MSWA5RXAWW7GNSNOGSHZY6TZP","download_json":"https://pith.science/pith/4MSWA5RXAWW7GNSNOGSHZY6TZP.json","view_paper":"https://pith.science/paper/4MSWA5RX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.10001&json=true","fetch_graph":"https://pith.science/api/pith-number/4MSWA5RXAWW7GNSNOGSHZY6TZP/graph.json","fetch_events":"https://pith.science/api/pith-number/4MSWA5RXAWW7GNSNOGSHZY6TZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4MSWA5RXAWW7GNSNOGSHZY6TZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4MSWA5RXAWW7GNSNOGSHZY6TZP/action/storage_attestation","attest_author":"https://pith.science/pith/4MSWA5RXAWW7GNSNOGSHZY6TZP/action/author_attestation","sign_citation":"https://pith.science/pith/4MSWA5RXAWW7GNSNOGSHZY6TZP/action/citation_signature","submit_replication":"https://pith.science/pith/4MSWA5RXAWW7GNSNOGSHZY6TZP/action/replication_record"}},"created_at":"2026-05-18T00:47:38.846701+00:00","updated_at":"2026-05-18T00:47:38.846701+00:00"}