{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:57SGYL3THY3BM4V565J6DA2QRK","short_pith_number":"pith:57SGYL3T","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"},"canonical_sha256":"efe46c2f733e361672bdf753e183508ab61c4d0a68cbb2f694f84aab965f45d6","source":{"kind":"arxiv","id":"2507.00561","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.00561","created_at":"2026-07-05T11:30:10Z"},{"alias_kind":"arxiv_version","alias_value":"2507.00561v1","created_at":"2026-07-05T11:30:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.00561","created_at":"2026-07-05T11:30:10Z"},{"alias_kind":"pith_short_12","alias_value":"57SGYL3THY3B","created_at":"2026-07-05T11:30:10Z"},{"alias_kind":"pith_short_16","alias_value":"57SGYL3THY3BM4V5","created_at":"2026-07-05T11:30:10Z"},{"alias_kind":"pith_short_8","alias_value":"57SGYL3T","created_at":"2026-07-05T11:30:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:57SGYL3THY3BM4V565J6DA2QRK","target":"record","payload":{"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"},"canonical_sha256":"efe46c2f733e361672bdf753e183508ab61c4d0a68cbb2f694f84aab965f45d6","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"},"source_kind":"arxiv","source_id":"2507.00561","source_version":1,"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-05T11:30:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cqFH90wFXlyWyzuInOK2wpRxOYlChepd9udG0jAO95HwQkGoCYfzboOP2o78l1PhUnj5pHilwLJTrgqLkbjmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:54:09.340666Z"},"content_sha256":"a7790e5ce135f6196b570d1b25e5b83e63186ee07e26b654351724227c4024e1","schema_version":"1.0","event_id":"sha256:a7790e5ce135f6196b570d1b25e5b83e63186ee07e26b654351724227c4024e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:57SGYL3THY3BM4V565J6DA2QRK","target":"graph","payload":{"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"},"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-05T11:30:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DYtLJUsHLTGddYiptMzyFaoRS2ipQOPmlUxQhasEbIxEDhQtzl16Sry5ZXAvXXGB0GKDE6VaMoUdp+3vQtkxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:54:09.341171Z"},"content_sha256":"5a841e0a1647c40c731dfb3e9b6c3fe4d843e85d25228238b839de5f6027084f","schema_version":"1.0","event_id":"sha256:5a841e0a1647c40c731dfb3e9b6c3fe4d843e85d25228238b839de5f6027084f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/57SGYL3THY3BM4V565J6DA2QRK/bundle.json","state_url":"https://pith.science/pith/57SGYL3THY3BM4V565J6DA2QRK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/57SGYL3THY3BM4V565J6DA2QRK/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-08-08T11:54:09Z","links":{"resolver":"https://pith.science/pith/57SGYL3THY3BM4V565J6DA2QRK","bundle":"https://pith.science/pith/57SGYL3THY3BM4V565J6DA2QRK/bundle.json","state":"https://pith.science/pith/57SGYL3THY3BM4V565J6DA2QRK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/57SGYL3THY3BM4V565J6DA2QRK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:57SGYL3THY3BM4V565J6DA2QRK","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":"0c7e4f0e114250a9fd040d82303e157acde8beada83439b431b758bcf8403170","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-01T08:29:33Z","title_canon_sha256":"5e5757bb873b3a5a3f27cd242de7d28cff49cf4a43d500377c420eaa723b1db3"},"schema_version":"1.0","source":{"id":"2507.00561","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.00561","created_at":"2026-07-05T11:30:10Z"},{"alias_kind":"arxiv_version","alias_value":"2507.00561v1","created_at":"2026-07-05T11:30:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.00561","created_at":"2026-07-05T11:30:10Z"},{"alias_kind":"pith_short_12","alias_value":"57SGYL3THY3B","created_at":"2026-07-05T11:30:10Z"},{"alias_kind":"pith_short_16","alias_value":"57SGYL3THY3BM4V5","created_at":"2026-07-05T11:30:10Z"},{"alias_kind":"pith_short_8","alias_value":"57SGYL3T","created_at":"2026-07-05T11:30:10Z"}],"graph_snapshots":[{"event_id":"sha256:5a841e0a1647c40c731dfb3e9b6c3fe4d843e85d25228238b839de5f6027084f","target":"graph","created_at":"2026-07-05T11:30:10Z","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/2507.00561/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Eyal Neuman, Sturmius Tuschmann","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-01T08:29:33Z","title":"Stochastic Graphon Games with Interventions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.00561","kind":"arxiv","version":1},"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:a7790e5ce135f6196b570d1b25e5b83e63186ee07e26b654351724227c4024e1","target":"record","created_at":"2026-07-05T11:30:10Z","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":"0c7e4f0e114250a9fd040d82303e157acde8beada83439b431b758bcf8403170","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-01T08:29:33Z","title_canon_sha256":"5e5757bb873b3a5a3f27cd242de7d28cff49cf4a43d500377c420eaa723b1db3"},"schema_version":"1.0","source":{"id":"2507.00561","kind":"arxiv","version":1}},"canonical_sha256":"efe46c2f733e361672bdf753e183508ab61c4d0a68cbb2f694f84aab965f45d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efe46c2f733e361672bdf753e183508ab61c4d0a68cbb2f694f84aab965f45d6","first_computed_at":"2026-07-05T11:30:10.797714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:30:10.797714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TQpDid+wdcG2layIRWyKKKk7jvOCNmj4U5rWZrsXgXMK4652gfE4CbzttUuIiyDKEd9CHshqcuRl31h70C7SDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:30:10.798153Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.00561","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7790e5ce135f6196b570d1b25e5b83e63186ee07e26b654351724227c4024e1","sha256:5a841e0a1647c40c731dfb3e9b6c3fe4d843e85d25228238b839de5f6027084f"],"state_sha256":"9b40bf14fff27bea14f5e78b257e9185d34008921c72f391cda6f7a61c93b7d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bDGkIXtYQOsGh6PQN77Ji1gwwyIIY1dvH8jY/E920zArZjZPx+hNtO/P78Umtz4GFfT+h8QphXqwjzD8xLzHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T11:54:09.345228Z","bundle_sha256":"48bb1654891eba6058cfb8a9b8f13745648620292306906779f139ca1a4bb094"}}