{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BCFNL7GWWOR7VZHURCDDRU7BEY","short_pith_number":"pith:BCFNL7GW","schema_version":"1.0","canonical_sha256":"088ad5fcd6b3a3fae4f4888638d3e12611de2a3109fee43188f2312f38f2c42d","source":{"kind":"arxiv","id":"2312.10526","version":1},"attestation_state":"computed","paper":{"title":"From Nash Equilibrium to Social Optimum and vice versa: a Mean Field Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.GT","authors_text":"Francois Delarue, Gokce Dayanikli, Mathieu Lauriere, Rene Carmona","submitted_at":"2023-12-16T19:52:39Z","abstract_excerpt":"Mean field games (MFG) and mean field control (MFC) problems have been introduced to study large populations of strategic players. They correspond respectively to non-cooperative or cooperative scenarios, where the aim is to find the Nash equilibrium and social optimum. These frameworks provide approximate solutions to situations with a finite number of players and have found a wide range of applications, from economics to biology and machine learning. In this paper, we study how the players can pass from a non-cooperative to a cooperative regime, and vice versa. The first direction is reminis"},"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":"2312.10526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-12-16T19:52:39Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e8afbb6961b64514fc5ebf6d8c73ad3628ad05d95aa7bac065aaf505e3c97f8d","abstract_canon_sha256":"58aab19ae7abb90cc11f593670375cb991a81bcc51b0bfd32cc1841dc2447eac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:25:08.225045Z","signature_b64":"OE3C1Kr3lReyFIqIArpDTUCb1e2+gf0Om1Yk3RUcoMAsjdbMozqpIcleflhCsoXTJGA/B49OXcHZ4JY7wY/JAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"088ad5fcd6b3a3fae4f4888638d3e12611de2a3109fee43188f2312f38f2c42d","last_reissued_at":"2026-07-05T07:25:08.224642Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:25:08.224642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Nash Equilibrium to Social Optimum and vice versa: a Mean Field Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.GT","authors_text":"Francois Delarue, Gokce Dayanikli, Mathieu Lauriere, Rene Carmona","submitted_at":"2023-12-16T19:52:39Z","abstract_excerpt":"Mean field games (MFG) and mean field control (MFC) problems have been introduced to study large populations of strategic players. They correspond respectively to non-cooperative or cooperative scenarios, where the aim is to find the Nash equilibrium and social optimum. These frameworks provide approximate solutions to situations with a finite number of players and have found a wide range of applications, from economics to biology and machine learning. In this paper, we study how the players can pass from a non-cooperative to a cooperative regime, and vice versa. The first direction is reminis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.10526","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/2312.10526/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":"2312.10526","created_at":"2026-07-05T07:25:08.224698+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.10526v1","created_at":"2026-07-05T07:25:08.224698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.10526","created_at":"2026-07-05T07:25:08.224698+00:00"},{"alias_kind":"pith_short_12","alias_value":"BCFNL7GWWOR7","created_at":"2026-07-05T07:25:08.224698+00:00"},{"alias_kind":"pith_short_16","alias_value":"BCFNL7GWWOR7VZHU","created_at":"2026-07-05T07:25:08.224698+00:00"},{"alias_kind":"pith_short_8","alias_value":"BCFNL7GW","created_at":"2026-07-05T07:25:08.224698+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.10604","citing_title":"A Mean Field Game for Capacity Expansion Modeling","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BCFNL7GWWOR7VZHURCDDRU7BEY","json":"https://pith.science/pith/BCFNL7GWWOR7VZHURCDDRU7BEY.json","graph_json":"https://pith.science/api/pith-number/BCFNL7GWWOR7VZHURCDDRU7BEY/graph.json","events_json":"https://pith.science/api/pith-number/BCFNL7GWWOR7VZHURCDDRU7BEY/events.json","paper":"https://pith.science/paper/BCFNL7GW"},"agent_actions":{"view_html":"https://pith.science/pith/BCFNL7GWWOR7VZHURCDDRU7BEY","download_json":"https://pith.science/pith/BCFNL7GWWOR7VZHURCDDRU7BEY.json","view_paper":"https://pith.science/paper/BCFNL7GW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.10526&json=true","fetch_graph":"https://pith.science/api/pith-number/BCFNL7GWWOR7VZHURCDDRU7BEY/graph.json","fetch_events":"https://pith.science/api/pith-number/BCFNL7GWWOR7VZHURCDDRU7BEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BCFNL7GWWOR7VZHURCDDRU7BEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BCFNL7GWWOR7VZHURCDDRU7BEY/action/storage_attestation","attest_author":"https://pith.science/pith/BCFNL7GWWOR7VZHURCDDRU7BEY/action/author_attestation","sign_citation":"https://pith.science/pith/BCFNL7GWWOR7VZHURCDDRU7BEY/action/citation_signature","submit_replication":"https://pith.science/pith/BCFNL7GWWOR7VZHURCDDRU7BEY/action/replication_record"}},"created_at":"2026-07-05T07:25:08.224698+00:00","updated_at":"2026-07-05T07:25:08.224698+00:00"}