{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZYWV7VMJMIQ3TC2XO7QFHCE5VR","short_pith_number":"pith:ZYWV7VMJ","schema_version":"1.0","canonical_sha256":"ce2d5fd5896221b98b5777e053889dac55ac3dd79fa8d2c0db31e6fef8a90c21","source":{"kind":"arxiv","id":"2607.07627","version":1},"attestation_state":"computed","paper":{"title":"Pure Nash Equilibria in Graphical Games of Bounded Width Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.GT"],"primary_cat":"cs.DS","authors_text":"Michael Lampis, Yiren Lu","submitted_at":"2026-07-08T16:43:19Z","abstract_excerpt":"We revisit the complexity of deciding whether a graphical game admits a pure Nash equilibrium (PNE) parameterized by standard measures of the input graph, such as treewidth. The natural dynamic programming algorithm for this problem has parameter dependence $\\alpha^{(\\Delta+1)\\text{tw}}$ where $\\alpha$ is the maximum number of strategies available to each player, each player's utility depends on at most $\\Delta$ other players, and the input graph has width $\\text{tw}$. Our first contribution is to point out that an algorithm by Thomas and van Leeuwen [Algorithmica 2015] claiming to improve thi"},"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":"2607.07627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T16:43:19Z","cross_cats_sorted":["cs.CC","cs.GT"],"title_canon_sha256":"7561704e318a9070399545447fa1baf973ae9a1ebe3b4dec665850f9f44a5ae2","abstract_canon_sha256":"d69c8be4449c0a449dafddd14b2dabab31937c19de970c6aa77df1fd671d5a66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T01:20:37.193980Z","signature_b64":"VhP6TfGh7nT1JUpGFAITkBXCpGpIE5nT/8qS8Kw22POIpP6bD30z134Ua2GW8BjSpkN2CIgEC2/a95+LrJyHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce2d5fd5896221b98b5777e053889dac55ac3dd79fa8d2c0db31e6fef8a90c21","last_reissued_at":"2026-07-09T01:20:37.193550Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T01:20:37.193550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pure Nash Equilibria in Graphical Games of Bounded Width Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.GT"],"primary_cat":"cs.DS","authors_text":"Michael Lampis, Yiren Lu","submitted_at":"2026-07-08T16:43:19Z","abstract_excerpt":"We revisit the complexity of deciding whether a graphical game admits a pure Nash equilibrium (PNE) parameterized by standard measures of the input graph, such as treewidth. The natural dynamic programming algorithm for this problem has parameter dependence $\\alpha^{(\\Delta+1)\\text{tw}}$ where $\\alpha$ is the maximum number of strategies available to each player, each player's utility depends on at most $\\Delta$ other players, and the input graph has width $\\text{tw}$. Our first contribution is to point out that an algorithm by Thomas and van Leeuwen [Algorithmica 2015] claiming to improve thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07627","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/2607.07627/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":"2607.07627","created_at":"2026-07-09T01:20:37.193609+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.07627v1","created_at":"2026-07-09T01:20:37.193609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07627","created_at":"2026-07-09T01:20:37.193609+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYWV7VMJMIQ3","created_at":"2026-07-09T01:20:37.193609+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYWV7VMJMIQ3TC2X","created_at":"2026-07-09T01:20:37.193609+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYWV7VMJ","created_at":"2026-07-09T01:20:37.193609+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/ZYWV7VMJMIQ3TC2XO7QFHCE5VR","json":"https://pith.science/pith/ZYWV7VMJMIQ3TC2XO7QFHCE5VR.json","graph_json":"https://pith.science/api/pith-number/ZYWV7VMJMIQ3TC2XO7QFHCE5VR/graph.json","events_json":"https://pith.science/api/pith-number/ZYWV7VMJMIQ3TC2XO7QFHCE5VR/events.json","paper":"https://pith.science/paper/ZYWV7VMJ"},"agent_actions":{"view_html":"https://pith.science/pith/ZYWV7VMJMIQ3TC2XO7QFHCE5VR","download_json":"https://pith.science/pith/ZYWV7VMJMIQ3TC2XO7QFHCE5VR.json","view_paper":"https://pith.science/paper/ZYWV7VMJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.07627&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYWV7VMJMIQ3TC2XO7QFHCE5VR/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYWV7VMJMIQ3TC2XO7QFHCE5VR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYWV7VMJMIQ3TC2XO7QFHCE5VR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYWV7VMJMIQ3TC2XO7QFHCE5VR/action/storage_attestation","attest_author":"https://pith.science/pith/ZYWV7VMJMIQ3TC2XO7QFHCE5VR/action/author_attestation","sign_citation":"https://pith.science/pith/ZYWV7VMJMIQ3TC2XO7QFHCE5VR/action/citation_signature","submit_replication":"https://pith.science/pith/ZYWV7VMJMIQ3TC2XO7QFHCE5VR/action/replication_record"}},"created_at":"2026-07-09T01:20:37.193609+00:00","updated_at":"2026-07-09T01:20:37.193609+00:00"}