{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:DBAVPKNFMUYO3S4MSMXGRBC2GE","short_pith_number":"pith:DBAVPKNF","canonical_record":{"source":{"id":"2007.04818","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2020-07-09T14:06:59Z","cross_cats_sorted":[],"title_canon_sha256":"de20ae0b9fb7b68b8b1aecfcd3b392b224ceeb2cb407cd6fb79b908315b2d89b","abstract_canon_sha256":"e5edeb29053cd0e932adee417f525479e5d8c6a1011eb400634e008d4a61410f"},"schema_version":"1.0"},"canonical_sha256":"184157a9a56530edcb8c932e68845a3100945a89a01f551990b29ec0a030b54f","source":{"kind":"arxiv","id":"2007.04818","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.04818","created_at":"2026-07-05T02:56:23Z"},{"alias_kind":"arxiv_version","alias_value":"2007.04818v3","created_at":"2026-07-05T02:56:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.04818","created_at":"2026-07-05T02:56:23Z"},{"alias_kind":"pith_short_12","alias_value":"DBAVPKNFMUYO","created_at":"2026-07-05T02:56:23Z"},{"alias_kind":"pith_short_16","alias_value":"DBAVPKNFMUYO3S4M","created_at":"2026-07-05T02:56:23Z"},{"alias_kind":"pith_short_8","alias_value":"DBAVPKNF","created_at":"2026-07-05T02:56:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:DBAVPKNFMUYO3S4MSMXGRBC2GE","target":"record","payload":{"canonical_record":{"source":{"id":"2007.04818","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2020-07-09T14:06:59Z","cross_cats_sorted":[],"title_canon_sha256":"de20ae0b9fb7b68b8b1aecfcd3b392b224ceeb2cb407cd6fb79b908315b2d89b","abstract_canon_sha256":"e5edeb29053cd0e932adee417f525479e5d8c6a1011eb400634e008d4a61410f"},"schema_version":"1.0"},"canonical_sha256":"184157a9a56530edcb8c932e68845a3100945a89a01f551990b29ec0a030b54f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:56:23.422167Z","signature_b64":"B7snOzdmjW4QNypn28BWCgq6G/7XNNhqVb2GqhL09kuarHu+XDAafkFTqKg8TPZelGou14nEWZmnJSqz/WZSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"184157a9a56530edcb8c932e68845a3100945a89a01f551990b29ec0a030b54f","last_reissued_at":"2026-07-05T02:56:23.421721Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:56:23.421721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.04818","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:56:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dc7zAgpbHcnGIIsczHZLlsqLJur+sujF0ggtMNPq+Xhs30ibbDHDcHXXVjio9Wj9w+MXD11G395TmKDUcuRGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T16:13:28.632630Z"},"content_sha256":"711b8a5ca5873aff30e996e0da3d07c0a1f2fde95197fdebe0a9deee5df8288d","schema_version":"1.0","event_id":"sha256:711b8a5ca5873aff30e996e0da3d07c0a1f2fde95197fdebe0a9deee5df8288d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:DBAVPKNFMUYO3S4MSMXGRBC2GE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A policy iteration method for Mean Field Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AP","authors_text":"Alessandro Goffi, Fabio Camilli, Simone Cacace","submitted_at":"2020-07-09T14:06:59Z","abstract_excerpt":"The policy iteration method is a classical algorithm for solving optimal control problems. In this paper, we introduce a policy iteration method for Mean Field Games systems, and we study the convergence of this procedure to a solution of the problem. We also introduce suitable discretizations to numerically solve both stationary and evolutive problems. We show the convergence of the policy iteration method for the discrete problem and we study the performance of the proposed algorithm on some examples in dimension one and two."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.04818","kind":"arxiv","version":3},"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/2007.04818/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:56:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7JqKoTW3KSFoUdusd77wsp7mUZUJMg3/P8+WpMm1yCAx4L+RueobAwZgtUR1KkZkPh0NscU9jpcyxLzDAV71BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T16:13:28.633011Z"},"content_sha256":"81fd5321d39e898c5ab10bd813d30c52e321893a8f0aecc41be68c632bfd162d","schema_version":"1.0","event_id":"sha256:81fd5321d39e898c5ab10bd813d30c52e321893a8f0aecc41be68c632bfd162d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DBAVPKNFMUYO3S4MSMXGRBC2GE/bundle.json","state_url":"https://pith.science/pith/DBAVPKNFMUYO3S4MSMXGRBC2GE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DBAVPKNFMUYO3S4MSMXGRBC2GE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T16:13:28Z","links":{"resolver":"https://pith.science/pith/DBAVPKNFMUYO3S4MSMXGRBC2GE","bundle":"https://pith.science/pith/DBAVPKNFMUYO3S4MSMXGRBC2GE/bundle.json","state":"https://pith.science/pith/DBAVPKNFMUYO3S4MSMXGRBC2GE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DBAVPKNFMUYO3S4MSMXGRBC2GE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:DBAVPKNFMUYO3S4MSMXGRBC2GE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e5edeb29053cd0e932adee417f525479e5d8c6a1011eb400634e008d4a61410f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2020-07-09T14:06:59Z","title_canon_sha256":"de20ae0b9fb7b68b8b1aecfcd3b392b224ceeb2cb407cd6fb79b908315b2d89b"},"schema_version":"1.0","source":{"id":"2007.04818","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.04818","created_at":"2026-07-05T02:56:23Z"},{"alias_kind":"arxiv_version","alias_value":"2007.04818v3","created_at":"2026-07-05T02:56:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.04818","created_at":"2026-07-05T02:56:23Z"},{"alias_kind":"pith_short_12","alias_value":"DBAVPKNFMUYO","created_at":"2026-07-05T02:56:23Z"},{"alias_kind":"pith_short_16","alias_value":"DBAVPKNFMUYO3S4M","created_at":"2026-07-05T02:56:23Z"},{"alias_kind":"pith_short_8","alias_value":"DBAVPKNF","created_at":"2026-07-05T02:56:23Z"}],"graph_snapshots":[{"event_id":"sha256:81fd5321d39e898c5ab10bd813d30c52e321893a8f0aecc41be68c632bfd162d","target":"graph","created_at":"2026-07-05T02:56:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.04818/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The policy iteration method is a classical algorithm for solving optimal control problems. In this paper, we introduce a policy iteration method for Mean Field Games systems, and we study the convergence of this procedure to a solution of the problem. We also introduce suitable discretizations to numerically solve both stationary and evolutive problems. We show the convergence of the policy iteration method for the discrete problem and we study the performance of the proposed algorithm on some examples in dimension one and two.","authors_text":"Alessandro Goffi, Fabio Camilli, Simone Cacace","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2020-07-09T14:06:59Z","title":"A policy iteration method for Mean Field Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.04818","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:711b8a5ca5873aff30e996e0da3d07c0a1f2fde95197fdebe0a9deee5df8288d","target":"record","created_at":"2026-07-05T02:56:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e5edeb29053cd0e932adee417f525479e5d8c6a1011eb400634e008d4a61410f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2020-07-09T14:06:59Z","title_canon_sha256":"de20ae0b9fb7b68b8b1aecfcd3b392b224ceeb2cb407cd6fb79b908315b2d89b"},"schema_version":"1.0","source":{"id":"2007.04818","kind":"arxiv","version":3}},"canonical_sha256":"184157a9a56530edcb8c932e68845a3100945a89a01f551990b29ec0a030b54f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"184157a9a56530edcb8c932e68845a3100945a89a01f551990b29ec0a030b54f","first_computed_at":"2026-07-05T02:56:23.421721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:56:23.421721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B7snOzdmjW4QNypn28BWCgq6G/7XNNhqVb2GqhL09kuarHu+XDAafkFTqKg8TPZelGou14nEWZmnJSqz/WZSBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:56:23.422167Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.04818","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:711b8a5ca5873aff30e996e0da3d07c0a1f2fde95197fdebe0a9deee5df8288d","sha256:81fd5321d39e898c5ab10bd813d30c52e321893a8f0aecc41be68c632bfd162d"],"state_sha256":"05de7c7e72d586a9981bfb18425ed59dc6e03dc66f94d077f1bf9afd16cc08fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rgp+2BB+vnrwjkqat5aUzc3ZmLBdlRvzwkeZTMT/IhrDxu0gJcP1/foFYN9m7Agu4NzmclHHe1BeYxvYhJkCAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T16:13:28.635010Z","bundle_sha256":"ae74a0b971ba493af8eadfde00cdb18848ae6092da018a43005e21af3c597127"}}