{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:P6IZNDBXXEEVKCKQRN32TEFWQW","short_pith_number":"pith:P6IZNDBX","schema_version":"1.0","canonical_sha256":"7f91968c37b9095509508b77a990b685951b347c342bb18b3b54fe676a17fd10","source":{"kind":"arxiv","id":"1902.03676","version":1},"attestation_state":"computed","paper":{"title":"Playing Games with Bounded Entropy: Convergence Rate and Approximate Equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Amin Gohari, Mehrdad Valizadeh","submitted_at":"2019-02-10T21:55:33Z","abstract_excerpt":"We consider zero-sum repeated games in which the players are restricted to strategies that require only a limited amount of randomness. Let $v_n$ be the max-min value of the $n$ stage game; previous works have characterized $\\lim_{n\\rightarrow\\infty}v_n$, i.e., the long-run max-min value. Our first contribution is to study the convergence rate of $v_n$ to its limit. To this end, we provide a new tool for simulation of a source (target source) from another source (coin source). Considering the total variation distance as the measure of precision, this tool offers an upper bound for the precisio"},"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":"1902.03676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-02-10T21:55:33Z","cross_cats_sorted":[],"title_canon_sha256":"33310dfed712954804b39f492c0af8ba1ed60e2a7a63b0c595ca75379edbbe01","abstract_canon_sha256":"5d45361c235e4e0800f50838e185e337636c87ac12fbf6baf98d610ced2f5674"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:19.957943Z","signature_b64":"1vrJYVU/vwnAp7ln/2E2qQRc1ADZEgNdr0VNH+4gDg7TXEk1lyujTpngV0kbORfdJOhQGGOagoXfJGyPoTxyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f91968c37b9095509508b77a990b685951b347c342bb18b3b54fe676a17fd10","last_reissued_at":"2026-05-17T23:54:19.957016Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:19.957016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Playing Games with Bounded Entropy: Convergence Rate and Approximate Equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Amin Gohari, Mehrdad Valizadeh","submitted_at":"2019-02-10T21:55:33Z","abstract_excerpt":"We consider zero-sum repeated games in which the players are restricted to strategies that require only a limited amount of randomness. Let $v_n$ be the max-min value of the $n$ stage game; previous works have characterized $\\lim_{n\\rightarrow\\infty}v_n$, i.e., the long-run max-min value. Our first contribution is to study the convergence rate of $v_n$ to its limit. To this end, we provide a new tool for simulation of a source (target source) from another source (coin source). Considering the total variation distance as the measure of precision, this tool offers an upper bound for the precisio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03676","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":""},"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":"1902.03676","created_at":"2026-05-17T23:54:19.957177+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.03676v1","created_at":"2026-05-17T23:54:19.957177+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03676","created_at":"2026-05-17T23:54:19.957177+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6IZNDBXXEEV","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6IZNDBXXEEVKCKQ","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6IZNDBX","created_at":"2026-05-18T12:33:24.271573+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/P6IZNDBXXEEVKCKQRN32TEFWQW","json":"https://pith.science/pith/P6IZNDBXXEEVKCKQRN32TEFWQW.json","graph_json":"https://pith.science/api/pith-number/P6IZNDBXXEEVKCKQRN32TEFWQW/graph.json","events_json":"https://pith.science/api/pith-number/P6IZNDBXXEEVKCKQRN32TEFWQW/events.json","paper":"https://pith.science/paper/P6IZNDBX"},"agent_actions":{"view_html":"https://pith.science/pith/P6IZNDBXXEEVKCKQRN32TEFWQW","download_json":"https://pith.science/pith/P6IZNDBXXEEVKCKQRN32TEFWQW.json","view_paper":"https://pith.science/paper/P6IZNDBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.03676&json=true","fetch_graph":"https://pith.science/api/pith-number/P6IZNDBXXEEVKCKQRN32TEFWQW/graph.json","fetch_events":"https://pith.science/api/pith-number/P6IZNDBXXEEVKCKQRN32TEFWQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6IZNDBXXEEVKCKQRN32TEFWQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6IZNDBXXEEVKCKQRN32TEFWQW/action/storage_attestation","attest_author":"https://pith.science/pith/P6IZNDBXXEEVKCKQRN32TEFWQW/action/author_attestation","sign_citation":"https://pith.science/pith/P6IZNDBXXEEVKCKQRN32TEFWQW/action/citation_signature","submit_replication":"https://pith.science/pith/P6IZNDBXXEEVKCKQRN32TEFWQW/action/replication_record"}},"created_at":"2026-05-17T23:54:19.957177+00:00","updated_at":"2026-05-17T23:54:19.957177+00:00"}