{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JTDISI2V4VNLVFB6M4723YR4CM","short_pith_number":"pith:JTDISI2V","schema_version":"1.0","canonical_sha256":"4cc6892355e55aba943e673fade23c133ed99b59e8e76902b0e9c4b1b6f040e9","source":{"kind":"arxiv","id":"2605.00268","version":2},"attestation_state":"computed","paper":{"title":"Fast Rates in $\\alpha$-Potential Games via Regularized Mirror Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Offline Potential Mirror Descent achieves an accelerated Õ(1/n) rate for learning Nash equilibria in α-potential games.","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Claire Chen, Yuheng Zhang","submitted_at":"2026-04-30T22:04:34Z","abstract_excerpt":"An $\\alpha$-potential game is a multi-player non-cooperative interaction in which a global potential function approximates individual player rewards up to a structural bias $\\alpha$. While identifying a Nash Equilibrium (NE) in generic general-sum games is known to be computationally intractable, the potential game structure enables tractable NE identification. In this paper, we study the offline learning of NE in $\\alpha$-potential games using KL regularization. To analyze this process, we propose a novel Reference-Anchored offline data coverage framework--a verifiable condition that anchors "},"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":"2605.00268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-04-30T22:04:34Z","cross_cats_sorted":[],"title_canon_sha256":"52ab3417deba835c6a89a8fbf9bbfa00fef008db98347794be603f80cf836e6c","abstract_canon_sha256":"6de582e0ca74916f1410fe3113a50974eb7c43f79581b4828e6d2f61bb3053c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:33.211892Z","signature_b64":"9ND0tbzzpeNxmYSeG69phlE/9VxjBYH9UFCi66Egymg9SqA1n6+4hT9zHwhWsRKNBaqDLqoigxOhnJCsZfS6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cc6892355e55aba943e673fade23c133ed99b59e8e76902b0e9c4b1b6f040e9","last_reissued_at":"2026-05-20T00:04:33.211088Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:33.211088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Rates in $\\alpha$-Potential Games via Regularized Mirror Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Offline Potential Mirror Descent achieves an accelerated Õ(1/n) rate for learning Nash equilibria in α-potential games.","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Claire Chen, Yuheng Zhang","submitted_at":"2026-04-30T22:04:34Z","abstract_excerpt":"An $\\alpha$-potential game is a multi-player non-cooperative interaction in which a global potential function approximates individual player rewards up to a structural bias $\\alpha$. While identifying a Nash Equilibrium (NE) in generic general-sum games is known to be computationally intractable, the potential game structure enables tractable NE identification. In this paper, we study the offline learning of NE in $\\alpha$-potential games using KL regularization. To analyze this process, we propose a novel Reference-Anchored offline data coverage framework--a verifiable condition that anchors "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"OPMD achieves an accelerated Õ(1/n) statistical rate, surpassing the standard Õ(1/√n) rate typical of offline multi-agent learning, and characterizes the first fast-rate offline learning approach for α-potential games.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The novel Reference-Anchored offline data coverage condition holds and can be verified using a known reference policy rather than the unknown optimum.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"OPMD achieves the first fast Õ(1/n) rate for offline Nash equilibrium learning in α-potential games via a new reference-anchored coverage framework.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Offline Potential Mirror Descent achieves an accelerated Õ(1/n) rate for learning Nash equilibria in α-potential games.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"2b7b49907d86c61fe6696e656a2ee5aaab175184c49360d08057335b9f8f58bc"},"source":{"id":"2605.00268","kind":"arxiv","version":2},"verdict":{"id":"b1da5bf0-cb55-4373-9b9d-fa7cd4bdd439","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-09T19:24:00.431005Z","strongest_claim":"OPMD achieves an accelerated Õ(1/n) statistical rate, surpassing the standard Õ(1/√n) rate typical of offline multi-agent learning, and characterizes the first fast-rate offline learning approach for α-potential games.","one_line_summary":"OPMD achieves the first fast Õ(1/n) rate for offline Nash equilibrium learning in α-potential games via a new reference-anchored coverage framework.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The novel Reference-Anchored offline data coverage condition holds and can be verified using a known reference policy rather than the unknown optimum.","pith_extraction_headline":"Offline Potential Mirror Descent achieves an accelerated Õ(1/n) rate for learning Nash equilibria in α-potential games."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.00268/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T18:22:29.269561Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"d48ea71536116ebe1679e9cb515fe044ee9090d3aea25f05e5bf08fbfe3b8c21"},"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":"2605.00268","created_at":"2026-05-20T00:04:33.211211+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.00268v2","created_at":"2026-05-20T00:04:33.211211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.00268","created_at":"2026-05-20T00:04:33.211211+00:00"},{"alias_kind":"pith_short_12","alias_value":"JTDISI2V4VNL","created_at":"2026-05-20T00:04:33.211211+00:00"},{"alias_kind":"pith_short_16","alias_value":"JTDISI2V4VNLVFB6","created_at":"2026-05-20T00:04:33.211211+00:00"},{"alias_kind":"pith_short_8","alias_value":"JTDISI2V","created_at":"2026-05-20T00:04:33.211211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.00268","citing_title":"Fast Rates in $\\alpha$-Potential Games via Regularized Mirror Descent","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2605.00264","citing_title":"Pessimism-Free Offline Learning in General-Sum Games via KL Regularization","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2605.13025","citing_title":"Offline Two-Player Zero-Sum Markov Games with KL Regularization","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JTDISI2V4VNLVFB6M4723YR4CM","json":"https://pith.science/pith/JTDISI2V4VNLVFB6M4723YR4CM.json","graph_json":"https://pith.science/api/pith-number/JTDISI2V4VNLVFB6M4723YR4CM/graph.json","events_json":"https://pith.science/api/pith-number/JTDISI2V4VNLVFB6M4723YR4CM/events.json","paper":"https://pith.science/paper/JTDISI2V"},"agent_actions":{"view_html":"https://pith.science/pith/JTDISI2V4VNLVFB6M4723YR4CM","download_json":"https://pith.science/pith/JTDISI2V4VNLVFB6M4723YR4CM.json","view_paper":"https://pith.science/paper/JTDISI2V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.00268&json=true","fetch_graph":"https://pith.science/api/pith-number/JTDISI2V4VNLVFB6M4723YR4CM/graph.json","fetch_events":"https://pith.science/api/pith-number/JTDISI2V4VNLVFB6M4723YR4CM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JTDISI2V4VNLVFB6M4723YR4CM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JTDISI2V4VNLVFB6M4723YR4CM/action/storage_attestation","attest_author":"https://pith.science/pith/JTDISI2V4VNLVFB6M4723YR4CM/action/author_attestation","sign_citation":"https://pith.science/pith/JTDISI2V4VNLVFB6M4723YR4CM/action/citation_signature","submit_replication":"https://pith.science/pith/JTDISI2V4VNLVFB6M4723YR4CM/action/replication_record"}},"created_at":"2026-05-20T00:04:33.211211+00:00","updated_at":"2026-05-20T00:04:33.211211+00:00"}