{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QOV3XPRUCAUDZVFJSBMFCPKRV4","short_pith_number":"pith:QOV3XPRU","schema_version":"1.0","canonical_sha256":"83abbbbe3410283cd4a99058513d51af230f7738a6da21e3654e2c54b3d0d19a","source":{"kind":"arxiv","id":"1011.2787","version":3},"attestation_state":"computed","paper":{"title":"Parallel approximation of min-max problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Gus Gutoski, Xiaodi Wu","submitted_at":"2010-11-11T22:39:13Z","abstract_excerpt":"This paper presents an efficient parallel approximation scheme for a new class of min-max problems. The algorithm is derived from the matrix multiplicative weights update method and can be used to find near-optimal strategies for competitive two-party classical or quantum interactions in which a referee exchanges any number of messages with one party followed by any number of additional messages with the other. It considerably extends the class of interactions which admit parallel solutions, demonstrating for the first time the existence of a parallel algorithm for an interaction in which one "},"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":"1011.2787","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-11-11T22:39:13Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0fb305c2e4ff9aa6a1e212cb0f0fd956afa184760d512ca395641f5d0354fc40","abstract_canon_sha256":"29c81983d6ddf09c796ed64a69707c3f5b7c17176647f5a6086381556a8b9682"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:36.943183Z","signature_b64":"RPjnHVOHjeSl9Awvt5Rb37xp5TLXvOSV4FRYEyXXIoqg/LBEV8Se3qzuePfsrFExmBDr89yYQ0WbMWbiWTJuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83abbbbe3410283cd4a99058513d51af230f7738a6da21e3654e2c54b3d0d19a","last_reissued_at":"2026-05-18T02:23:36.942663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:36.942663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel approximation of min-max problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Gus Gutoski, Xiaodi Wu","submitted_at":"2010-11-11T22:39:13Z","abstract_excerpt":"This paper presents an efficient parallel approximation scheme for a new class of min-max problems. The algorithm is derived from the matrix multiplicative weights update method and can be used to find near-optimal strategies for competitive two-party classical or quantum interactions in which a referee exchanges any number of messages with one party followed by any number of additional messages with the other. It considerably extends the class of interactions which admit parallel solutions, demonstrating for the first time the existence of a parallel algorithm for an interaction in which one "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2787","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":""},"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":"1011.2787","created_at":"2026-05-18T02:23:36.942756+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.2787v3","created_at":"2026-05-18T02:23:36.942756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2787","created_at":"2026-05-18T02:23:36.942756+00:00"},{"alias_kind":"pith_short_12","alias_value":"QOV3XPRUCAUD","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"QOV3XPRUCAUDZVFJ","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"QOV3XPRU","created_at":"2026-05-18T12:26:12.377268+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/QOV3XPRUCAUDZVFJSBMFCPKRV4","json":"https://pith.science/pith/QOV3XPRUCAUDZVFJSBMFCPKRV4.json","graph_json":"https://pith.science/api/pith-number/QOV3XPRUCAUDZVFJSBMFCPKRV4/graph.json","events_json":"https://pith.science/api/pith-number/QOV3XPRUCAUDZVFJSBMFCPKRV4/events.json","paper":"https://pith.science/paper/QOV3XPRU"},"agent_actions":{"view_html":"https://pith.science/pith/QOV3XPRUCAUDZVFJSBMFCPKRV4","download_json":"https://pith.science/pith/QOV3XPRUCAUDZVFJSBMFCPKRV4.json","view_paper":"https://pith.science/paper/QOV3XPRU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.2787&json=true","fetch_graph":"https://pith.science/api/pith-number/QOV3XPRUCAUDZVFJSBMFCPKRV4/graph.json","fetch_events":"https://pith.science/api/pith-number/QOV3XPRUCAUDZVFJSBMFCPKRV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QOV3XPRUCAUDZVFJSBMFCPKRV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QOV3XPRUCAUDZVFJSBMFCPKRV4/action/storage_attestation","attest_author":"https://pith.science/pith/QOV3XPRUCAUDZVFJSBMFCPKRV4/action/author_attestation","sign_citation":"https://pith.science/pith/QOV3XPRUCAUDZVFJSBMFCPKRV4/action/citation_signature","submit_replication":"https://pith.science/pith/QOV3XPRUCAUDZVFJSBMFCPKRV4/action/replication_record"}},"created_at":"2026-05-18T02:23:36.942756+00:00","updated_at":"2026-05-18T02:23:36.942756+00:00"}