{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YODUSQ7DNYIA47LAJVAR4ES7IY","short_pith_number":"pith:YODUSQ7D","schema_version":"1.0","canonical_sha256":"c3874943e36e100e7d604d411e125f462c517b0dd5146b62205c3a1b819c100a","source":{"kind":"arxiv","id":"1810.00783","version":2},"attestation_state":"computed","paper":{"title":"Mean Field Control and Mean Field Game Models with Several Populations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alain Bensoussan, Mathieu Lauri\\`ere, Tao Huang","submitted_at":"2018-10-01T16:04:22Z","abstract_excerpt":"In this paper, we investigate the interaction of two populations with a large number of indistinguishable agents. The problem consists in two levels: the interaction between agents of a same population, and the interaction between the two populations. In the spirit of mean field type control (MFC) problems and mean field games (MFG), each population is approximated by a continuum of infinitesimal agents. We define four different problems in a general context and interpret them in the framework of MFC or MFG. By calculus of variations, we derive formally in each case the adjoint equations for t"},"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":"1810.00783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-01T16:04:22Z","cross_cats_sorted":[],"title_canon_sha256":"9ab7c1d1b99a2c080af2174b9a100d6948ba988fa47f80f16c4e44bffbe48e43","abstract_canon_sha256":"fb2e3e517809fa0dcf2b34c28cd2feb116834d5deafb7a484027bbbc16b446a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:08.983243Z","signature_b64":"nnUAbb5vaIT96atXC6H+SeJWEAX4sYZ0W3NQ4vP3b/7iOxAVEwB6UzYUpLsaoZaEzLmRy7qTeOapV1TjQlx4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3874943e36e100e7d604d411e125f462c517b0dd5146b62205c3a1b819c100a","last_reissued_at":"2026-05-18T00:02:08.982583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:08.982583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mean Field Control and Mean Field Game Models with Several Populations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alain Bensoussan, Mathieu Lauri\\`ere, Tao Huang","submitted_at":"2018-10-01T16:04:22Z","abstract_excerpt":"In this paper, we investigate the interaction of two populations with a large number of indistinguishable agents. The problem consists in two levels: the interaction between agents of a same population, and the interaction between the two populations. In the spirit of mean field type control (MFC) problems and mean field games (MFG), each population is approximated by a continuum of infinitesimal agents. We define four different problems in a general context and interpret them in the framework of MFC or MFG. By calculus of variations, we derive formally in each case the adjoint equations for t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00783","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":""},"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":"1810.00783","created_at":"2026-05-18T00:02:08.982698+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.00783v2","created_at":"2026-05-18T00:02:08.982698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00783","created_at":"2026-05-18T00:02:08.982698+00:00"},{"alias_kind":"pith_short_12","alias_value":"YODUSQ7DNYIA","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YODUSQ7DNYIA47LA","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YODUSQ7D","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.11632","citing_title":"Turnpike properties in linear quadratic Gaussian N-player differential games","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YODUSQ7DNYIA47LAJVAR4ES7IY","json":"https://pith.science/pith/YODUSQ7DNYIA47LAJVAR4ES7IY.json","graph_json":"https://pith.science/api/pith-number/YODUSQ7DNYIA47LAJVAR4ES7IY/graph.json","events_json":"https://pith.science/api/pith-number/YODUSQ7DNYIA47LAJVAR4ES7IY/events.json","paper":"https://pith.science/paper/YODUSQ7D"},"agent_actions":{"view_html":"https://pith.science/pith/YODUSQ7DNYIA47LAJVAR4ES7IY","download_json":"https://pith.science/pith/YODUSQ7DNYIA47LAJVAR4ES7IY.json","view_paper":"https://pith.science/paper/YODUSQ7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.00783&json=true","fetch_graph":"https://pith.science/api/pith-number/YODUSQ7DNYIA47LAJVAR4ES7IY/graph.json","fetch_events":"https://pith.science/api/pith-number/YODUSQ7DNYIA47LAJVAR4ES7IY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YODUSQ7DNYIA47LAJVAR4ES7IY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YODUSQ7DNYIA47LAJVAR4ES7IY/action/storage_attestation","attest_author":"https://pith.science/pith/YODUSQ7DNYIA47LAJVAR4ES7IY/action/author_attestation","sign_citation":"https://pith.science/pith/YODUSQ7DNYIA47LAJVAR4ES7IY/action/citation_signature","submit_replication":"https://pith.science/pith/YODUSQ7DNYIA47LAJVAR4ES7IY/action/replication_record"}},"created_at":"2026-05-18T00:02:08.982698+00:00","updated_at":"2026-05-18T00:02:08.982698+00:00"}