{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:57SGYL3THY3BM4V565J6DA2QRK","short_pith_number":"pith:57SGYL3T","schema_version":"1.0","canonical_sha256":"efe46c2f733e361672bdf753e183508ab61c4d0a68cbb2f694f84aab965f45d6","source":{"kind":"arxiv","id":"2507.00561","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Graphon Games with Interventions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Eyal Neuman, Sturmius Tuschmann","submitted_at":"2025-07-01T08:29:33Z","abstract_excerpt":"We consider a class of targeted intervention problems in dynamic network and graphon games. First, we study a general dynamic network game in which players interact over a graph and maximize their heterogeneous, concave goal functionals, which depend on both their own actions and their interactions with their neighbors. We establish the existence and uniqueness of the Nash equilibrium in both the finite-player network game and the corresponding infinite-player graphon game. We also prove the convergence of the Nash equilibrium in the network game to the one in the graphon game, providing expli"},"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":"2507.00561","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-01T08:29:33Z","cross_cats_sorted":[],"title_canon_sha256":"5e5757bb873b3a5a3f27cd242de7d28cff49cf4a43d500377c420eaa723b1db3","abstract_canon_sha256":"0c7e4f0e114250a9fd040d82303e157acde8beada83439b431b758bcf8403170"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:30:10.798153Z","signature_b64":"TQpDid+wdcG2layIRWyKKKk7jvOCNmj4U5rWZrsXgXMK4652gfE4CbzttUuIiyDKEd9CHshqcuRl31h70C7SDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efe46c2f733e361672bdf753e183508ab61c4d0a68cbb2f694f84aab965f45d6","last_reissued_at":"2026-07-05T11:30:10.797714Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:30:10.797714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Graphon Games with Interventions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Eyal Neuman, Sturmius Tuschmann","submitted_at":"2025-07-01T08:29:33Z","abstract_excerpt":"We consider a class of targeted intervention problems in dynamic network and graphon games. First, we study a general dynamic network game in which players interact over a graph and maximize their heterogeneous, concave goal functionals, which depend on both their own actions and their interactions with their neighbors. We establish the existence and uniqueness of the Nash equilibrium in both the finite-player network game and the corresponding infinite-player graphon game. We also prove the convergence of the Nash equilibrium in the network game to the one in the graphon game, providing expli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.00561","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/2507.00561/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":"2507.00561","created_at":"2026-07-05T11:30:10.797769+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.00561v1","created_at":"2026-07-05T11:30:10.797769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.00561","created_at":"2026-07-05T11:30:10.797769+00:00"},{"alias_kind":"pith_short_12","alias_value":"57SGYL3THY3B","created_at":"2026-07-05T11:30:10.797769+00:00"},{"alias_kind":"pith_short_16","alias_value":"57SGYL3THY3BM4V5","created_at":"2026-07-05T11:30:10.797769+00:00"},{"alias_kind":"pith_short_8","alias_value":"57SGYL3T","created_at":"2026-07-05T11:30:10.797769+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/57SGYL3THY3BM4V565J6DA2QRK","json":"https://pith.science/pith/57SGYL3THY3BM4V565J6DA2QRK.json","graph_json":"https://pith.science/api/pith-number/57SGYL3THY3BM4V565J6DA2QRK/graph.json","events_json":"https://pith.science/api/pith-number/57SGYL3THY3BM4V565J6DA2QRK/events.json","paper":"https://pith.science/paper/57SGYL3T"},"agent_actions":{"view_html":"https://pith.science/pith/57SGYL3THY3BM4V565J6DA2QRK","download_json":"https://pith.science/pith/57SGYL3THY3BM4V565J6DA2QRK.json","view_paper":"https://pith.science/paper/57SGYL3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.00561&json=true","fetch_graph":"https://pith.science/api/pith-number/57SGYL3THY3BM4V565J6DA2QRK/graph.json","fetch_events":"https://pith.science/api/pith-number/57SGYL3THY3BM4V565J6DA2QRK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57SGYL3THY3BM4V565J6DA2QRK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57SGYL3THY3BM4V565J6DA2QRK/action/storage_attestation","attest_author":"https://pith.science/pith/57SGYL3THY3BM4V565J6DA2QRK/action/author_attestation","sign_citation":"https://pith.science/pith/57SGYL3THY3BM4V565J6DA2QRK/action/citation_signature","submit_replication":"https://pith.science/pith/57SGYL3THY3BM4V565J6DA2QRK/action/replication_record"}},"created_at":"2026-07-05T11:30:10.797769+00:00","updated_at":"2026-07-05T11:30:10.797769+00:00"}