{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7I6UNVVY42GZCQPGZQ2PLXYCW6","short_pith_number":"pith:7I6UNVVY","canonical_record":{"source":{"id":"1207.1383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-07-04T16:12:21Z","cross_cats_sorted":[],"title_canon_sha256":"e45b4ae95580c8270ce7550aa73b000941736fe97e0d24549a1c66ab2e23837b","abstract_canon_sha256":"bb867a214044ad8b94c2c504e1003a7a3f9a883c48a21b166435e96815f661b4"},"schema_version":"1.0"},"canonical_sha256":"fa3d46d6b8e68d9141e6cc34f5df02b78db40e1dfa48aa334f0021d4ba4e429b","source":{"kind":"arxiv","id":"1207.1383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1383","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1383v1","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1383","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"7I6UNVVY42GZ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7I6UNVVY42GZCQPG","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7I6UNVVY","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7I6UNVVY42GZCQPGZQ2PLXYCW6","target":"record","payload":{"canonical_record":{"source":{"id":"1207.1383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-07-04T16:12:21Z","cross_cats_sorted":[],"title_canon_sha256":"e45b4ae95580c8270ce7550aa73b000941736fe97e0d24549a1c66ab2e23837b","abstract_canon_sha256":"bb867a214044ad8b94c2c504e1003a7a3f9a883c48a21b166435e96815f661b4"},"schema_version":"1.0"},"canonical_sha256":"fa3d46d6b8e68d9141e6cc34f5df02b78db40e1dfa48aa334f0021d4ba4e429b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:37.481447Z","signature_b64":"RujoUMT3F7GB29YeI3iuENArgHiTrYNNfLkvxATTxKrJJdGZV/zpmoJp0GeRsNlkPu3t4UtamMfBgpWQy/oKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa3d46d6b8e68d9141e6cc34f5df02b78db40e1dfa48aa334f0021d4ba4e429b","last_reissued_at":"2026-05-18T03:51:37.480694Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:37.480694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.1383","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-18T03:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+NLUH0nz5Ts7zpj/DL7tiPq7Gs+tuThmOQH66ESkFo8sFSgEdAL7bmnHfahGgC8iqJI9x9FUX3FDBscL6kMHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:28:46.637565Z"},"content_sha256":"fe574e13ef2d01cb87d666092ad0a950d29df0a68fc6d7c219d2b809863b3aa1","schema_version":"1.0","event_id":"sha256:fe574e13ef2d01cb87d666092ad0a950d29df0a68fc6d7c219d2b809863b3aa1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7I6UNVVY42GZCQPGZQ2PLXYCW6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounding the Uncertainty of Graphical Games: The Complexity of Simple Requirements, Pareto and Strong Nash Equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Francesco Scarcello, Gianluigi Greco","submitted_at":"2012-07-04T16:12:21Z","abstract_excerpt":"We investigate the complexity of bounding the uncertainty of graphical games, and we provide new insight into the intrinsic difficulty of computing Nash equilibria. In particular, we show that, if one adds very simple and natural additional requirements to a graphical game, the existence of Nash equilibria is no longer guaranteed, and computing an equilibrium is an intractable problem. Moreover, if stronger equilibrium conditions are required for the game, we get hardness results for the second level of the polynomial hierarchy. Our results offer a clear picture of the complexity of mixed Nash"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1383","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-18T03:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yJGewcy92bCtRUh2Ycteq2xGV3kNvGx4Jw9jDqL4e9Zv5YRt848lf1IhmsO+uKKihSN7IHjQDebRFGVogHJmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:28:46.637891Z"},"content_sha256":"9bcbc7cbea359cc127afc3e200b47d5a322ecc852691cd31c7cce2d1f15c952b","schema_version":"1.0","event_id":"sha256:9bcbc7cbea359cc127afc3e200b47d5a322ecc852691cd31c7cce2d1f15c952b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7I6UNVVY42GZCQPGZQ2PLXYCW6/bundle.json","state_url":"https://pith.science/pith/7I6UNVVY42GZCQPGZQ2PLXYCW6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7I6UNVVY42GZCQPGZQ2PLXYCW6/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-27T20:28:46Z","links":{"resolver":"https://pith.science/pith/7I6UNVVY42GZCQPGZQ2PLXYCW6","bundle":"https://pith.science/pith/7I6UNVVY42GZCQPGZQ2PLXYCW6/bundle.json","state":"https://pith.science/pith/7I6UNVVY42GZCQPGZQ2PLXYCW6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7I6UNVVY42GZCQPGZQ2PLXYCW6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7I6UNVVY42GZCQPGZQ2PLXYCW6","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":"bb867a214044ad8b94c2c504e1003a7a3f9a883c48a21b166435e96815f661b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-07-04T16:12:21Z","title_canon_sha256":"e45b4ae95580c8270ce7550aa73b000941736fe97e0d24549a1c66ab2e23837b"},"schema_version":"1.0","source":{"id":"1207.1383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1383","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1383v1","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1383","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"7I6UNVVY42GZ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7I6UNVVY42GZCQPG","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7I6UNVVY","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:9bcbc7cbea359cc127afc3e200b47d5a322ecc852691cd31c7cce2d1f15c952b","target":"graph","created_at":"2026-05-18T03:51:37Z","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 complexity of bounding the uncertainty of graphical games, and we provide new insight into the intrinsic difficulty of computing Nash equilibria. In particular, we show that, if one adds very simple and natural additional requirements to a graphical game, the existence of Nash equilibria is no longer guaranteed, and computing an equilibrium is an intractable problem. Moreover, if stronger equilibrium conditions are required for the game, we get hardness results for the second level of the polynomial hierarchy. Our results offer a clear picture of the complexity of mixed Nash","authors_text":"Francesco Scarcello, Gianluigi Greco","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-07-04T16:12:21Z","title":"Bounding the Uncertainty of Graphical Games: The Complexity of Simple Requirements, Pareto and Strong Nash Equilibria"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1383","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:fe574e13ef2d01cb87d666092ad0a950d29df0a68fc6d7c219d2b809863b3aa1","target":"record","created_at":"2026-05-18T03:51:37Z","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":"bb867a214044ad8b94c2c504e1003a7a3f9a883c48a21b166435e96815f661b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-07-04T16:12:21Z","title_canon_sha256":"e45b4ae95580c8270ce7550aa73b000941736fe97e0d24549a1c66ab2e23837b"},"schema_version":"1.0","source":{"id":"1207.1383","kind":"arxiv","version":1}},"canonical_sha256":"fa3d46d6b8e68d9141e6cc34f5df02b78db40e1dfa48aa334f0021d4ba4e429b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa3d46d6b8e68d9141e6cc34f5df02b78db40e1dfa48aa334f0021d4ba4e429b","first_computed_at":"2026-05-18T03:51:37.480694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:37.480694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RujoUMT3F7GB29YeI3iuENArgHiTrYNNfLkvxATTxKrJJdGZV/zpmoJp0GeRsNlkPu3t4UtamMfBgpWQy/oKCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:37.481447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe574e13ef2d01cb87d666092ad0a950d29df0a68fc6d7c219d2b809863b3aa1","sha256:9bcbc7cbea359cc127afc3e200b47d5a322ecc852691cd31c7cce2d1f15c952b"],"state_sha256":"c8694791d60985de5a7258e22ac0ba8770aaa3ed1e5e54336abbfb5b0e6b0ac2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UBPogedDgUchS4FpyfQka/ZtE1/a+y23WLMn/yHI3tHqYgFi+vIxfyZuUrAV14IoaADO5kFARtmddjDSXe/JCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T20:28:46.639703Z","bundle_sha256":"9e25f2ca5e33841aa6eeff6cafa73e1dcd23103be79db018a9368dbd190b184f"}}