{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DBMZAA3EAUR6THD653BJ5DPPZD","short_pith_number":"pith:DBMZAA3E","schema_version":"1.0","canonical_sha256":"18599003640523e99c7eeec29e8defc8f2f9dfb3d33a8a4d2e96d4b2aa08c5e3","source":{"kind":"arxiv","id":"2108.00755","version":2},"attestation_state":"computed","paper":{"title":"Rates of convergence for the policy iteration method for Mean Field Games systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.OC","authors_text":"Fabio Camilli, Qing Tang","submitted_at":"2021-08-02T10:03:02Z","abstract_excerpt":"Convergence of the policy iteration method for discrete and continuous optimal control problems holds under general assumptions. Moreover, in some circumstances, it is also possible to show a quadratic rate of convergence for the algorithm. For Mean Field Games, convergence of the policy iteration method has been recently proved in [9]. Here, we provide an estimate of its rate of convergence."},"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":"2108.00755","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-08-02T10:03:02Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"c1005f9d712e8e513875d9dc3e1838bd17419ada05e0fa4a992400f584c0a60a","abstract_canon_sha256":"a60dddf8221228d211294c0e2b52b27910a08d98e7819ed50adac99a9695566f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:00:55.065349Z","signature_b64":"pBqCbWh0iLcU2i9TWVW4T1v4LvqduA/XcIyOuQA80JogRtmfQiE5tGHpZc2EQEqYAVce4jLideD7ZUPtcvdUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18599003640523e99c7eeec29e8defc8f2f9dfb3d33a8a4d2e96d4b2aa08c5e3","last_reissued_at":"2026-07-05T04:00:55.064989Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:00:55.064989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rates of convergence for the policy iteration method for Mean Field Games systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.OC","authors_text":"Fabio Camilli, Qing Tang","submitted_at":"2021-08-02T10:03:02Z","abstract_excerpt":"Convergence of the policy iteration method for discrete and continuous optimal control problems holds under general assumptions. Moreover, in some circumstances, it is also possible to show a quadratic rate of convergence for the algorithm. For Mean Field Games, convergence of the policy iteration method has been recently proved in [9]. Here, we provide an estimate of its rate of convergence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.00755","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/2108.00755/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":"2108.00755","created_at":"2026-07-05T04:00:55.065046+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.00755v2","created_at":"2026-07-05T04:00:55.065046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.00755","created_at":"2026-07-05T04:00:55.065046+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBMZAA3EAUR6","created_at":"2026-07-05T04:00:55.065046+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBMZAA3EAUR6THD6","created_at":"2026-07-05T04:00:55.065046+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBMZAA3E","created_at":"2026-07-05T04:00:55.065046+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DBMZAA3EAUR6THD653BJ5DPPZD","json":"https://pith.science/pith/DBMZAA3EAUR6THD653BJ5DPPZD.json","graph_json":"https://pith.science/api/pith-number/DBMZAA3EAUR6THD653BJ5DPPZD/graph.json","events_json":"https://pith.science/api/pith-number/DBMZAA3EAUR6THD653BJ5DPPZD/events.json","paper":"https://pith.science/paper/DBMZAA3E"},"agent_actions":{"view_html":"https://pith.science/pith/DBMZAA3EAUR6THD653BJ5DPPZD","download_json":"https://pith.science/pith/DBMZAA3EAUR6THD653BJ5DPPZD.json","view_paper":"https://pith.science/paper/DBMZAA3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.00755&json=true","fetch_graph":"https://pith.science/api/pith-number/DBMZAA3EAUR6THD653BJ5DPPZD/graph.json","fetch_events":"https://pith.science/api/pith-number/DBMZAA3EAUR6THD653BJ5DPPZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBMZAA3EAUR6THD653BJ5DPPZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBMZAA3EAUR6THD653BJ5DPPZD/action/storage_attestation","attest_author":"https://pith.science/pith/DBMZAA3EAUR6THD653BJ5DPPZD/action/author_attestation","sign_citation":"https://pith.science/pith/DBMZAA3EAUR6THD653BJ5DPPZD/action/citation_signature","submit_replication":"https://pith.science/pith/DBMZAA3EAUR6THD653BJ5DPPZD/action/replication_record"}},"created_at":"2026-07-05T04:00:55.065046+00:00","updated_at":"2026-07-05T04:00:55.065046+00:00"}