{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RDQBUJC5F5WCBDLLA26PNWRW5X","short_pith_number":"pith:RDQBUJC5","schema_version":"1.0","canonical_sha256":"88e01a245d2f6c208d6b06bcf6da36ede34bce44d1a903fa7011dd8594ecf102","source":{"kind":"arxiv","id":"2306.04788","version":2},"attestation_state":"computed","paper":{"title":"Deep Learning for Population-Dependent Controls in Mean Field Control Problems with Common Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gokce Dayanikli, Jiacheng Zhang, Mathieu Lauriere","submitted_at":"2023-06-07T21:20:00Z","abstract_excerpt":"In this paper, we propose several approaches to learn the optimal population-dependent controls in order to solve mean field control problems (MFC). Such policies enable us to solve MFC problems with forms of common noises at a level of generality that was not covered by existing methods. We analyze rigorously the theoretical convergence of the proposed approximation algorithms. Of particular interest for its simplicity of implementation is the $N$-particle approximation. The effectiveness and the flexibility of our algorithms is supported by numerical experiments comparing several combination"},"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":"2306.04788","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-06-07T21:20:00Z","cross_cats_sorted":[],"title_canon_sha256":"10ac4dfd54329f569e877afad93655b47a156eddbf39e13e9bdb8bd948d69b3c","abstract_canon_sha256":"5be8873c902380ac7b24ccdb1f333ce69a82aeea5029f92613d080e007e88868"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:14:13.435207Z","signature_b64":"2zpclf85W4mQnlHSYj0W5nOm9QQev7NgjjLl3Zlq0kTblCrno/AtUzHMmxSaswH8Rna2vE2Wq81brAaAYuNvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88e01a245d2f6c208d6b06bcf6da36ede34bce44d1a903fa7011dd8594ecf102","last_reissued_at":"2026-07-05T07:14:13.434750Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:14:13.434750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Learning for Population-Dependent Controls in Mean Field Control Problems with Common Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gokce Dayanikli, Jiacheng Zhang, Mathieu Lauriere","submitted_at":"2023-06-07T21:20:00Z","abstract_excerpt":"In this paper, we propose several approaches to learn the optimal population-dependent controls in order to solve mean field control problems (MFC). Such policies enable us to solve MFC problems with forms of common noises at a level of generality that was not covered by existing methods. We analyze rigorously the theoretical convergence of the proposed approximation algorithms. Of particular interest for its simplicity of implementation is the $N$-particle approximation. The effectiveness and the flexibility of our algorithms is supported by numerical experiments comparing several combination"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.04788","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/2306.04788/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":"2306.04788","created_at":"2026-07-05T07:14:13.434809+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.04788v2","created_at":"2026-07-05T07:14:13.434809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.04788","created_at":"2026-07-05T07:14:13.434809+00:00"},{"alias_kind":"pith_short_12","alias_value":"RDQBUJC5F5WC","created_at":"2026-07-05T07:14:13.434809+00:00"},{"alias_kind":"pith_short_16","alias_value":"RDQBUJC5F5WCBDLL","created_at":"2026-07-05T07:14:13.434809+00:00"},{"alias_kind":"pith_short_8","alias_value":"RDQBUJC5","created_at":"2026-07-05T07:14:13.434809+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27181","citing_title":"Numerical Approximation for Path-Dependent McKean-Vlasov Control with Non-Asymptotic Error Estimates","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09055","citing_title":"Particle Methods with Deep Learning for Stochastic Control under Partial Observation","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RDQBUJC5F5WCBDLLA26PNWRW5X","json":"https://pith.science/pith/RDQBUJC5F5WCBDLLA26PNWRW5X.json","graph_json":"https://pith.science/api/pith-number/RDQBUJC5F5WCBDLLA26PNWRW5X/graph.json","events_json":"https://pith.science/api/pith-number/RDQBUJC5F5WCBDLLA26PNWRW5X/events.json","paper":"https://pith.science/paper/RDQBUJC5"},"agent_actions":{"view_html":"https://pith.science/pith/RDQBUJC5F5WCBDLLA26PNWRW5X","download_json":"https://pith.science/pith/RDQBUJC5F5WCBDLLA26PNWRW5X.json","view_paper":"https://pith.science/paper/RDQBUJC5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.04788&json=true","fetch_graph":"https://pith.science/api/pith-number/RDQBUJC5F5WCBDLLA26PNWRW5X/graph.json","fetch_events":"https://pith.science/api/pith-number/RDQBUJC5F5WCBDLLA26PNWRW5X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RDQBUJC5F5WCBDLLA26PNWRW5X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RDQBUJC5F5WCBDLLA26PNWRW5X/action/storage_attestation","attest_author":"https://pith.science/pith/RDQBUJC5F5WCBDLLA26PNWRW5X/action/author_attestation","sign_citation":"https://pith.science/pith/RDQBUJC5F5WCBDLLA26PNWRW5X/action/citation_signature","submit_replication":"https://pith.science/pith/RDQBUJC5F5WCBDLLA26PNWRW5X/action/replication_record"}},"created_at":"2026-07-05T07:14:13.434809+00:00","updated_at":"2026-07-05T07:14:13.434809+00:00"}