{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JRLPXI6MKDBL2P3MA3GCLB6Q32","short_pith_number":"pith:JRLPXI6M","canonical_record":{"source":{"id":"1905.06577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-16T07:43:47Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"75db96d41c52d6a1c86457cf123b18eecd7ac8f46af5b2c2af29b6b3de2c3a7a","abstract_canon_sha256":"e77853c76703293f08fb251afa35d5e66d16bef805ef5bddfdedc20c0844b657"},"schema_version":"1.0"},"canonical_sha256":"4c56fba3cc50c2bd3f6c06cc2587d0deaa054dc5ad2ec4e125925946c71c2462","source":{"kind":"arxiv","id":"1905.06577","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.06577","created_at":"2026-05-17T23:46:01Z"},{"alias_kind":"arxiv_version","alias_value":"1905.06577v1","created_at":"2026-05-17T23:46:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06577","created_at":"2026-05-17T23:46:01Z"},{"alias_kind":"pith_short_12","alias_value":"JRLPXI6MKDBL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JRLPXI6MKDBL2P3M","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JRLPXI6M","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JRLPXI6MKDBL2P3MA3GCLB6Q32","target":"record","payload":{"canonical_record":{"source":{"id":"1905.06577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-16T07:43:47Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"75db96d41c52d6a1c86457cf123b18eecd7ac8f46af5b2c2af29b6b3de2c3a7a","abstract_canon_sha256":"e77853c76703293f08fb251afa35d5e66d16bef805ef5bddfdedc20c0844b657"},"schema_version":"1.0"},"canonical_sha256":"4c56fba3cc50c2bd3f6c06cc2587d0deaa054dc5ad2ec4e125925946c71c2462","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:01.831789Z","signature_b64":"L5XsJlZ8tbp7/9Fsav1O+j5soPHzBLcMFxdNM92WpuCJ98o/u/VYaygUgWJVUfigh6cHfy2BlDGJgZ38QPYYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c56fba3cc50c2bd3f6c06cc2587d0deaa054dc5ad2ec4e125925946c71c2462","last_reissued_at":"2026-05-17T23:46:01.831002Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:01.831002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.06577","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-17T23:46:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BxmFJwNgNFL2hwOhEjnw9yd2nnUc6KH6Du2gI4P1A0lRuEiEFCMn4EqSYuOKtolmnFyXxVYF8737UTkUooGtAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:08:02.700410Z"},"content_sha256":"a092d93e72a62764e0b360a19619b3ec428a2d20e826180ccc608859d6ce6877","schema_version":"1.0","event_id":"sha256:a092d93e72a62764e0b360a19619b3ec428a2d20e826180ccc608859d6ce6877"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JRLPXI6MKDBL2P3MA3GCLB6Q32","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A tutorial on Zero-sum Stochastic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"J\\'er\\^ome Renault (TSE)","submitted_at":"2019-05-16T07:43:47Z","abstract_excerpt":"Zero-sum stochastic games generalize the notion of Markov Decision Processes (i.e. controlled Markov chains, or stochastic dynamic programming) to the 2-player competitive case : two players jointly control the evolution of a state variable, and have opposite interests. These notes constitute a short mathematical introduction to the theory of such games. Section 1 presents the basic model with finitely many states and actions. We give proofs of the standard results concerning : the existence and formulas for the values of the n-stage games, of the $\\lambda$-discounted games, the convergence of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06577","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-17T23:46:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vk9hXXNFtg/Oohj6QndBgk8B+gg3hAJMxYK/bUuC3EWClFR1R3hCSh6r6MKUdssHYLkAgJT21Bp/zCJaPTk7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:08:02.701127Z"},"content_sha256":"4bed22283b6330769083477ab0e7758dc1246e2839e40abbd95f60124b9a900c","schema_version":"1.0","event_id":"sha256:4bed22283b6330769083477ab0e7758dc1246e2839e40abbd95f60124b9a900c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JRLPXI6MKDBL2P3MA3GCLB6Q32/bundle.json","state_url":"https://pith.science/pith/JRLPXI6MKDBL2P3MA3GCLB6Q32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JRLPXI6MKDBL2P3MA3GCLB6Q32/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-07T21:08:02Z","links":{"resolver":"https://pith.science/pith/JRLPXI6MKDBL2P3MA3GCLB6Q32","bundle":"https://pith.science/pith/JRLPXI6MKDBL2P3MA3GCLB6Q32/bundle.json","state":"https://pith.science/pith/JRLPXI6MKDBL2P3MA3GCLB6Q32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JRLPXI6MKDBL2P3MA3GCLB6Q32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JRLPXI6MKDBL2P3MA3GCLB6Q32","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":"e77853c76703293f08fb251afa35d5e66d16bef805ef5bddfdedc20c0844b657","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-16T07:43:47Z","title_canon_sha256":"75db96d41c52d6a1c86457cf123b18eecd7ac8f46af5b2c2af29b6b3de2c3a7a"},"schema_version":"1.0","source":{"id":"1905.06577","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.06577","created_at":"2026-05-17T23:46:01Z"},{"alias_kind":"arxiv_version","alias_value":"1905.06577v1","created_at":"2026-05-17T23:46:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06577","created_at":"2026-05-17T23:46:01Z"},{"alias_kind":"pith_short_12","alias_value":"JRLPXI6MKDBL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JRLPXI6MKDBL2P3M","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JRLPXI6M","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:4bed22283b6330769083477ab0e7758dc1246e2839e40abbd95f60124b9a900c","target":"graph","created_at":"2026-05-17T23:46:01Z","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":"Zero-sum stochastic games generalize the notion of Markov Decision Processes (i.e. controlled Markov chains, or stochastic dynamic programming) to the 2-player competitive case : two players jointly control the evolution of a state variable, and have opposite interests. These notes constitute a short mathematical introduction to the theory of such games. Section 1 presents the basic model with finitely many states and actions. We give proofs of the standard results concerning : the existence and formulas for the values of the n-stage games, of the $\\lambda$-discounted games, the convergence of","authors_text":"J\\'er\\^ome Renault (TSE)","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-16T07:43:47Z","title":"A tutorial on Zero-sum Stochastic Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06577","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:a092d93e72a62764e0b360a19619b3ec428a2d20e826180ccc608859d6ce6877","target":"record","created_at":"2026-05-17T23:46:01Z","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":"e77853c76703293f08fb251afa35d5e66d16bef805ef5bddfdedc20c0844b657","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-16T07:43:47Z","title_canon_sha256":"75db96d41c52d6a1c86457cf123b18eecd7ac8f46af5b2c2af29b6b3de2c3a7a"},"schema_version":"1.0","source":{"id":"1905.06577","kind":"arxiv","version":1}},"canonical_sha256":"4c56fba3cc50c2bd3f6c06cc2587d0deaa054dc5ad2ec4e125925946c71c2462","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c56fba3cc50c2bd3f6c06cc2587d0deaa054dc5ad2ec4e125925946c71c2462","first_computed_at":"2026-05-17T23:46:01.831002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:01.831002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L5XsJlZ8tbp7/9Fsav1O+j5soPHzBLcMFxdNM92WpuCJ98o/u/VYaygUgWJVUfigh6cHfy2BlDGJgZ38QPYYDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:01.831789Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.06577","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a092d93e72a62764e0b360a19619b3ec428a2d20e826180ccc608859d6ce6877","sha256:4bed22283b6330769083477ab0e7758dc1246e2839e40abbd95f60124b9a900c"],"state_sha256":"181babf719c87a263499e0b99e69cf5ee047e7bec4eef8ea48df0014bd43cb92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v9T7QP5uyVwiohSc1Y1cpiA0NL/7WgwQJZ7fGNVkgC/SRVHEt9iK7/vugdkcmLpJ1k6JsBDaiFHNzkTjKuzjCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:08:02.705441Z","bundle_sha256":"ce4cffa65467b22dd35df8a728338dfa1d16717ae103fa4cd9472755a4664439"}}