{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WBYK3KKRHIP5A3GKN3LYAYDGMZ","short_pith_number":"pith:WBYK3KKR","canonical_record":{"source":{"id":"1706.08693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-06-27T07:09:21Z","cross_cats_sorted":[],"title_canon_sha256":"87b780f22d0a88e080925069f85a8cb96a58de8152c3a03bb2e4b3ea4883812c","abstract_canon_sha256":"1c7c34d45e89a743e4dfed4bf386c4985db31b3681ef97a76edc9503fd34faec"},"schema_version":"1.0"},"canonical_sha256":"b070ada9513a1fd06cca6ed78060666662ee16334235662a8042852542333a8b","source":{"kind":"arxiv","id":"1706.08693","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08693","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08693v1","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08693","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"WBYK3KKRHIP5","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WBYK3KKRHIP5A3GK","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WBYK3KKR","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WBYK3KKRHIP5A3GKN3LYAYDGMZ","target":"record","payload":{"canonical_record":{"source":{"id":"1706.08693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-06-27T07:09:21Z","cross_cats_sorted":[],"title_canon_sha256":"87b780f22d0a88e080925069f85a8cb96a58de8152c3a03bb2e4b3ea4883812c","abstract_canon_sha256":"1c7c34d45e89a743e4dfed4bf386c4985db31b3681ef97a76edc9503fd34faec"},"schema_version":"1.0"},"canonical_sha256":"b070ada9513a1fd06cca6ed78060666662ee16334235662a8042852542333a8b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:31.324926Z","signature_b64":"M0eTNBCqxzvZ4VfSHBcBtnbsz7ummVLpQOYj6svwITCP19DXmPdDciIiDlHdEt2TjI7TQdtlO+sl8n3aQGprDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b070ada9513a1fd06cca6ed78060666662ee16334235662a8042852542333a8b","last_reissued_at":"2026-05-18T00:41:31.324326Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:31.324326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.08693","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-05-18T00:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RewAos2IS0Tdcf102ASPFcbTJaB2KILJD1vFMOtmKZNdknkYDU1Q/HjcFvKAn0fW3tpaS7hU0xSevOazk9P9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:57:05.817350Z"},"content_sha256":"86e3330b76f54c85d71db1323e8a563a98c805a9086bf058dde6daebd308ae7f","schema_version":"1.0","event_id":"sha256:86e3330b76f54c85d71db1323e8a563a98c805a9086bf058dde6daebd308ae7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WBYK3KKRHIP5A3GKN3LYAYDGMZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sensitivity analysis for network aggregative games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Asuman Ozdaglar, Francesca Parise","submitted_at":"2017-06-27T07:09:21Z","abstract_excerpt":"We investigate the sensitivity of the Nash equilibrium of constrained network aggregative games to changes in exogenous parameters affecting the cost function of the players. This setting is motivated by two applications. The first is the analysis of interventions by a social planner with a networked objective function while the second is network routing games with atomic players and information constraints. By exploiting a primal reformulation of a sensitivity analysis result for variational inequalities, we provide a characterization of the sensitivity of the Nash equilibrium that depends on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08693","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":""},"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-05-18T00:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DZwh2rRDoHemIzmcL2Bjl07045qiz1a5vRRQ/pInVHeJLu16UJUtaGZCahJznaHvZSFzRn7sZa7OWQjPijwPAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:57:05.818067Z"},"content_sha256":"fd81befc81542266aa20c64abd55c613cac92b5f3373df34ad8ec740fa3e27b0","schema_version":"1.0","event_id":"sha256:fd81befc81542266aa20c64abd55c613cac92b5f3373df34ad8ec740fa3e27b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBYK3KKRHIP5A3GKN3LYAYDGMZ/bundle.json","state_url":"https://pith.science/pith/WBYK3KKRHIP5A3GKN3LYAYDGMZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBYK3KKRHIP5A3GKN3LYAYDGMZ/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-06-07T05:57:05Z","links":{"resolver":"https://pith.science/pith/WBYK3KKRHIP5A3GKN3LYAYDGMZ","bundle":"https://pith.science/pith/WBYK3KKRHIP5A3GKN3LYAYDGMZ/bundle.json","state":"https://pith.science/pith/WBYK3KKRHIP5A3GKN3LYAYDGMZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBYK3KKRHIP5A3GKN3LYAYDGMZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WBYK3KKRHIP5A3GKN3LYAYDGMZ","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":"1c7c34d45e89a743e4dfed4bf386c4985db31b3681ef97a76edc9503fd34faec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-06-27T07:09:21Z","title_canon_sha256":"87b780f22d0a88e080925069f85a8cb96a58de8152c3a03bb2e4b3ea4883812c"},"schema_version":"1.0","source":{"id":"1706.08693","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08693","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08693v1","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08693","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"WBYK3KKRHIP5","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WBYK3KKRHIP5A3GK","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WBYK3KKR","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:fd81befc81542266aa20c64abd55c613cac92b5f3373df34ad8ec740fa3e27b0","target":"graph","created_at":"2026-05-18T00:41:31Z","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"},"paper":{"abstract_excerpt":"We investigate the sensitivity of the Nash equilibrium of constrained network aggregative games to changes in exogenous parameters affecting the cost function of the players. This setting is motivated by two applications. The first is the analysis of interventions by a social planner with a networked objective function while the second is network routing games with atomic players and information constraints. By exploiting a primal reformulation of a sensitivity analysis result for variational inequalities, we provide a characterization of the sensitivity of the Nash equilibrium that depends on","authors_text":"Asuman Ozdaglar, Francesca Parise","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-06-27T07:09:21Z","title":"Sensitivity analysis for network aggregative games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08693","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:86e3330b76f54c85d71db1323e8a563a98c805a9086bf058dde6daebd308ae7f","target":"record","created_at":"2026-05-18T00:41:31Z","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":"1c7c34d45e89a743e4dfed4bf386c4985db31b3681ef97a76edc9503fd34faec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-06-27T07:09:21Z","title_canon_sha256":"87b780f22d0a88e080925069f85a8cb96a58de8152c3a03bb2e4b3ea4883812c"},"schema_version":"1.0","source":{"id":"1706.08693","kind":"arxiv","version":1}},"canonical_sha256":"b070ada9513a1fd06cca6ed78060666662ee16334235662a8042852542333a8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b070ada9513a1fd06cca6ed78060666662ee16334235662a8042852542333a8b","first_computed_at":"2026-05-18T00:41:31.324326Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:31.324326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M0eTNBCqxzvZ4VfSHBcBtnbsz7ummVLpQOYj6svwITCP19DXmPdDciIiDlHdEt2TjI7TQdtlO+sl8n3aQGprDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:31.324926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08693","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86e3330b76f54c85d71db1323e8a563a98c805a9086bf058dde6daebd308ae7f","sha256:fd81befc81542266aa20c64abd55c613cac92b5f3373df34ad8ec740fa3e27b0"],"state_sha256":"3be419f920b081ef4d472db6aeef71528edb5b048ee1e336ce6354a360a70bb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ni5t8e8zx68T4cFoAQ0TL5CyeujypZs7Goc1tWkYoitgkleE1y0dNq7ivXjCU58h/2ncP34WZzBZwdyfEuOPDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T05:57:05.822038Z","bundle_sha256":"294c3fc4d5d91643b1d7f8bdc07552f84cbf002187ea7c6ce0cda6c11771a5f6"}}