{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JTDISI2V4VNLVFB6M4723YR4CM","short_pith_number":"pith:JTDISI2V","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"},"canonical_sha256":"4cc6892355e55aba943e673fade23c133ed99b59e8e76902b0e9c4b1b6f040e9","source":{"kind":"arxiv","id":"2605.00268","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.00268","created_at":"2026-05-20T00:04:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.00268v2","created_at":"2026-05-20T00:04:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.00268","created_at":"2026-05-20T00:04:33Z"},{"alias_kind":"pith_short_12","alias_value":"JTDISI2V4VNL","created_at":"2026-05-20T00:04:33Z"},{"alias_kind":"pith_short_16","alias_value":"JTDISI2V4VNLVFB6","created_at":"2026-05-20T00:04:33Z"},{"alias_kind":"pith_short_8","alias_value":"JTDISI2V","created_at":"2026-05-20T00:04:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JTDISI2V4VNLVFB6M4723YR4CM","target":"record","payload":{"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"},"canonical_sha256":"4cc6892355e55aba943e673fade23c133ed99b59e8e76902b0e9c4b1b6f040e9","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"},"source_kind":"arxiv","source_id":"2605.00268","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-20T00:04:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fKar9zly9jS2OaNrCv27q+d8YNK6SSx+YwO/MUQQ452BoZRuSrjdhI6tiMYFjkYOgSzwqm2run08jvRGmPdmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:02:56.450434Z"},"content_sha256":"e857ee818f0e57c96e9bf1579fd0b9784910e66806059a012b3795632bd55fb6","schema_version":"1.0","event_id":"sha256:e857ee818f0e57c96e9bf1579fd0b9784910e66806059a012b3795632bd55fb6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JTDISI2V4VNLVFB6M4723YR4CM","target":"graph","payload":{"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"},"verdict_id":"b1da5bf0-cb55-4373-9b9d-fa7cd4bdd439"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:04:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2upmrnDbPVv7jgLtBpb2pb/zJee6U97ZWtHpFkSrDtrIuJ/PI4gRj67LhemahsLg8Oh/+uqk508PTGJrWD+DBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T16:02:56.451589Z"},"content_sha256":"ce40209ba09e6fd86509344d57dc971d2f7c5e5d2e594f6d02d4f06292a5cfb1","schema_version":"1.0","event_id":"sha256:ce40209ba09e6fd86509344d57dc971d2f7c5e5d2e594f6d02d4f06292a5cfb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JTDISI2V4VNLVFB6M4723YR4CM/bundle.json","state_url":"https://pith.science/pith/JTDISI2V4VNLVFB6M4723YR4CM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JTDISI2V4VNLVFB6M4723YR4CM/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-10T16:02:56Z","links":{"resolver":"https://pith.science/pith/JTDISI2V4VNLVFB6M4723YR4CM","bundle":"https://pith.science/pith/JTDISI2V4VNLVFB6M4723YR4CM/bundle.json","state":"https://pith.science/pith/JTDISI2V4VNLVFB6M4723YR4CM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JTDISI2V4VNLVFB6M4723YR4CM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JTDISI2V4VNLVFB6M4723YR4CM","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":"6de582e0ca74916f1410fe3113a50974eb7c43f79581b4828e6d2f61bb3053c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-04-30T22:04:34Z","title_canon_sha256":"52ab3417deba835c6a89a8fbf9bbfa00fef008db98347794be603f80cf836e6c"},"schema_version":"1.0","source":{"id":"2605.00268","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.00268","created_at":"2026-05-20T00:04:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.00268v2","created_at":"2026-05-20T00:04:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.00268","created_at":"2026-05-20T00:04:33Z"},{"alias_kind":"pith_short_12","alias_value":"JTDISI2V4VNL","created_at":"2026-05-20T00:04:33Z"},{"alias_kind":"pith_short_16","alias_value":"JTDISI2V4VNLVFB6","created_at":"2026-05-20T00:04:33Z"},{"alias_kind":"pith_short_8","alias_value":"JTDISI2V","created_at":"2026-05-20T00:04:33Z"}],"graph_snapshots":[{"event_id":"sha256:ce40209ba09e6fd86509344d57dc971d2f7c5e5d2e594f6d02d4f06292a5cfb1","target":"graph","created_at":"2026-05-20T00:04:33Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The novel Reference-Anchored offline data coverage condition holds and can be verified using a known reference policy rather than the unknown optimum."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"OPMD achieves the first fast Õ(1/n) rate for offline Nash equilibrium learning in α-potential games via a new reference-anchored coverage framework."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Offline Potential Mirror Descent achieves an accelerated Õ(1/n) rate for learning Nash equilibria in α-potential games."}],"snapshot_sha256":"2b7b49907d86c61fe6696e656a2ee5aaab175184c49360d08057335b9f8f58bc"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T18:22:29.269561Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.00268/integrity.json","findings":[],"snapshot_sha256":"d48ea71536116ebe1679e9cb515fe044ee9090d3aea25f05e5bf08fbfe3b8c21","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Claire Chen, Yuheng Zhang","cross_cats":[],"headline":"Offline Potential Mirror Descent achieves an accelerated Õ(1/n) rate for learning Nash equilibria in α-potential games.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-04-30T22:04:34Z","title":"Fast Rates in $\\alpha$-Potential Games via Regularized Mirror Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.00268","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-09T19:24:00.431005Z","id":"b1da5bf0-cb55-4373-9b9d-fa7cd4bdd439","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"Offline Potential Mirror Descent achieves an accelerated Õ(1/n) rate for learning Nash equilibria in α-potential games.","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.","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."}},"verdict_id":"b1da5bf0-cb55-4373-9b9d-fa7cd4bdd439"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e857ee818f0e57c96e9bf1579fd0b9784910e66806059a012b3795632bd55fb6","target":"record","created_at":"2026-05-20T00:04:33Z","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":"6de582e0ca74916f1410fe3113a50974eb7c43f79581b4828e6d2f61bb3053c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-04-30T22:04:34Z","title_canon_sha256":"52ab3417deba835c6a89a8fbf9bbfa00fef008db98347794be603f80cf836e6c"},"schema_version":"1.0","source":{"id":"2605.00268","kind":"arxiv","version":2}},"canonical_sha256":"4cc6892355e55aba943e673fade23c133ed99b59e8e76902b0e9c4b1b6f040e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cc6892355e55aba943e673fade23c133ed99b59e8e76902b0e9c4b1b6f040e9","first_computed_at":"2026-05-20T00:04:33.211088Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:33.211088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9ND0tbzzpeNxmYSeG69phlE/9VxjBYH9UFCi66Egymg9SqA1n6+4hT9zHwhWsRKNBaqDLqoigxOhnJCsZfS6AA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:33.211892Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.00268","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e857ee818f0e57c96e9bf1579fd0b9784910e66806059a012b3795632bd55fb6","sha256:ce40209ba09e6fd86509344d57dc971d2f7c5e5d2e594f6d02d4f06292a5cfb1"],"state_sha256":"ecdfba8b2c5eae2a0a96d0fe34ad4b64a383bf59d7f026092cc3771c7b01e019"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJbEPB+gJvQUtyoqy7v+eWJFBcnN77WvkYkH/jOk1CMY4Okme3VYb8bASePqIU+YUZZX7hVETodMuaS5dYlBAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T16:02:56.456947Z","bundle_sha256":"e5cda94957d2f352125166c00e724ca36337296e42adcf07831eb80497f5e01c"}}