{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:7GL7625FVLQCXHQ5THOZ64S4T5","short_pith_number":"pith:7GL7625F","canonical_record":{"source":{"id":"1008.0530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-08-03T12:11:27Z","cross_cats_sorted":[],"title_canon_sha256":"f500ba50b8ad2bd016628ffdb98aaa8cfa01006ea11279ba2867bc57d8ba9dcc","abstract_canon_sha256":"d43e5e190709f8f622e7008761f23582ab4b314ebefbcce636e5c467d2dcd480"},"schema_version":"1.0"},"canonical_sha256":"f997ff6ba5aae02b9e1d99dd9f725c9f450618c131690734215da4923eb89e73","source":{"kind":"arxiv","id":"1008.0530","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.0530","created_at":"2026-05-18T04:42:42Z"},{"alias_kind":"arxiv_version","alias_value":"1008.0530v1","created_at":"2026-05-18T04:42:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.0530","created_at":"2026-05-18T04:42:42Z"},{"alias_kind":"pith_short_12","alias_value":"7GL7625FVLQC","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"7GL7625FVLQCXHQ5","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"7GL7625F","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:7GL7625FVLQCXHQ5THOZ64S4T5","target":"record","payload":{"canonical_record":{"source":{"id":"1008.0530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-08-03T12:11:27Z","cross_cats_sorted":[],"title_canon_sha256":"f500ba50b8ad2bd016628ffdb98aaa8cfa01006ea11279ba2867bc57d8ba9dcc","abstract_canon_sha256":"d43e5e190709f8f622e7008761f23582ab4b314ebefbcce636e5c467d2dcd480"},"schema_version":"1.0"},"canonical_sha256":"f997ff6ba5aae02b9e1d99dd9f725c9f450618c131690734215da4923eb89e73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:42.809955Z","signature_b64":"t3fbRFd/z6tSSKdgU7WBx2uI1NhQ6Vpe+icNx9GO+ORs1nwscbDFfJO+zEtndfUgpXfcp0jeIsIqxBq48I/gDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f997ff6ba5aae02b9e1d99dd9f725c9f450618c131690734215da4923eb89e73","last_reissued_at":"2026-05-18T04:42:42.809543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:42.809543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.0530","source_version":1,"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-18T04:42:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1GjhUyFPWX28oU/Z0SW8XWCV+VQNfdfiEQk/QpBvlzZjpgSWehVmw3D/laKWd+d1CC7wTzkvPNcZlY6TQZl4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:49:05.099293Z"},"content_sha256":"3803c8f6ee034732088253f4ea356f661de67d526a9fd984349ebfcd9e760d1c","schema_version":"1.0","event_id":"sha256:3803c8f6ee034732088253f4ea356f661de67d526a9fd984349ebfcd9e760d1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:7GL7625FVLQCXHQ5THOZ64S4T5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Peter Bro Miltersen, Thomas Dueholm Hansen, Uri Zwick","submitted_at":"2010-08-03T12:11:27Z","abstract_excerpt":"Ye showed recently that the simplex method with Dantzig pivoting rule, as well as Howard's policy iteration algorithm, solve discounted Markov decision processes (MDPs), with a constant discount factor, in strongly polynomial time. More precisely, Ye showed that both algorithms terminate after at most $O(\\frac{mn}{1-\\gamma}\\log(\\frac{n}{1-\\gamma}))$ iterations, where $n$ is the number of states, $m$ is the total number of actions in the MDP, and $0<\\gamma<1$ is the discount factor. We improve Ye's analysis in two respects. First, we improve the bound given by Ye and show that Howard's policy i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.0530","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"},"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-18T04:42:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SnB6jiATxNxnZewx85skYsLfWUFWMmz5CL1YKvvXNqz19vmhLSYSHh6P0uqfjFuefcy2eMzwuuVXEn78fc2aDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:49:05.099653Z"},"content_sha256":"515c452239ae7be0285de811c6a20c7bc70c6a42b1bdee5335c3e0864a23e26f","schema_version":"1.0","event_id":"sha256:515c452239ae7be0285de811c6a20c7bc70c6a42b1bdee5335c3e0864a23e26f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7GL7625FVLQCXHQ5THOZ64S4T5/bundle.json","state_url":"https://pith.science/pith/7GL7625FVLQCXHQ5THOZ64S4T5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7GL7625FVLQCXHQ5THOZ64S4T5/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-05T12:49:05Z","links":{"resolver":"https://pith.science/pith/7GL7625FVLQCXHQ5THOZ64S4T5","bundle":"https://pith.science/pith/7GL7625FVLQCXHQ5THOZ64S4T5/bundle.json","state":"https://pith.science/pith/7GL7625FVLQCXHQ5THOZ64S4T5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7GL7625FVLQCXHQ5THOZ64S4T5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:7GL7625FVLQCXHQ5THOZ64S4T5","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":"d43e5e190709f8f622e7008761f23582ab4b314ebefbcce636e5c467d2dcd480","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-08-03T12:11:27Z","title_canon_sha256":"f500ba50b8ad2bd016628ffdb98aaa8cfa01006ea11279ba2867bc57d8ba9dcc"},"schema_version":"1.0","source":{"id":"1008.0530","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.0530","created_at":"2026-05-18T04:42:42Z"},{"alias_kind":"arxiv_version","alias_value":"1008.0530v1","created_at":"2026-05-18T04:42:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.0530","created_at":"2026-05-18T04:42:42Z"},{"alias_kind":"pith_short_12","alias_value":"7GL7625FVLQC","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"7GL7625FVLQCXHQ5","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"7GL7625F","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:515c452239ae7be0285de811c6a20c7bc70c6a42b1bdee5335c3e0864a23e26f","target":"graph","created_at":"2026-05-18T04:42:42Z","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":"Ye showed recently that the simplex method with Dantzig pivoting rule, as well as Howard's policy iteration algorithm, solve discounted Markov decision processes (MDPs), with a constant discount factor, in strongly polynomial time. More precisely, Ye showed that both algorithms terminate after at most $O(\\frac{mn}{1-\\gamma}\\log(\\frac{n}{1-\\gamma}))$ iterations, where $n$ is the number of states, $m$ is the total number of actions in the MDP, and $0<\\gamma<1$ is the discount factor. We improve Ye's analysis in two respects. First, we improve the bound given by Ye and show that Howard's policy i","authors_text":"Peter Bro Miltersen, Thomas Dueholm Hansen, Uri Zwick","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-08-03T12:11:27Z","title":"Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.0530","kind":"arxiv","version":1},"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:3803c8f6ee034732088253f4ea356f661de67d526a9fd984349ebfcd9e760d1c","target":"record","created_at":"2026-05-18T04:42:42Z","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":"d43e5e190709f8f622e7008761f23582ab4b314ebefbcce636e5c467d2dcd480","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-08-03T12:11:27Z","title_canon_sha256":"f500ba50b8ad2bd016628ffdb98aaa8cfa01006ea11279ba2867bc57d8ba9dcc"},"schema_version":"1.0","source":{"id":"1008.0530","kind":"arxiv","version":1}},"canonical_sha256":"f997ff6ba5aae02b9e1d99dd9f725c9f450618c131690734215da4923eb89e73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f997ff6ba5aae02b9e1d99dd9f725c9f450618c131690734215da4923eb89e73","first_computed_at":"2026-05-18T04:42:42.809543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:42.809543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t3fbRFd/z6tSSKdgU7WBx2uI1NhQ6Vpe+icNx9GO+ORs1nwscbDFfJO+zEtndfUgpXfcp0jeIsIqxBq48I/gDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:42.809955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.0530","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3803c8f6ee034732088253f4ea356f661de67d526a9fd984349ebfcd9e760d1c","sha256:515c452239ae7be0285de811c6a20c7bc70c6a42b1bdee5335c3e0864a23e26f"],"state_sha256":"b61f090d214b54338dcd8368d64cdbdc5d943233eb72c6d66e3675feff29408e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XGRN5/J6X1yCErC8TNzt8mH/80MhBdESISsjQhvQSkzLuBVAZBINGiHtMl9cC9G5EOalgvwzFjyLNOiL8h1bAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:49:05.101618Z","bundle_sha256":"bbb11e90e5868765d6f57db3233b8d48a87bdf5f85a57f14ac82a3e65c650b90"}}