{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:A4YPBI3BUU3SMC2NWD7FMAMMYT","short_pith_number":"pith:A4YPBI3B","canonical_record":{"source":{"id":"1812.08414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-20T08:33:33Z","cross_cats_sorted":[],"title_canon_sha256":"0c47475ca06bfd5f966c1844b9f040daed76e10da6f99fbd502de493499b4a33","abstract_canon_sha256":"bdd7d56cf03ea2732e806571d85817ffdb99d7bb54a4158ad771f5d39f499058"},"schema_version":"1.0"},"canonical_sha256":"0730f0a361a537260b4db0fe56018cc4f18e0615dd93a6398dabbd7836ce5f27","source":{"kind":"arxiv","id":"1812.08414","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.08414","created_at":"2026-05-17T23:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1812.08414v1","created_at":"2026-05-17T23:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08414","created_at":"2026-05-17T23:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"A4YPBI3BUU3S","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A4YPBI3BUU3SMC2N","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A4YPBI3B","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:A4YPBI3BUU3SMC2NWD7FMAMMYT","target":"record","payload":{"canonical_record":{"source":{"id":"1812.08414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-20T08:33:33Z","cross_cats_sorted":[],"title_canon_sha256":"0c47475ca06bfd5f966c1844b9f040daed76e10da6f99fbd502de493499b4a33","abstract_canon_sha256":"bdd7d56cf03ea2732e806571d85817ffdb99d7bb54a4158ad771f5d39f499058"},"schema_version":"1.0"},"canonical_sha256":"0730f0a361a537260b4db0fe56018cc4f18e0615dd93a6398dabbd7836ce5f27","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:50.037504Z","signature_b64":"h4I/K9CS39+ZjYSSvQSTCojsPoeIIvvbPaHEIL4GxrSTDNkYx315wAA7uBKCeILLr5wS3HWt9g2SwPLy5KwUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0730f0a361a537260b4db0fe56018cc4f18e0615dd93a6398dabbd7836ce5f27","last_reissued_at":"2026-05-17T23:57:50.036886Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:50.036886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.08414","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:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JowyPOYgv8F2DyXn3oAKzLvA/31DvXp02zMndDtGXM+uhxdZAJhMe5e160dx+altNUoLanYFElGwWLBtzkZpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T19:12:03.789997Z"},"content_sha256":"5e1bea7d45d210e629a4365cf77634a493ece4d5c8b3ea6f4d532125d7f39531","schema_version":"1.0","event_id":"sha256:5e1bea7d45d210e629a4365cf77634a493ece4d5c8b3ea6f4d532125d7f39531"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:A4YPBI3BUU3SMC2NWD7FMAMMYT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Zero-sum Stochastic Games: Limit Optimal Trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guillaume Vigeral (CEREMADE), Sylvain Sorin (IMJ-PRG)","submitted_at":"2018-12-20T08:33:33Z","abstract_excerpt":"We consider zero sum stochastic games. For every discount factor $\\lambda$, a time normalization allows to represent the game as being played on the interval [0, 1]. We introduce the trajectories of cumulated expected payoff and of cumulated occupation measure up to time t $\\in$ [0, 1], under $\\epsilon$-optimal strategies. A limit optimal trajectory is defined as an accumulation point as the discount factor tends to 0. We study existence, uniqueness and characterization of these limit optimal trajectories for absorbing games."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08414","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:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wDahTcQEiCWu2DVPX9tu68TuuhP5VVQUZvlWuWFA9cMN0uNA9U72kK/9CcZpB5Dk4t0dsWa6kpn3crJR6nkKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T19:12:03.790358Z"},"content_sha256":"7ec743d7cbb8e8261c0221c328abe6c6e9dae8b5f5ce1063eb00807232000070","schema_version":"1.0","event_id":"sha256:7ec743d7cbb8e8261c0221c328abe6c6e9dae8b5f5ce1063eb00807232000070"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4YPBI3BUU3SMC2NWD7FMAMMYT/bundle.json","state_url":"https://pith.science/pith/A4YPBI3BUU3SMC2NWD7FMAMMYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4YPBI3BUU3SMC2NWD7FMAMMYT/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-07-02T19:12:03Z","links":{"resolver":"https://pith.science/pith/A4YPBI3BUU3SMC2NWD7FMAMMYT","bundle":"https://pith.science/pith/A4YPBI3BUU3SMC2NWD7FMAMMYT/bundle.json","state":"https://pith.science/pith/A4YPBI3BUU3SMC2NWD7FMAMMYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4YPBI3BUU3SMC2NWD7FMAMMYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:A4YPBI3BUU3SMC2NWD7FMAMMYT","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":"bdd7d56cf03ea2732e806571d85817ffdb99d7bb54a4158ad771f5d39f499058","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-20T08:33:33Z","title_canon_sha256":"0c47475ca06bfd5f966c1844b9f040daed76e10da6f99fbd502de493499b4a33"},"schema_version":"1.0","source":{"id":"1812.08414","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.08414","created_at":"2026-05-17T23:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1812.08414v1","created_at":"2026-05-17T23:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08414","created_at":"2026-05-17T23:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"A4YPBI3BUU3S","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A4YPBI3BUU3SMC2N","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A4YPBI3B","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:7ec743d7cbb8e8261c0221c328abe6c6e9dae8b5f5ce1063eb00807232000070","target":"graph","created_at":"2026-05-17T23:57:50Z","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":"We consider zero sum stochastic games. For every discount factor $\\lambda$, a time normalization allows to represent the game as being played on the interval [0, 1]. We introduce the trajectories of cumulated expected payoff and of cumulated occupation measure up to time t $\\in$ [0, 1], under $\\epsilon$-optimal strategies. A limit optimal trajectory is defined as an accumulation point as the discount factor tends to 0. We study existence, uniqueness and characterization of these limit optimal trajectories for absorbing games.","authors_text":"Guillaume Vigeral (CEREMADE), Sylvain Sorin (IMJ-PRG)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-20T08:33:33Z","title":"Zero-sum Stochastic Games: Limit Optimal Trajectories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08414","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:5e1bea7d45d210e629a4365cf77634a493ece4d5c8b3ea6f4d532125d7f39531","target":"record","created_at":"2026-05-17T23:57:50Z","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":"bdd7d56cf03ea2732e806571d85817ffdb99d7bb54a4158ad771f5d39f499058","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-20T08:33:33Z","title_canon_sha256":"0c47475ca06bfd5f966c1844b9f040daed76e10da6f99fbd502de493499b4a33"},"schema_version":"1.0","source":{"id":"1812.08414","kind":"arxiv","version":1}},"canonical_sha256":"0730f0a361a537260b4db0fe56018cc4f18e0615dd93a6398dabbd7836ce5f27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0730f0a361a537260b4db0fe56018cc4f18e0615dd93a6398dabbd7836ce5f27","first_computed_at":"2026-05-17T23:57:50.036886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:50.036886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h4I/K9CS39+ZjYSSvQSTCojsPoeIIvvbPaHEIL4GxrSTDNkYx315wAA7uBKCeILLr5wS3HWt9g2SwPLy5KwUAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:50.037504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.08414","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e1bea7d45d210e629a4365cf77634a493ece4d5c8b3ea6f4d532125d7f39531","sha256:7ec743d7cbb8e8261c0221c328abe6c6e9dae8b5f5ce1063eb00807232000070"],"state_sha256":"b4b9e4ea0317ba21af1a99afa78b72427ffae4bad4ff5c6e43276d93b9298953"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FaHM/dUuRmJOBr6l71mQNFzGIkflhzfCs69nvLnG97Q27VmbSQvwKRCJTHuaDdtfldJ1cQWoWTodCV+GaRDSDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T19:12:03.792298Z","bundle_sha256":"4255eadc601325d5e6c7439c1f57a5c5ad7e7c4edf6874f4b91be04c4ddf8d9c"}}