{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JXZZA7LNFGUH4AXZELZ47QGNLS","short_pith_number":"pith:JXZZA7LN","schema_version":"1.0","canonical_sha256":"4df3907d6d29a87e02f922f3cfc0cd5c9e4181bdc9cebbbef99e9c3217bc2731","source":{"kind":"arxiv","id":"1301.5290","version":3},"attestation_state":"computed","paper":{"title":"On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.GT","authors_text":"Fahimeh Ramezani, Kazuhisa Makino, Khaled Elbassioni, Kurt Mehlhorn","submitted_at":"2013-01-22T19:27:17Z","abstract_excerpt":"Given two bounded convex sets $X\\subseteq\\RR^m$ and $Y\\subseteq\\RR^n,$ specified by membership oracles, and a continuous convex-concave function $F:X\\times Y\\to\\RR$, we consider the problem of computing an $\\eps$-approximate saddle point, that is, a pair $(x^*,y^*)\\in X\\times Y$ such that $\\sup_{y\\in Y} F(x^*,y)\\le \\inf_{x\\in\n  X}F(x,y^*)+\\eps.$ Grigoriadis and Khachiyan (1995) gave a simple randomized variant of fictitious play for computing an $\\eps$-approximate saddle point for matrix games, that is, when $F$ is bilinear and the sets $X$ and $Y$ are simplices. In this paper, we extend their"},"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":"1301.5290","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-01-22T19:27:17Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"0a5fdd7eec8a5b5af14f0d693a87af7b8ae0c50b7a390e600afcfff14d3993bf","abstract_canon_sha256":"8944a950451212048c42019914766b83b7a528a542e1b47112a5ae858a861cf4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:56.242296Z","signature_b64":"0x3xLqw55n/wE+ZsDDG3rN+KLawikRI39fnldn4Ih/29YoH1CJvupNmd6k0deIrpCA5x30JggwQVCcPMeaAaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4df3907d6d29a87e02f922f3cfc0cd5c9e4181bdc9cebbbef99e9c3217bc2731","last_reissued_at":"2026-05-18T02:52:56.241564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:56.241564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.GT","authors_text":"Fahimeh Ramezani, Kazuhisa Makino, Khaled Elbassioni, Kurt Mehlhorn","submitted_at":"2013-01-22T19:27:17Z","abstract_excerpt":"Given two bounded convex sets $X\\subseteq\\RR^m$ and $Y\\subseteq\\RR^n,$ specified by membership oracles, and a continuous convex-concave function $F:X\\times Y\\to\\RR$, we consider the problem of computing an $\\eps$-approximate saddle point, that is, a pair $(x^*,y^*)\\in X\\times Y$ such that $\\sup_{y\\in Y} F(x^*,y)\\le \\inf_{x\\in\n  X}F(x,y^*)+\\eps.$ Grigoriadis and Khachiyan (1995) gave a simple randomized variant of fictitious play for computing an $\\eps$-approximate saddle point for matrix games, that is, when $F$ is bilinear and the sets $X$ and $Y$ are simplices. In this paper, we extend their"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5290","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":"1301.5290","created_at":"2026-05-18T02:52:56.241677+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.5290v3","created_at":"2026-05-18T02:52:56.241677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5290","created_at":"2026-05-18T02:52:56.241677+00:00"},{"alias_kind":"pith_short_12","alias_value":"JXZZA7LNFGUH","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JXZZA7LNFGUH4AXZ","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JXZZA7LN","created_at":"2026-05-18T12:27:49.015174+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/JXZZA7LNFGUH4AXZELZ47QGNLS","json":"https://pith.science/pith/JXZZA7LNFGUH4AXZELZ47QGNLS.json","graph_json":"https://pith.science/api/pith-number/JXZZA7LNFGUH4AXZELZ47QGNLS/graph.json","events_json":"https://pith.science/api/pith-number/JXZZA7LNFGUH4AXZELZ47QGNLS/events.json","paper":"https://pith.science/paper/JXZZA7LN"},"agent_actions":{"view_html":"https://pith.science/pith/JXZZA7LNFGUH4AXZELZ47QGNLS","download_json":"https://pith.science/pith/JXZZA7LNFGUH4AXZELZ47QGNLS.json","view_paper":"https://pith.science/paper/JXZZA7LN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.5290&json=true","fetch_graph":"https://pith.science/api/pith-number/JXZZA7LNFGUH4AXZELZ47QGNLS/graph.json","fetch_events":"https://pith.science/api/pith-number/JXZZA7LNFGUH4AXZELZ47QGNLS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JXZZA7LNFGUH4AXZELZ47QGNLS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JXZZA7LNFGUH4AXZELZ47QGNLS/action/storage_attestation","attest_author":"https://pith.science/pith/JXZZA7LNFGUH4AXZELZ47QGNLS/action/author_attestation","sign_citation":"https://pith.science/pith/JXZZA7LNFGUH4AXZELZ47QGNLS/action/citation_signature","submit_replication":"https://pith.science/pith/JXZZA7LNFGUH4AXZELZ47QGNLS/action/replication_record"}},"created_at":"2026-05-18T02:52:56.241677+00:00","updated_at":"2026-05-18T02:52:56.241677+00:00"}