{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WPRYKRPABA42H2KOCBARFIO3HI","short_pith_number":"pith:WPRYKRPA","canonical_record":{"source":{"id":"1405.1481","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-05-07T01:00:07Z","cross_cats_sorted":["cs.GT","econ.TH"],"title_canon_sha256":"b6615ed369c1f49bd5fef02c79be577bdf88c94010cebe899c6812e52d3b11cc","abstract_canon_sha256":"4455515a04bc47f45bf3b550bfd03f22852d46bf9025fad57a4e2a391d4fe357"},"schema_version":"1.0"},"canonical_sha256":"b3e38545e00839a3e94e104112a1db3a0bcbc5a8ded3a84b10b5d423979cc53b","source":{"kind":"arxiv","id":"1405.1481","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1481","created_at":"2026-05-18T00:09:48Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1481v2","created_at":"2026-05-18T00:09:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1481","created_at":"2026-05-18T00:09:48Z"},{"alias_kind":"pith_short_12","alias_value":"WPRYKRPABA42","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WPRYKRPABA42H2KO","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WPRYKRPA","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WPRYKRPABA42H2KOCBARFIO3HI","target":"record","payload":{"canonical_record":{"source":{"id":"1405.1481","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-05-07T01:00:07Z","cross_cats_sorted":["cs.GT","econ.TH"],"title_canon_sha256":"b6615ed369c1f49bd5fef02c79be577bdf88c94010cebe899c6812e52d3b11cc","abstract_canon_sha256":"4455515a04bc47f45bf3b550bfd03f22852d46bf9025fad57a4e2a391d4fe357"},"schema_version":"1.0"},"canonical_sha256":"b3e38545e00839a3e94e104112a1db3a0bcbc5a8ded3a84b10b5d423979cc53b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:48.226703Z","signature_b64":"BN00lis4HYq5M0Z3loI91lLPbwGMV4AEnbF1R4CvEEs2qk471YZuN8z0zvIasK2gLoLonjwgu64yZXresorBBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3e38545e00839a3e94e104112a1db3a0bcbc5a8ded3a84b10b5d423979cc53b","last_reissued_at":"2026-05-18T00:09:48.226067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:48.226067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.1481","source_version":2,"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:09:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LtMJNc5F+XjyDNCR0FnC3F0EjluV/jk7cYJ3iJUK/mbWByk5KIm41mSkjc4gmtY3ZXDkjP6fsV0SCdVzDmfbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:39:56.102684Z"},"content_sha256":"55431e65dfbab18e5a7c8660b48d604ed1cdaa7b1bb28ef9c50529a6bc0aff60","schema_version":"1.0","event_id":"sha256:55431e65dfbab18e5a7c8660b48d604ed1cdaa7b1bb28ef9c50529a6bc0aff60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WPRYKRPABA42H2KOCBARFIO3HI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphical potential games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","econ.TH"],"primary_cat":"math.PR","authors_text":"Omer Tamuz, Yakov Babichenko","submitted_at":"2014-05-07T01:00:07Z","abstract_excerpt":"We study the class of potential games that are also graphical games with respect to a given graph $G$ of connections between the players. We show that, up to strategic equivalence, this class of games can be identified with the set of Markov random fields on $G$.\n  From this characterization, and from the Hammersley-Clifford theorem, it follows that the potentials of such games can be decomposed to local potentials. We use this decomposition to strongly bound the number of strategy changes of a single player along a better response path. This result extends to generalized graphical potential g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1481","kind":"arxiv","version":2},"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:09:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sM1L1RnTRYhtsVzcJ+PZjPZc4IZKU19pn9pZkvRwBWThg77azDuUP9X2LQC+L+nXG2aLAreuyifJQn+DpQcKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:39:56.103038Z"},"content_sha256":"c1418af8520785c644a1068e64d882fe394b7f10d951266bcdadf26d4de0b65d","schema_version":"1.0","event_id":"sha256:c1418af8520785c644a1068e64d882fe394b7f10d951266bcdadf26d4de0b65d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WPRYKRPABA42H2KOCBARFIO3HI/bundle.json","state_url":"https://pith.science/pith/WPRYKRPABA42H2KOCBARFIO3HI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WPRYKRPABA42H2KOCBARFIO3HI/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-05T09:39:56Z","links":{"resolver":"https://pith.science/pith/WPRYKRPABA42H2KOCBARFIO3HI","bundle":"https://pith.science/pith/WPRYKRPABA42H2KOCBARFIO3HI/bundle.json","state":"https://pith.science/pith/WPRYKRPABA42H2KOCBARFIO3HI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WPRYKRPABA42H2KOCBARFIO3HI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WPRYKRPABA42H2KOCBARFIO3HI","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":"4455515a04bc47f45bf3b550bfd03f22852d46bf9025fad57a4e2a391d4fe357","cross_cats_sorted":["cs.GT","econ.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-05-07T01:00:07Z","title_canon_sha256":"b6615ed369c1f49bd5fef02c79be577bdf88c94010cebe899c6812e52d3b11cc"},"schema_version":"1.0","source":{"id":"1405.1481","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1481","created_at":"2026-05-18T00:09:48Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1481v2","created_at":"2026-05-18T00:09:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1481","created_at":"2026-05-18T00:09:48Z"},{"alias_kind":"pith_short_12","alias_value":"WPRYKRPABA42","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WPRYKRPABA42H2KO","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WPRYKRPA","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:c1418af8520785c644a1068e64d882fe394b7f10d951266bcdadf26d4de0b65d","target":"graph","created_at":"2026-05-18T00:09:48Z","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 study the class of potential games that are also graphical games with respect to a given graph $G$ of connections between the players. We show that, up to strategic equivalence, this class of games can be identified with the set of Markov random fields on $G$.\n  From this characterization, and from the Hammersley-Clifford theorem, it follows that the potentials of such games can be decomposed to local potentials. We use this decomposition to strongly bound the number of strategy changes of a single player along a better response path. This result extends to generalized graphical potential g","authors_text":"Omer Tamuz, Yakov Babichenko","cross_cats":["cs.GT","econ.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-05-07T01:00:07Z","title":"Graphical potential games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1481","kind":"arxiv","version":2},"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:55431e65dfbab18e5a7c8660b48d604ed1cdaa7b1bb28ef9c50529a6bc0aff60","target":"record","created_at":"2026-05-18T00:09:48Z","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":"4455515a04bc47f45bf3b550bfd03f22852d46bf9025fad57a4e2a391d4fe357","cross_cats_sorted":["cs.GT","econ.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-05-07T01:00:07Z","title_canon_sha256":"b6615ed369c1f49bd5fef02c79be577bdf88c94010cebe899c6812e52d3b11cc"},"schema_version":"1.0","source":{"id":"1405.1481","kind":"arxiv","version":2}},"canonical_sha256":"b3e38545e00839a3e94e104112a1db3a0bcbc5a8ded3a84b10b5d423979cc53b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3e38545e00839a3e94e104112a1db3a0bcbc5a8ded3a84b10b5d423979cc53b","first_computed_at":"2026-05-18T00:09:48.226067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:48.226067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BN00lis4HYq5M0Z3loI91lLPbwGMV4AEnbF1R4CvEEs2qk471YZuN8z0zvIasK2gLoLonjwgu64yZXresorBBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:48.226703Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1481","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55431e65dfbab18e5a7c8660b48d604ed1cdaa7b1bb28ef9c50529a6bc0aff60","sha256:c1418af8520785c644a1068e64d882fe394b7f10d951266bcdadf26d4de0b65d"],"state_sha256":"110a24404bf0c3ca7439299c76265064b72d521edb48398e32e89f7d37242456"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q46PMt1rbMTQiXsJbhKUN27v+pufSVuC/pebdXVLXQuUg44e22xcmxDMCeidMo1UhTLb2jr2ltkLNa0Kw2tyDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:39:56.104945Z","bundle_sha256":"31a7ec644014d2880b866dd01a4648fe987cd9d42aeadf865851f4c580361498"}}