{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MSVR7MZ2G5NCOYE7I7VHVKZXSJ","short_pith_number":"pith:MSVR7MZ2","schema_version":"1.0","canonical_sha256":"64ab1fb33a375a27609f47ea7aab37927e35ad5c2398146600cefda1d24c6ede","source":{"kind":"arxiv","id":"2606.29012","version":1},"attestation_state":"computed","paper":{"title":"The Game Changer Problem: Controlling Equilibria with Discrete Rewards","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Brandon Han, Shiyun Cheng, Xiaojin Zhu, Young Wu","submitted_at":"2026-06-27T17:17:54Z","abstract_excerpt":"We introduce the game changer problem, where an external designer modifies a game's reward matrix to make a target pure action profile the unique equilibrium, subject to the constraint that all entries of the reward matrix come from a finite set. We give simple feasibility characterizations for two-player zero-sum games and general-sum games, and the discrete reward structure yields exact optimality and enables efficient dynamic programming algorithms, providing a sharper alternative to prior continuous reward redesign formulations based on linear programming."},"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":"2606.29012","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-06-27T17:17:54Z","cross_cats_sorted":[],"title_canon_sha256":"bf714b4beb782ea3fede8031b2fadadca32c0b84feb9aa446c25a33b67c64b6b","abstract_canon_sha256":"80cba358a112db0e836a00329c32afdc87ad6c9a9ad19a0700923af5ba061858"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:17:49.430267Z","signature_b64":"aBoh4pU52LucBP29wMaUgknc6BQhrytdRA3TofKM93VHXakVRMeuYXKiy66mX6NlxX7AXwq6IPuHCuuTmPPHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64ab1fb33a375a27609f47ea7aab37927e35ad5c2398146600cefda1d24c6ede","last_reissued_at":"2026-06-30T01:17:49.429680Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:17:49.429680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Game Changer Problem: Controlling Equilibria with Discrete Rewards","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Brandon Han, Shiyun Cheng, Xiaojin Zhu, Young Wu","submitted_at":"2026-06-27T17:17:54Z","abstract_excerpt":"We introduce the game changer problem, where an external designer modifies a game's reward matrix to make a target pure action profile the unique equilibrium, subject to the constraint that all entries of the reward matrix come from a finite set. We give simple feasibility characterizations for two-player zero-sum games and general-sum games, and the discrete reward structure yields exact optimality and enables efficient dynamic programming algorithms, providing a sharper alternative to prior continuous reward redesign formulations based on linear programming."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29012","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/2606.29012/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.29012","created_at":"2026-06-30T01:17:49.429763+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.29012v1","created_at":"2026-06-30T01:17:49.429763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29012","created_at":"2026-06-30T01:17:49.429763+00:00"},{"alias_kind":"pith_short_12","alias_value":"MSVR7MZ2G5NC","created_at":"2026-06-30T01:17:49.429763+00:00"},{"alias_kind":"pith_short_16","alias_value":"MSVR7MZ2G5NCOYE7","created_at":"2026-06-30T01:17:49.429763+00:00"},{"alias_kind":"pith_short_8","alias_value":"MSVR7MZ2","created_at":"2026-06-30T01:17:49.429763+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/MSVR7MZ2G5NCOYE7I7VHVKZXSJ","json":"https://pith.science/pith/MSVR7MZ2G5NCOYE7I7VHVKZXSJ.json","graph_json":"https://pith.science/api/pith-number/MSVR7MZ2G5NCOYE7I7VHVKZXSJ/graph.json","events_json":"https://pith.science/api/pith-number/MSVR7MZ2G5NCOYE7I7VHVKZXSJ/events.json","paper":"https://pith.science/paper/MSVR7MZ2"},"agent_actions":{"view_html":"https://pith.science/pith/MSVR7MZ2G5NCOYE7I7VHVKZXSJ","download_json":"https://pith.science/pith/MSVR7MZ2G5NCOYE7I7VHVKZXSJ.json","view_paper":"https://pith.science/paper/MSVR7MZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.29012&json=true","fetch_graph":"https://pith.science/api/pith-number/MSVR7MZ2G5NCOYE7I7VHVKZXSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/MSVR7MZ2G5NCOYE7I7VHVKZXSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MSVR7MZ2G5NCOYE7I7VHVKZXSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MSVR7MZ2G5NCOYE7I7VHVKZXSJ/action/storage_attestation","attest_author":"https://pith.science/pith/MSVR7MZ2G5NCOYE7I7VHVKZXSJ/action/author_attestation","sign_citation":"https://pith.science/pith/MSVR7MZ2G5NCOYE7I7VHVKZXSJ/action/citation_signature","submit_replication":"https://pith.science/pith/MSVR7MZ2G5NCOYE7I7VHVKZXSJ/action/replication_record"}},"created_at":"2026-06-30T01:17:49.429763+00:00","updated_at":"2026-06-30T01:17:49.429763+00:00"}