{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:N56LGAHIZ7G347HQ6OLCQQ3HSW","short_pith_number":"pith:N56LGAHI","canonical_record":{"source":{"id":"1112.5255","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-12-22T09:29:05Z","cross_cats_sorted":[],"title_canon_sha256":"652c8274c8a252d05475416fe69a22b824d6bebff6f1f9154615c2ed537d2647","abstract_canon_sha256":"b4b2edaee66eac12ad6d38eec891e76031dd7ed174377364511f8a3a33228de6"},"schema_version":"1.0"},"canonical_sha256":"6f7cb300e8cfcdbe7cf0f396284367959ee1ab35133532539779d924415ee452","source":{"kind":"arxiv","id":"1112.5255","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5255","created_at":"2026-05-18T03:59:39Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5255v3","created_at":"2026-05-18T03:59:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5255","created_at":"2026-05-18T03:59:39Z"},{"alias_kind":"pith_short_12","alias_value":"N56LGAHIZ7G3","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"N56LGAHIZ7G347HQ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"N56LGAHI","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:N56LGAHIZ7G347HQ6OLCQQ3HSW","target":"record","payload":{"canonical_record":{"source":{"id":"1112.5255","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-12-22T09:29:05Z","cross_cats_sorted":[],"title_canon_sha256":"652c8274c8a252d05475416fe69a22b824d6bebff6f1f9154615c2ed537d2647","abstract_canon_sha256":"b4b2edaee66eac12ad6d38eec891e76031dd7ed174377364511f8a3a33228de6"},"schema_version":"1.0"},"canonical_sha256":"6f7cb300e8cfcdbe7cf0f396284367959ee1ab35133532539779d924415ee452","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:39.750272Z","signature_b64":"hUNgaSUFVtkjtblsA8adxMdPpgsEkv2I/vCWNsCxSI90i0TzKNdWjJoUcOEbFrr/du/A8vJhZRfvI9cJtvJUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f7cb300e8cfcdbe7cf0f396284367959ee1ab35133532539779d924415ee452","last_reissued_at":"2026-05-18T03:59:39.749597Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:39.749597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.5255","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:59:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sr2nwZ9O8z15PocRGL46/ClmPSnidHB0+lq3SxHlN27phY0WbM1ScGE7EjpM+eDp39vgseXJeFys58PFeYO6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:03:15.884158Z"},"content_sha256":"17bc28f4a13507563589a029a9531478d9c41d492bbc69f8df67f55de40a2fce","schema_version":"1.0","event_id":"sha256:17bc28f4a13507563589a029a9531478d9c41d492bbc69f8df67f55de40a2fce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:N56LGAHIZ7G347HQ6OLCQQ3HSW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving simple stochastic games with few coin toss positions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Peter Bro Miltersen, Rasmus Ibsen-Jensen","submitted_at":"2011-12-22T09:29:05Z","abstract_excerpt":"Gimbert and Horn gave an algorithm for solving simple stochastic games with running time O(r! n) where n is the number of positions of the simple stochastic game and r is the number of its coin toss positions. Chatterjee et al. pointed out that a variant of strategy iteration can be implemented to solve this problem in time 4^r r^{O(1)} n^{O(1)}. In this paper, we show that an algorithm combining value iteration with retrograde analysis achieves a time bound of O(r 2^r (r log r + n)), thus improving both time bounds. While the algorithm is simple, the analysis leading to this time bound is inv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5255","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:59:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3//izCz67FsRtXg4LxWm1esPfxaNB5i+1SvJ5DiYCCsLG78WFAEr2tvgxyEZ4DamK7RtrsN3pDjDJj/AiqEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:03:15.884527Z"},"content_sha256":"18abda82006de8fdf340146647855f2b0162dcb3b887f328bf3c4ee8bfc2ac20","schema_version":"1.0","event_id":"sha256:18abda82006de8fdf340146647855f2b0162dcb3b887f328bf3c4ee8bfc2ac20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N56LGAHIZ7G347HQ6OLCQQ3HSW/bundle.json","state_url":"https://pith.science/pith/N56LGAHIZ7G347HQ6OLCQQ3HSW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N56LGAHIZ7G347HQ6OLCQQ3HSW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T23:03:15Z","links":{"resolver":"https://pith.science/pith/N56LGAHIZ7G347HQ6OLCQQ3HSW","bundle":"https://pith.science/pith/N56LGAHIZ7G347HQ6OLCQQ3HSW/bundle.json","state":"https://pith.science/pith/N56LGAHIZ7G347HQ6OLCQQ3HSW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N56LGAHIZ7G347HQ6OLCQQ3HSW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:N56LGAHIZ7G347HQ6OLCQQ3HSW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b4b2edaee66eac12ad6d38eec891e76031dd7ed174377364511f8a3a33228de6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-12-22T09:29:05Z","title_canon_sha256":"652c8274c8a252d05475416fe69a22b824d6bebff6f1f9154615c2ed537d2647"},"schema_version":"1.0","source":{"id":"1112.5255","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.5255","created_at":"2026-05-18T03:59:39Z"},{"alias_kind":"arxiv_version","alias_value":"1112.5255v3","created_at":"2026-05-18T03:59:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5255","created_at":"2026-05-18T03:59:39Z"},{"alias_kind":"pith_short_12","alias_value":"N56LGAHIZ7G3","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"N56LGAHIZ7G347HQ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"N56LGAHI","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:18abda82006de8fdf340146647855f2b0162dcb3b887f328bf3c4ee8bfc2ac20","target":"graph","created_at":"2026-05-18T03:59:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Gimbert and Horn gave an algorithm for solving simple stochastic games with running time O(r! n) where n is the number of positions of the simple stochastic game and r is the number of its coin toss positions. Chatterjee et al. pointed out that a variant of strategy iteration can be implemented to solve this problem in time 4^r r^{O(1)} n^{O(1)}. In this paper, we show that an algorithm combining value iteration with retrograde analysis achieves a time bound of O(r 2^r (r log r + n)), thus improving both time bounds. While the algorithm is simple, the analysis leading to this time bound is inv","authors_text":"Peter Bro Miltersen, Rasmus Ibsen-Jensen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-12-22T09:29:05Z","title":"Solving simple stochastic games with few coin toss positions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5255","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:17bc28f4a13507563589a029a9531478d9c41d492bbc69f8df67f55de40a2fce","target":"record","created_at":"2026-05-18T03:59:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b4b2edaee66eac12ad6d38eec891e76031dd7ed174377364511f8a3a33228de6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-12-22T09:29:05Z","title_canon_sha256":"652c8274c8a252d05475416fe69a22b824d6bebff6f1f9154615c2ed537d2647"},"schema_version":"1.0","source":{"id":"1112.5255","kind":"arxiv","version":3}},"canonical_sha256":"6f7cb300e8cfcdbe7cf0f396284367959ee1ab35133532539779d924415ee452","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f7cb300e8cfcdbe7cf0f396284367959ee1ab35133532539779d924415ee452","first_computed_at":"2026-05-18T03:59:39.749597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:39.749597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hUNgaSUFVtkjtblsA8adxMdPpgsEkv2I/vCWNsCxSI90i0TzKNdWjJoUcOEbFrr/du/A8vJhZRfvI9cJtvJUBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:39.750272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.5255","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17bc28f4a13507563589a029a9531478d9c41d492bbc69f8df67f55de40a2fce","sha256:18abda82006de8fdf340146647855f2b0162dcb3b887f328bf3c4ee8bfc2ac20"],"state_sha256":"99924e213c7dc32153ea3cb646cb8d833f6eb0ff576bce96eac0953f5551ac43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bXwVUqliZlj4O/OTLRd20IiPd9X14UZi4uZbISm9+nA1uv4fw6akAEt4uR+2L4POchoUY0AEx6wEVQ5e9ja0AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:03:15.886655Z","bundle_sha256":"117576572566536cca14c63fea970b0f7982c442df5ef677e8f80561082d727c"}}