{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TQME2WKQGY5XSPA5OVQN47R5RX","short_pith_number":"pith:TQME2WKQ","schema_version":"1.0","canonical_sha256":"9c184d5950363b793c1d7560de7e3d8dfbf9965d0e9a2df6c5c9ba3e7fce49f8","source":{"kind":"arxiv","id":"2401.09030","version":4},"attestation_state":"computed","paper":{"title":"Linear-Quadratic Graphon Mean Field Games with Common Noise","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"De-xuan Xu, Nan-jing Huang, Shuang Gao, Zhun Gou","submitted_at":"2024-01-17T07:55:52Z","abstract_excerpt":"This paper studies linear quadratic graphon mean field games (LQ-GMFGs) with common noise, in which a large number of agents are coupled via a weighted undirected graph. One special feature, compared with the well-studied graphon mean field games, is that the states of agents are described by the dynamic systems with the idiosyncratic noises and common noise. The limit LQ-GMFGs with common noise are formulated based on the assumption that these graphs lie in a sequence converging to a limit graphon. By applying the spectral decomposition method, the existence of solution for the formulated lim"},"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":"2401.09030","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-01-17T07:55:52Z","cross_cats_sorted":[],"title_canon_sha256":"78bffbf36be8bc0db49c19b1e564a823ddcb842bd3a131302228491f2b441c6d","abstract_canon_sha256":"40891d0b7a72333b9634f14207d5ff40b51b27ceb325647b06eefd02d7570804"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:30:35.332376Z","signature_b64":"mZ6TjQ5jSRpw15gmOu1ze3YGaIWJnWHvYJCz1n5XNGlnerG66Tb0/kQRfz8omodnMEtmdccgXQswjZnajcE9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c184d5950363b793c1d7560de7e3d8dfbf9965d0e9a2df6c5c9ba3e7fce49f8","last_reissued_at":"2026-07-05T11:30:35.331791Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:30:35.331791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-Quadratic Graphon Mean Field Games with Common Noise","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"De-xuan Xu, Nan-jing Huang, Shuang Gao, Zhun Gou","submitted_at":"2024-01-17T07:55:52Z","abstract_excerpt":"This paper studies linear quadratic graphon mean field games (LQ-GMFGs) with common noise, in which a large number of agents are coupled via a weighted undirected graph. One special feature, compared with the well-studied graphon mean field games, is that the states of agents are described by the dynamic systems with the idiosyncratic noises and common noise. The limit LQ-GMFGs with common noise are formulated based on the assumption that these graphs lie in a sequence converging to a limit graphon. By applying the spectral decomposition method, the existence of solution for the formulated lim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.09030","kind":"arxiv","version":4},"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/2401.09030/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":"2401.09030","created_at":"2026-07-05T11:30:35.331872+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.09030v4","created_at":"2026-07-05T11:30:35.331872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.09030","created_at":"2026-07-05T11:30:35.331872+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQME2WKQGY5X","created_at":"2026-07-05T11:30:35.331872+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQME2WKQGY5XSPA5","created_at":"2026-07-05T11:30:35.331872+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQME2WKQ","created_at":"2026-07-05T11:30:35.331872+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.11468","citing_title":"Linear-quadratic stochastic nonzero-sum differential games between graphon teams","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TQME2WKQGY5XSPA5OVQN47R5RX","json":"https://pith.science/pith/TQME2WKQGY5XSPA5OVQN47R5RX.json","graph_json":"https://pith.science/api/pith-number/TQME2WKQGY5XSPA5OVQN47R5RX/graph.json","events_json":"https://pith.science/api/pith-number/TQME2WKQGY5XSPA5OVQN47R5RX/events.json","paper":"https://pith.science/paper/TQME2WKQ"},"agent_actions":{"view_html":"https://pith.science/pith/TQME2WKQGY5XSPA5OVQN47R5RX","download_json":"https://pith.science/pith/TQME2WKQGY5XSPA5OVQN47R5RX.json","view_paper":"https://pith.science/paper/TQME2WKQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.09030&json=true","fetch_graph":"https://pith.science/api/pith-number/TQME2WKQGY5XSPA5OVQN47R5RX/graph.json","fetch_events":"https://pith.science/api/pith-number/TQME2WKQGY5XSPA5OVQN47R5RX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQME2WKQGY5XSPA5OVQN47R5RX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQME2WKQGY5XSPA5OVQN47R5RX/action/storage_attestation","attest_author":"https://pith.science/pith/TQME2WKQGY5XSPA5OVQN47R5RX/action/author_attestation","sign_citation":"https://pith.science/pith/TQME2WKQGY5XSPA5OVQN47R5RX/action/citation_signature","submit_replication":"https://pith.science/pith/TQME2WKQGY5XSPA5OVQN47R5RX/action/replication_record"}},"created_at":"2026-07-05T11:30:35.331872+00:00","updated_at":"2026-07-05T11:30:35.331872+00:00"}