{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LNASORVT3CKFRNQOEQI2QOWQV7","short_pith_number":"pith:LNASORVT","schema_version":"1.0","canonical_sha256":"5b412746b3d89458b60e2411a83ad0afeaa1a600a4b57993f58c66b671f3e974","source":{"kind":"arxiv","id":"1604.07634","version":1},"attestation_state":"computed","paper":{"title":"The Big Match in Small Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Kristoffer Arnsfelt Hansen, Michal Kouck\\'y, Rasmus Ibsen-Jensen","submitted_at":"2016-04-26T11:56:08Z","abstract_excerpt":"In this paper we study how to play (stochastic) games optimally using little space. We focus on repeated games with absorbing states, a type of two-player, zero-sum concurrent mean-payoff games. The prototypical example of these games is the well known Big Match of Gillete (1957). These games may not allow optimal strategies but they always have {\\epsilon}-optimal strategies. In this paper we design {\\epsilon}-optimal strategies for Player 1 in these games that use only O(log log T ) space. Furthermore, we construct strategies for Player 1 that use space s(T), for an arbitrary small unbounded "},"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":"1604.07634","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-04-26T11:56:08Z","cross_cats_sorted":[],"title_canon_sha256":"ec09cde9541c6f714303b594c8fded32eab176f57c7ec3a7b3378e66c27e443e","abstract_canon_sha256":"a9ccd7f110c226f1505c19d18d5f0150dd09b8733704e5565b5845b534bbb243"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:12.468243Z","signature_b64":"C+QcBlX3UzKwG4KEoVGiKoWaFXqpFeyfvJXrbx3q6QYoIQYfguNnvVqlvvbk+GCZaKN5n5hV1BXT12SczBDqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b412746b3d89458b60e2411a83ad0afeaa1a600a4b57993f58c66b671f3e974","last_reissued_at":"2026-05-18T01:16:12.467539Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:12.467539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Big Match in Small Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Kristoffer Arnsfelt Hansen, Michal Kouck\\'y, Rasmus Ibsen-Jensen","submitted_at":"2016-04-26T11:56:08Z","abstract_excerpt":"In this paper we study how to play (stochastic) games optimally using little space. We focus on repeated games with absorbing states, a type of two-player, zero-sum concurrent mean-payoff games. The prototypical example of these games is the well known Big Match of Gillete (1957). These games may not allow optimal strategies but they always have {\\epsilon}-optimal strategies. In this paper we design {\\epsilon}-optimal strategies for Player 1 in these games that use only O(log log T ) space. Furthermore, we construct strategies for Player 1 that use space s(T), for an arbitrary small unbounded "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07634","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":"1604.07634","created_at":"2026-05-18T01:16:12.467646+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07634v1","created_at":"2026-05-18T01:16:12.467646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07634","created_at":"2026-05-18T01:16:12.467646+00:00"},{"alias_kind":"pith_short_12","alias_value":"LNASORVT3CKF","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LNASORVT3CKFRNQO","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LNASORVT","created_at":"2026-05-18T12:30:29.479603+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/LNASORVT3CKFRNQOEQI2QOWQV7","json":"https://pith.science/pith/LNASORVT3CKFRNQOEQI2QOWQV7.json","graph_json":"https://pith.science/api/pith-number/LNASORVT3CKFRNQOEQI2QOWQV7/graph.json","events_json":"https://pith.science/api/pith-number/LNASORVT3CKFRNQOEQI2QOWQV7/events.json","paper":"https://pith.science/paper/LNASORVT"},"agent_actions":{"view_html":"https://pith.science/pith/LNASORVT3CKFRNQOEQI2QOWQV7","download_json":"https://pith.science/pith/LNASORVT3CKFRNQOEQI2QOWQV7.json","view_paper":"https://pith.science/paper/LNASORVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07634&json=true","fetch_graph":"https://pith.science/api/pith-number/LNASORVT3CKFRNQOEQI2QOWQV7/graph.json","fetch_events":"https://pith.science/api/pith-number/LNASORVT3CKFRNQOEQI2QOWQV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LNASORVT3CKFRNQOEQI2QOWQV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LNASORVT3CKFRNQOEQI2QOWQV7/action/storage_attestation","attest_author":"https://pith.science/pith/LNASORVT3CKFRNQOEQI2QOWQV7/action/author_attestation","sign_citation":"https://pith.science/pith/LNASORVT3CKFRNQOEQI2QOWQV7/action/citation_signature","submit_replication":"https://pith.science/pith/LNASORVT3CKFRNQOEQI2QOWQV7/action/replication_record"}},"created_at":"2026-05-18T01:16:12.467646+00:00","updated_at":"2026-05-18T01:16:12.467646+00:00"}