{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:NEFY5VRK2GITFXIADTD7C5KIWJ","short_pith_number":"pith:NEFY5VRK","canonical_record":{"source":{"id":"2509.04426","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-09-04T17:46:48Z","cross_cats_sorted":["cs.DS","cs.GT"],"title_canon_sha256":"1a802c4057f766610a34aaf44dc5c0151501db22bfc6413020f1eac178f36f94","abstract_canon_sha256":"986975e6a89c54e06bf76a9705108c03f1ef856d4c1a7a9bc75d6a77274f1f40"},"schema_version":"1.0"},"canonical_sha256":"690b8ed62ad19132dd001cc7f17548b24112100a0b8e8800c97b8fc35e586cd5","source":{"kind":"arxiv","id":"2509.04426","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.04426","created_at":"2026-06-23T03:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"2509.04426v2","created_at":"2026-06-23T03:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.04426","created_at":"2026-06-23T03:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"NEFY5VRK2GIT","created_at":"2026-06-23T03:13:47Z"},{"alias_kind":"pith_short_16","alias_value":"NEFY5VRK2GITFXIA","created_at":"2026-06-23T03:13:47Z"},{"alias_kind":"pith_short_8","alias_value":"NEFY5VRK","created_at":"2026-06-23T03:13:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:NEFY5VRK2GITFXIADTD7C5KIWJ","target":"record","payload":{"canonical_record":{"source":{"id":"2509.04426","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-09-04T17:46:48Z","cross_cats_sorted":["cs.DS","cs.GT"],"title_canon_sha256":"1a802c4057f766610a34aaf44dc5c0151501db22bfc6413020f1eac178f36f94","abstract_canon_sha256":"986975e6a89c54e06bf76a9705108c03f1ef856d4c1a7a9bc75d6a77274f1f40"},"schema_version":"1.0"},"canonical_sha256":"690b8ed62ad19132dd001cc7f17548b24112100a0b8e8800c97b8fc35e586cd5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:13:47.291900Z","signature_b64":"VAqCnINB2UX06OjXM+MhGNXi1kueFBap+DRlMHwU5t1mayZ1XVxzyQmQAxPH17eaggaTlqh6zbaNalhbvHenBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"690b8ed62ad19132dd001cc7f17548b24112100a0b8e8800c97b8fc35e586cd5","last_reissued_at":"2026-06-23T03:13:47.291407Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:13:47.291407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.04426","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-06-23T03:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EaubB0p51NqClu5kqn2cKuMg+1z7rwmYiubplQzgDI+voKtbHYyp8XkVyKVRAFke68/k2wV4qalAwoXlY6VcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:38:58.586284Z"},"content_sha256":"dba32844162f916c7cb15b68fc9fc4be0fc9344cb643359029ab48021597d663","schema_version":"1.0","event_id":"sha256:dba32844162f916c7cb15b68fc9fc4be0fc9344cb643359029ab48021597d663"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:NEFY5VRK2GITFXIADTD7C5KIWJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.GT"],"primary_cat":"math.OC","authors_text":"Aaron Sidford, Ishani Karmarkar, Liam O'Carroll","submitted_at":"2025-09-04T17:46:48Z","abstract_excerpt":"In this paper we consider the problem of computing an $\\epsilon$-approximate Nash Equilibrium of a zero-sum game in a payoff matrix $A \\in \\mathbb{R}^{m \\times n}$ with $O(1)$-bounded entries given access to a matrix-vector product oracle for $A$ and its transpose $A^\\top$. We provide a deterministic algorithm that solves the problem using $\\tilde{O}(\\epsilon^{-8/9})$-oracle queries, where $\\tilde{O}(\\cdot)$ hides factors polylogarithmic in $m$, $n$, and $\\epsilon^{-1}$. Our result improves upon the state-of-the-art query complexity of $\\tilde{O}(\\epsilon^{-1})$ established by [Nemirovski, 200"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.04426","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.04426/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-23T03:13:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W2mfWtrqjnpprmbXpt6Z5uNMlWvzPhTc3S7APrRCcUk2PDTT60fVPDGK5tJs9yyWelU+EQEZ1QCUi0DSXtvnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:38:58.586670Z"},"content_sha256":"e3d2fcff3149a874144c1d3dd6e6d84209a0ccdebeb893beeccbc923b526448f","schema_version":"1.0","event_id":"sha256:e3d2fcff3149a874144c1d3dd6e6d84209a0ccdebeb893beeccbc923b526448f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEFY5VRK2GITFXIADTD7C5KIWJ/bundle.json","state_url":"https://pith.science/pith/NEFY5VRK2GITFXIADTD7C5KIWJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEFY5VRK2GITFXIADTD7C5KIWJ/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-28T12:38:58Z","links":{"resolver":"https://pith.science/pith/NEFY5VRK2GITFXIADTD7C5KIWJ","bundle":"https://pith.science/pith/NEFY5VRK2GITFXIADTD7C5KIWJ/bundle.json","state":"https://pith.science/pith/NEFY5VRK2GITFXIADTD7C5KIWJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEFY5VRK2GITFXIADTD7C5KIWJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NEFY5VRK2GITFXIADTD7C5KIWJ","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":"986975e6a89c54e06bf76a9705108c03f1ef856d4c1a7a9bc75d6a77274f1f40","cross_cats_sorted":["cs.DS","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-09-04T17:46:48Z","title_canon_sha256":"1a802c4057f766610a34aaf44dc5c0151501db22bfc6413020f1eac178f36f94"},"schema_version":"1.0","source":{"id":"2509.04426","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.04426","created_at":"2026-06-23T03:13:47Z"},{"alias_kind":"arxiv_version","alias_value":"2509.04426v2","created_at":"2026-06-23T03:13:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.04426","created_at":"2026-06-23T03:13:47Z"},{"alias_kind":"pith_short_12","alias_value":"NEFY5VRK2GIT","created_at":"2026-06-23T03:13:47Z"},{"alias_kind":"pith_short_16","alias_value":"NEFY5VRK2GITFXIA","created_at":"2026-06-23T03:13:47Z"},{"alias_kind":"pith_short_8","alias_value":"NEFY5VRK","created_at":"2026-06-23T03:13:47Z"}],"graph_snapshots":[{"event_id":"sha256:e3d2fcff3149a874144c1d3dd6e6d84209a0ccdebeb893beeccbc923b526448f","target":"graph","created_at":"2026-06-23T03:13:47Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.04426/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we consider the problem of computing an $\\epsilon$-approximate Nash Equilibrium of a zero-sum game in a payoff matrix $A \\in \\mathbb{R}^{m \\times n}$ with $O(1)$-bounded entries given access to a matrix-vector product oracle for $A$ and its transpose $A^\\top$. We provide a deterministic algorithm that solves the problem using $\\tilde{O}(\\epsilon^{-8/9})$-oracle queries, where $\\tilde{O}(\\cdot)$ hides factors polylogarithmic in $m$, $n$, and $\\epsilon^{-1}$. Our result improves upon the state-of-the-art query complexity of $\\tilde{O}(\\epsilon^{-1})$ established by [Nemirovski, 200","authors_text":"Aaron Sidford, Ishani Karmarkar, Liam O'Carroll","cross_cats":["cs.DS","cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.04426","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dba32844162f916c7cb15b68fc9fc4be0fc9344cb643359029ab48021597d663","target":"record","created_at":"2026-06-23T03:13:47Z","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":"986975e6a89c54e06bf76a9705108c03f1ef856d4c1a7a9bc75d6a77274f1f40","cross_cats_sorted":["cs.DS","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-09-04T17:46:48Z","title_canon_sha256":"1a802c4057f766610a34aaf44dc5c0151501db22bfc6413020f1eac178f36f94"},"schema_version":"1.0","source":{"id":"2509.04426","kind":"arxiv","version":2}},"canonical_sha256":"690b8ed62ad19132dd001cc7f17548b24112100a0b8e8800c97b8fc35e586cd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"690b8ed62ad19132dd001cc7f17548b24112100a0b8e8800c97b8fc35e586cd5","first_computed_at":"2026-06-23T03:13:47.291407Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T03:13:47.291407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VAqCnINB2UX06OjXM+MhGNXi1kueFBap+DRlMHwU5t1mayZ1XVxzyQmQAxPH17eaggaTlqh6zbaNalhbvHenBw==","signature_status":"signed_v1","signed_at":"2026-06-23T03:13:47.291900Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.04426","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dba32844162f916c7cb15b68fc9fc4be0fc9344cb643359029ab48021597d663","sha256:e3d2fcff3149a874144c1d3dd6e6d84209a0ccdebeb893beeccbc923b526448f"],"state_sha256":"7974c5267f3a891072d086e1a86fe952e7047c0402563bd3088de04985dab5bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JYtyXWmOCN+Xzpvc+i0RgXkkO6gUvMC7vsVQybzK/F49m5KwYnrCPfwEwN7vAv67xvB4kRVuG7z5ZueSayEKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T12:38:58.588629Z","bundle_sha256":"a1a5c085fb2958b545a25b6d00e5862160195929c40638081ce2c29e8f7e0951"}}