{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YMAQ77RARWFD6OJMSJYWBHDC3T","short_pith_number":"pith:YMAQ77RA","schema_version":"1.0","canonical_sha256":"c3010ffe208d8a3f392c9271609c62dccd85f7e282c6133532756fe8023f600a","source":{"kind":"arxiv","id":"1507.03731","version":2},"attestation_state":"computed","paper":{"title":"A numerical method for Mean Field Games on networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Claudio Marchi, Fabio Camilli, Simone Cacace","submitted_at":"2015-07-14T06:27:16Z","abstract_excerpt":"We propose a numerical method for stationary Mean Field Games defined on a network. In this framework a correct approximation of the transition conditions at the vertices plays a crucial role. We prove existence, uniqueness and convergence of the scheme and we also propose a least squares method for the solution of the discrete system. Numerical experiments are carried out."},"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":"1507.03731","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-14T06:27:16Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"fb59e0f19029a185b9088f860546c38980cc9b20c7a5f31a502464853f324783","abstract_canon_sha256":"3a7382e1a7f7256769df76e0a918a737a95e9322c972e5687c80ece13cff4e41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:25.129809Z","signature_b64":"khsroqE+d9sEp14i7+9XFUjJbZgUs4E3f1ahQiS25jzY4RNADXR8EZ/g4/i+AapD3Tgybkq564YVjNGnu8OqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3010ffe208d8a3f392c9271609c62dccd85f7e282c6133532756fe8023f600a","last_reissued_at":"2026-05-18T01:26:25.129221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:25.129221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A numerical method for Mean Field Games on networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Claudio Marchi, Fabio Camilli, Simone Cacace","submitted_at":"2015-07-14T06:27:16Z","abstract_excerpt":"We propose a numerical method for stationary Mean Field Games defined on a network. In this framework a correct approximation of the transition conditions at the vertices plays a crucial role. We prove existence, uniqueness and convergence of the scheme and we also propose a least squares method for the solution of the discrete system. Numerical experiments are carried out."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03731","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":"1507.03731","created_at":"2026-05-18T01:26:25.129310+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03731v2","created_at":"2026-05-18T01:26:25.129310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03731","created_at":"2026-05-18T01:26:25.129310+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMAQ77RARWFD","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMAQ77RARWFD6OJM","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMAQ77RA","created_at":"2026-05-18T12:29:50.041715+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/YMAQ77RARWFD6OJMSJYWBHDC3T","json":"https://pith.science/pith/YMAQ77RARWFD6OJMSJYWBHDC3T.json","graph_json":"https://pith.science/api/pith-number/YMAQ77RARWFD6OJMSJYWBHDC3T/graph.json","events_json":"https://pith.science/api/pith-number/YMAQ77RARWFD6OJMSJYWBHDC3T/events.json","paper":"https://pith.science/paper/YMAQ77RA"},"agent_actions":{"view_html":"https://pith.science/pith/YMAQ77RARWFD6OJMSJYWBHDC3T","download_json":"https://pith.science/pith/YMAQ77RARWFD6OJMSJYWBHDC3T.json","view_paper":"https://pith.science/paper/YMAQ77RA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03731&json=true","fetch_graph":"https://pith.science/api/pith-number/YMAQ77RARWFD6OJMSJYWBHDC3T/graph.json","fetch_events":"https://pith.science/api/pith-number/YMAQ77RARWFD6OJMSJYWBHDC3T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMAQ77RARWFD6OJMSJYWBHDC3T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMAQ77RARWFD6OJMSJYWBHDC3T/action/storage_attestation","attest_author":"https://pith.science/pith/YMAQ77RARWFD6OJMSJYWBHDC3T/action/author_attestation","sign_citation":"https://pith.science/pith/YMAQ77RARWFD6OJMSJYWBHDC3T/action/citation_signature","submit_replication":"https://pith.science/pith/YMAQ77RARWFD6OJMSJYWBHDC3T/action/replication_record"}},"created_at":"2026-05-18T01:26:25.129310+00:00","updated_at":"2026-05-18T01:26:25.129310+00:00"}