{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RIHU2YBZW47MMFRCORCQ6JEGFG","short_pith_number":"pith:RIHU2YBZ","schema_version":"1.0","canonical_sha256":"8a0f4d6039b73ec6162274450f248629873e55147147ec917ee31c380e5bd81f","source":{"kind":"arxiv","id":"2601.02347","version":3},"attestation_state":"computed","paper":{"title":"Solving Matrix Games with Near-Optimal Matvec Complexity","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":"2026-01-05T18:44:27Z","abstract_excerpt":"We study the problem of computing an $\\epsilon$-approximate Nash equilibrium of a two-player, bilinear game with a bounded payoff matrix $A \\in \\mathbb{R}^{m \\times n}$, when the players' strategies are constrained to lie in simple sets. We provide algorithms which solve this problem in $\\tilde{O}(\\epsilon^{-2/3})$ matrix-vector multiplies (matvecs) in two well-studied cases: $\\ell_1$-$\\ell_1$ (or zero-sum) games, where the players' strategies are both in the probability simplex, and $\\ell_2$-$\\ell_1$ games (encompassing hard-margin SVMs), where the players' strategies are in the unit Euclidea"},"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":"2601.02347","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-01-05T18:44:27Z","cross_cats_sorted":["cs.DS","cs.GT"],"title_canon_sha256":"0d2ca23f12cdae9ba78e8fdc26a8b77455414720123a34f3ece6857fbf1ef452","abstract_canon_sha256":"bb8d44b03d9d5dce85ca1826bf1ebe4a40a27461ebbd25cc7177fa141e60b37d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:13:53.073201Z","signature_b64":"XvFfgpU9A7ZoeDBCuP+F+RLpKbFaNAOZA1sq59IzNse2tszlRRd7nxuiZemPU8S+6JHnXl2TwZUb+Cz0gWpkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a0f4d6039b73ec6162274450f248629873e55147147ec917ee31c380e5bd81f","last_reissued_at":"2026-06-23T03:13:53.072744Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:13:53.072744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Matrix Games with Near-Optimal Matvec Complexity","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":"2026-01-05T18:44:27Z","abstract_excerpt":"We study the problem of computing an $\\epsilon$-approximate Nash equilibrium of a two-player, bilinear game with a bounded payoff matrix $A \\in \\mathbb{R}^{m \\times n}$, when the players' strategies are constrained to lie in simple sets. We provide algorithms which solve this problem in $\\tilde{O}(\\epsilon^{-2/3})$ matrix-vector multiplies (matvecs) in two well-studied cases: $\\ell_1$-$\\ell_1$ (or zero-sum) games, where the players' strategies are both in the probability simplex, and $\\ell_2$-$\\ell_1$ games (encompassing hard-margin SVMs), where the players' strategies are in the unit Euclidea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.02347","kind":"arxiv","version":3},"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/2601.02347/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":"2601.02347","created_at":"2026-06-23T03:13:53.072801+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.02347v3","created_at":"2026-06-23T03:13:53.072801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.02347","created_at":"2026-06-23T03:13:53.072801+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIHU2YBZW47M","created_at":"2026-06-23T03:13:53.072801+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIHU2YBZW47MMFRC","created_at":"2026-06-23T03:13:53.072801+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIHU2YBZ","created_at":"2026-06-23T03:13:53.072801+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/RIHU2YBZW47MMFRCORCQ6JEGFG","json":"https://pith.science/pith/RIHU2YBZW47MMFRCORCQ6JEGFG.json","graph_json":"https://pith.science/api/pith-number/RIHU2YBZW47MMFRCORCQ6JEGFG/graph.json","events_json":"https://pith.science/api/pith-number/RIHU2YBZW47MMFRCORCQ6JEGFG/events.json","paper":"https://pith.science/paper/RIHU2YBZ"},"agent_actions":{"view_html":"https://pith.science/pith/RIHU2YBZW47MMFRCORCQ6JEGFG","download_json":"https://pith.science/pith/RIHU2YBZW47MMFRCORCQ6JEGFG.json","view_paper":"https://pith.science/paper/RIHU2YBZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.02347&json=true","fetch_graph":"https://pith.science/api/pith-number/RIHU2YBZW47MMFRCORCQ6JEGFG/graph.json","fetch_events":"https://pith.science/api/pith-number/RIHU2YBZW47MMFRCORCQ6JEGFG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIHU2YBZW47MMFRCORCQ6JEGFG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIHU2YBZW47MMFRCORCQ6JEGFG/action/storage_attestation","attest_author":"https://pith.science/pith/RIHU2YBZW47MMFRCORCQ6JEGFG/action/author_attestation","sign_citation":"https://pith.science/pith/RIHU2YBZW47MMFRCORCQ6JEGFG/action/citation_signature","submit_replication":"https://pith.science/pith/RIHU2YBZW47MMFRCORCQ6JEGFG/action/replication_record"}},"created_at":"2026-06-23T03:13:53.072801+00:00","updated_at":"2026-06-23T03:13:53.072801+00:00"}