{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:A4YPBI3BUU3SMC2NWD7FMAMMYT","short_pith_number":"pith:A4YPBI3B","schema_version":"1.0","canonical_sha256":"0730f0a361a537260b4db0fe56018cc4f18e0615dd93a6398dabbd7836ce5f27","source":{"kind":"arxiv","id":"1812.08414","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.08414","created_at":"2026-05-17T23:57:50.036983+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.08414v1","created_at":"2026-05-17T23:57:50.036983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08414","created_at":"2026-05-17T23:57:50.036983+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4YPBI3BUU3S","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4YPBI3BUU3SMC2N","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4YPBI3B","created_at":"2026-05-18T12:32:13.499390+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/A4YPBI3BUU3SMC2NWD7FMAMMYT","json":"https://pith.science/pith/A4YPBI3BUU3SMC2NWD7FMAMMYT.json","graph_json":"https://pith.science/api/pith-number/A4YPBI3BUU3SMC2NWD7FMAMMYT/graph.json","events_json":"https://pith.science/api/pith-number/A4YPBI3BUU3SMC2NWD7FMAMMYT/events.json","paper":"https://pith.science/paper/A4YPBI3B"},"agent_actions":{"view_html":"https://pith.science/pith/A4YPBI3BUU3SMC2NWD7FMAMMYT","download_json":"https://pith.science/pith/A4YPBI3BUU3SMC2NWD7FMAMMYT.json","view_paper":"https://pith.science/paper/A4YPBI3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.08414&json=true","fetch_graph":"https://pith.science/api/pith-number/A4YPBI3BUU3SMC2NWD7FMAMMYT/graph.json","fetch_events":"https://pith.science/api/pith-number/A4YPBI3BUU3SMC2NWD7FMAMMYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4YPBI3BUU3SMC2NWD7FMAMMYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4YPBI3BUU3SMC2NWD7FMAMMYT/action/storage_attestation","attest_author":"https://pith.science/pith/A4YPBI3BUU3SMC2NWD7FMAMMYT/action/author_attestation","sign_citation":"https://pith.science/pith/A4YPBI3BUU3SMC2NWD7FMAMMYT/action/citation_signature","submit_replication":"https://pith.science/pith/A4YPBI3BUU3SMC2NWD7FMAMMYT/action/replication_record"}},"created_at":"2026-05-17T23:57:50.036983+00:00","updated_at":"2026-05-17T23:57:50.036983+00:00"}