{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NEFY5VRK2GITFXIADTD7C5KIWJ","short_pith_number":"pith:NEFY5VRK","schema_version":"1.0","canonical_sha256":"690b8ed62ad19132dd001cc7f17548b24112100a0b8e8800c97b8fc35e586cd5","source":{"kind":"arxiv","id":"2509.04426","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2509.04426","created_at":"2026-06-23T03:13:47.291466+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.04426v2","created_at":"2026-06-23T03:13:47.291466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.04426","created_at":"2026-06-23T03:13:47.291466+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEFY5VRK2GIT","created_at":"2026-06-23T03:13:47.291466+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEFY5VRK2GITFXIA","created_at":"2026-06-23T03:13:47.291466+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEFY5VRK","created_at":"2026-06-23T03:13:47.291466+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/NEFY5VRK2GITFXIADTD7C5KIWJ","json":"https://pith.science/pith/NEFY5VRK2GITFXIADTD7C5KIWJ.json","graph_json":"https://pith.science/api/pith-number/NEFY5VRK2GITFXIADTD7C5KIWJ/graph.json","events_json":"https://pith.science/api/pith-number/NEFY5VRK2GITFXIADTD7C5KIWJ/events.json","paper":"https://pith.science/paper/NEFY5VRK"},"agent_actions":{"view_html":"https://pith.science/pith/NEFY5VRK2GITFXIADTD7C5KIWJ","download_json":"https://pith.science/pith/NEFY5VRK2GITFXIADTD7C5KIWJ.json","view_paper":"https://pith.science/paper/NEFY5VRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.04426&json=true","fetch_graph":"https://pith.science/api/pith-number/NEFY5VRK2GITFXIADTD7C5KIWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/NEFY5VRK2GITFXIADTD7C5KIWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEFY5VRK2GITFXIADTD7C5KIWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEFY5VRK2GITFXIADTD7C5KIWJ/action/storage_attestation","attest_author":"https://pith.science/pith/NEFY5VRK2GITFXIADTD7C5KIWJ/action/author_attestation","sign_citation":"https://pith.science/pith/NEFY5VRK2GITFXIADTD7C5KIWJ/action/citation_signature","submit_replication":"https://pith.science/pith/NEFY5VRK2GITFXIADTD7C5KIWJ/action/replication_record"}},"created_at":"2026-06-23T03:13:47.291466+00:00","updated_at":"2026-06-23T03:13:47.291466+00:00"}