{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WPRYKRPABA42H2KOCBARFIO3HI","short_pith_number":"pith:WPRYKRPA","schema_version":"1.0","canonical_sha256":"b3e38545e00839a3e94e104112a1db3a0bcbc5a8ded3a84b10b5d423979cc53b","source":{"kind":"arxiv","id":"1405.1481","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.1481","created_at":"2026-05-18T00:09:48.226158+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.1481v2","created_at":"2026-05-18T00:09:48.226158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1481","created_at":"2026-05-18T00:09:48.226158+00:00"},{"alias_kind":"pith_short_12","alias_value":"WPRYKRPABA42","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WPRYKRPABA42H2KO","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WPRYKRPA","created_at":"2026-05-18T12:28:54.890064+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/WPRYKRPABA42H2KOCBARFIO3HI","json":"https://pith.science/pith/WPRYKRPABA42H2KOCBARFIO3HI.json","graph_json":"https://pith.science/api/pith-number/WPRYKRPABA42H2KOCBARFIO3HI/graph.json","events_json":"https://pith.science/api/pith-number/WPRYKRPABA42H2KOCBARFIO3HI/events.json","paper":"https://pith.science/paper/WPRYKRPA"},"agent_actions":{"view_html":"https://pith.science/pith/WPRYKRPABA42H2KOCBARFIO3HI","download_json":"https://pith.science/pith/WPRYKRPABA42H2KOCBARFIO3HI.json","view_paper":"https://pith.science/paper/WPRYKRPA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.1481&json=true","fetch_graph":"https://pith.science/api/pith-number/WPRYKRPABA42H2KOCBARFIO3HI/graph.json","fetch_events":"https://pith.science/api/pith-number/WPRYKRPABA42H2KOCBARFIO3HI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WPRYKRPABA42H2KOCBARFIO3HI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WPRYKRPABA42H2KOCBARFIO3HI/action/storage_attestation","attest_author":"https://pith.science/pith/WPRYKRPABA42H2KOCBARFIO3HI/action/author_attestation","sign_citation":"https://pith.science/pith/WPRYKRPABA42H2KOCBARFIO3HI/action/citation_signature","submit_replication":"https://pith.science/pith/WPRYKRPABA42H2KOCBARFIO3HI/action/replication_record"}},"created_at":"2026-05-18T00:09:48.226158+00:00","updated_at":"2026-05-18T00:09:48.226158+00:00"}