{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ERSLHV36VJUNCZYYGCJGR4YPDX","short_pith_number":"pith:ERSLHV36","schema_version":"1.0","canonical_sha256":"2464b3d77eaa68d16718309268f30f1df31e5cdc98d831979731e441a896b4b5","source":{"kind":"arxiv","id":"2301.03763","version":1},"attestation_state":"computed","paper":{"title":"Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"quant-ph","authors_text":"Aaron Sidford, Adam Bouland, Kevin Tian, Yosheb Getachew, Yujia Jin","submitted_at":"2023-01-10T02:56:49Z","abstract_excerpt":"We give a quantum algorithm for computing an $\\epsilon$-approximate Nash equilibrium of a zero-sum game in a $m \\times n$ payoff matrix with bounded entries. Given a standard quantum oracle for accessing the payoff matrix our algorithm runs in time $\\widetilde{O}(\\sqrt{m + n}\\cdot \\epsilon^{-2.5} + \\epsilon^{-3})$ and outputs a classical representation of the $\\epsilon$-approximate Nash equilibrium. This improves upon the best prior quantum runtime of $\\widetilde{O}(\\sqrt{m + n} \\cdot \\epsilon^{-3})$ obtained by [vAG19] and the classic $\\widetilde{O}((m + n) \\cdot \\epsilon^{-2})$ runtime due t"},"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":"2301.03763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-01-10T02:56:49Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"15edc304343febb0bce18675920c7acb0d71bb07f9fd940a01f9423bbfb8b564","abstract_canon_sha256":"ca0de74e9a21944fdf5d9dd01c1157f29e5f97825a93e20d72231a1adca5c515"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:32:05.453257Z","signature_b64":"CEXM8EcyX7gx4bFOBCpHlymVW76SylOHvq6SnT69y39vagE1YTsdM/rkgQ1o/+iYkl4i+tUOu00erSuN+k3JCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2464b3d77eaa68d16718309268f30f1df31e5cdc98d831979731e441a896b4b5","last_reissued_at":"2026-07-05T05:32:05.452832Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:32:05.452832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"quant-ph","authors_text":"Aaron Sidford, Adam Bouland, Kevin Tian, Yosheb Getachew, Yujia Jin","submitted_at":"2023-01-10T02:56:49Z","abstract_excerpt":"We give a quantum algorithm for computing an $\\epsilon$-approximate Nash equilibrium of a zero-sum game in a $m \\times n$ payoff matrix with bounded entries. Given a standard quantum oracle for accessing the payoff matrix our algorithm runs in time $\\widetilde{O}(\\sqrt{m + n}\\cdot \\epsilon^{-2.5} + \\epsilon^{-3})$ and outputs a classical representation of the $\\epsilon$-approximate Nash equilibrium. This improves upon the best prior quantum runtime of $\\widetilde{O}(\\sqrt{m + n} \\cdot \\epsilon^{-3})$ obtained by [vAG19] and the classic $\\widetilde{O}((m + n) \\cdot \\epsilon^{-2})$ runtime due t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.03763","kind":"arxiv","version":1},"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/2301.03763/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":"2301.03763","created_at":"2026-07-05T05:32:05.452888+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.03763v1","created_at":"2026-07-05T05:32:05.452888+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.03763","created_at":"2026-07-05T05:32:05.452888+00:00"},{"alias_kind":"pith_short_12","alias_value":"ERSLHV36VJUN","created_at":"2026-07-05T05:32:05.452888+00:00"},{"alias_kind":"pith_short_16","alias_value":"ERSLHV36VJUNCZYY","created_at":"2026-07-05T05:32:05.452888+00:00"},{"alias_kind":"pith_short_8","alias_value":"ERSLHV36","created_at":"2026-07-05T05:32:05.452888+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04438","citing_title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ERSLHV36VJUNCZYYGCJGR4YPDX","json":"https://pith.science/pith/ERSLHV36VJUNCZYYGCJGR4YPDX.json","graph_json":"https://pith.science/api/pith-number/ERSLHV36VJUNCZYYGCJGR4YPDX/graph.json","events_json":"https://pith.science/api/pith-number/ERSLHV36VJUNCZYYGCJGR4YPDX/events.json","paper":"https://pith.science/paper/ERSLHV36"},"agent_actions":{"view_html":"https://pith.science/pith/ERSLHV36VJUNCZYYGCJGR4YPDX","download_json":"https://pith.science/pith/ERSLHV36VJUNCZYYGCJGR4YPDX.json","view_paper":"https://pith.science/paper/ERSLHV36","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.03763&json=true","fetch_graph":"https://pith.science/api/pith-number/ERSLHV36VJUNCZYYGCJGR4YPDX/graph.json","fetch_events":"https://pith.science/api/pith-number/ERSLHV36VJUNCZYYGCJGR4YPDX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ERSLHV36VJUNCZYYGCJGR4YPDX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ERSLHV36VJUNCZYYGCJGR4YPDX/action/storage_attestation","attest_author":"https://pith.science/pith/ERSLHV36VJUNCZYYGCJGR4YPDX/action/author_attestation","sign_citation":"https://pith.science/pith/ERSLHV36VJUNCZYYGCJGR4YPDX/action/citation_signature","submit_replication":"https://pith.science/pith/ERSLHV36VJUNCZYYGCJGR4YPDX/action/replication_record"}},"created_at":"2026-07-05T05:32:05.452888+00:00","updated_at":"2026-07-05T05:32:05.452888+00:00"}