{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AO25F7FMJ3G27MVY7P2HYMOLO2","short_pith_number":"pith:AO25F7FM","schema_version":"1.0","canonical_sha256":"03b5d2fcac4ecdafb2b8fbf47c31cb76b55563c9b954ca916d193847c6b4f5d9","source":{"kind":"arxiv","id":"2106.06231","version":1},"attestation_state":"computed","paper":{"title":"Numerical Methods for Mean Field Games and Mean Field Type Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Mathieu Lauriere","submitted_at":"2021-06-11T08:29:34Z","abstract_excerpt":"Mean Field Games (MFG) have been introduced to tackle games with a large number of competing players. Considering the limit when the number of players is infinite, Nash equilibria are studied by considering the interaction of a typical player with the population's distribution. The situation in which the players cooperate corresponds to Mean Field Control (MFC) problems, which can also be viewed as optimal control problems driven by a McKean-Vlasov dynamics. These two types of problems have found a wide range of potential applications, for which numerical methods play a key role since most mod"},"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":"2106.06231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-06-11T08:29:34Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"5f4c4768f3bab988b0f8a17a9bcdfe10252ed8f1d620466742b2f46bb045ada8","abstract_canon_sha256":"1e8e7b1f71cd4a3453e384f0b773d07f4aedb3d37c52df42336203c1df74e9c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:48:27.589646Z","signature_b64":"kLUUbdgGqoNcEOnJ0C0CxQtpPnxYIwLuY0KM4NaCCM1WPoRiLwXrvxr5mSbIcjyUXizieeEFvBScPokxd4eOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03b5d2fcac4ecdafb2b8fbf47c31cb76b55563c9b954ca916d193847c6b4f5d9","last_reissued_at":"2026-07-05T02:48:27.589223Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:48:27.589223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Numerical Methods for Mean Field Games and Mean Field Type Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Mathieu Lauriere","submitted_at":"2021-06-11T08:29:34Z","abstract_excerpt":"Mean Field Games (MFG) have been introduced to tackle games with a large number of competing players. Considering the limit when the number of players is infinite, Nash equilibria are studied by considering the interaction of a typical player with the population's distribution. The situation in which the players cooperate corresponds to Mean Field Control (MFC) problems, which can also be viewed as optimal control problems driven by a McKean-Vlasov dynamics. These two types of problems have found a wide range of potential applications, for which numerical methods play a key role since most mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.06231","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.06231/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":"2106.06231","created_at":"2026-07-05T02:48:27.589283+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.06231v1","created_at":"2026-07-05T02:48:27.589283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.06231","created_at":"2026-07-05T02:48:27.589283+00:00"},{"alias_kind":"pith_short_12","alias_value":"AO25F7FMJ3G2","created_at":"2026-07-05T02:48:27.589283+00:00"},{"alias_kind":"pith_short_16","alias_value":"AO25F7FMJ3G27MVY","created_at":"2026-07-05T02:48:27.589283+00:00"},{"alias_kind":"pith_short_8","alias_value":"AO25F7FM","created_at":"2026-07-05T02:48:27.589283+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00714","citing_title":"Self-conditioned Flow Map Language Models via Fixed-point Flows","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2606.23155","citing_title":"Neural Parameter Calibration for Finite-State Mean Field Games","ref_index":50,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AO25F7FMJ3G27MVY7P2HYMOLO2","json":"https://pith.science/pith/AO25F7FMJ3G27MVY7P2HYMOLO2.json","graph_json":"https://pith.science/api/pith-number/AO25F7FMJ3G27MVY7P2HYMOLO2/graph.json","events_json":"https://pith.science/api/pith-number/AO25F7FMJ3G27MVY7P2HYMOLO2/events.json","paper":"https://pith.science/paper/AO25F7FM"},"agent_actions":{"view_html":"https://pith.science/pith/AO25F7FMJ3G27MVY7P2HYMOLO2","download_json":"https://pith.science/pith/AO25F7FMJ3G27MVY7P2HYMOLO2.json","view_paper":"https://pith.science/paper/AO25F7FM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.06231&json=true","fetch_graph":"https://pith.science/api/pith-number/AO25F7FMJ3G27MVY7P2HYMOLO2/graph.json","fetch_events":"https://pith.science/api/pith-number/AO25F7FMJ3G27MVY7P2HYMOLO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AO25F7FMJ3G27MVY7P2HYMOLO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AO25F7FMJ3G27MVY7P2HYMOLO2/action/storage_attestation","attest_author":"https://pith.science/pith/AO25F7FMJ3G27MVY7P2HYMOLO2/action/author_attestation","sign_citation":"https://pith.science/pith/AO25F7FMJ3G27MVY7P2HYMOLO2/action/citation_signature","submit_replication":"https://pith.science/pith/AO25F7FMJ3G27MVY7P2HYMOLO2/action/replication_record"}},"created_at":"2026-07-05T02:48:27.589283+00:00","updated_at":"2026-07-05T02:48:27.589283+00:00"}