{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:G6A4LNRF4JKFQ6VYXSOFYAA2P3","short_pith_number":"pith:G6A4LNRF","schema_version":"1.0","canonical_sha256":"3781c5b625e254587ab8bc9c5c001a7ee9f83004bd4a712e6ea9b305c5eb969c","source":{"kind":"arxiv","id":"1412.8570","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Shortest Path Games and Q-Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Huizhen Yu","submitted_at":"2014-12-30T06:44:50Z","abstract_excerpt":"We consider a class of two-player zero-sum stochastic games with finite state and compact control spaces, which we call stochastic shortest path (SSP) games. They are undiscounted total cost stochastic dynamic games that have a cost-free termination state. Exploiting the close connection of these games to single-player SSP problems, we introduce novel model conditions under which we show that the SSP games have strong optimality properties, including the existence of a unique solution to the dynamic programming equation, the existence of optimal stationary policies, and the convergence of valu"},"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":"1412.8570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-12-30T06:44:50Z","cross_cats_sorted":[],"title_canon_sha256":"9786acdee7434b8d23a4e93b58119f0f484060b837b2293156094eac486e50ed","abstract_canon_sha256":"d4284b614ebeb37d1503082ec5cbb7181db56b1e63f70d2294018a03103d0bae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:17.001677Z","signature_b64":"HCiBJ8rhY0d5eU+nt6No9OZpURzjQcy44vgjElfNAb9FLj/u9U257vPZaTB5Bw7MUtyLSWZBa1ljveIEx9NUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3781c5b625e254587ab8bc9c5c001a7ee9f83004bd4a712e6ea9b305c5eb969c","last_reissued_at":"2026-05-18T02:30:17.001067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:17.001067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Shortest Path Games and Q-Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Huizhen Yu","submitted_at":"2014-12-30T06:44:50Z","abstract_excerpt":"We consider a class of two-player zero-sum stochastic games with finite state and compact control spaces, which we call stochastic shortest path (SSP) games. They are undiscounted total cost stochastic dynamic games that have a cost-free termination state. Exploiting the close connection of these games to single-player SSP problems, we introduce novel model conditions under which we show that the SSP games have strong optimality properties, including the existence of a unique solution to the dynamic programming equation, the existence of optimal stationary policies, and the convergence of valu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8570","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":"1412.8570","created_at":"2026-05-18T02:30:17.001146+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.8570v1","created_at":"2026-05-18T02:30:17.001146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8570","created_at":"2026-05-18T02:30:17.001146+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6A4LNRF4JKF","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6A4LNRF4JKFQ6VY","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6A4LNRF","created_at":"2026-05-18T12:28:28.263976+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/G6A4LNRF4JKFQ6VYXSOFYAA2P3","json":"https://pith.science/pith/G6A4LNRF4JKFQ6VYXSOFYAA2P3.json","graph_json":"https://pith.science/api/pith-number/G6A4LNRF4JKFQ6VYXSOFYAA2P3/graph.json","events_json":"https://pith.science/api/pith-number/G6A4LNRF4JKFQ6VYXSOFYAA2P3/events.json","paper":"https://pith.science/paper/G6A4LNRF"},"agent_actions":{"view_html":"https://pith.science/pith/G6A4LNRF4JKFQ6VYXSOFYAA2P3","download_json":"https://pith.science/pith/G6A4LNRF4JKFQ6VYXSOFYAA2P3.json","view_paper":"https://pith.science/paper/G6A4LNRF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.8570&json=true","fetch_graph":"https://pith.science/api/pith-number/G6A4LNRF4JKFQ6VYXSOFYAA2P3/graph.json","fetch_events":"https://pith.science/api/pith-number/G6A4LNRF4JKFQ6VYXSOFYAA2P3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6A4LNRF4JKFQ6VYXSOFYAA2P3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6A4LNRF4JKFQ6VYXSOFYAA2P3/action/storage_attestation","attest_author":"https://pith.science/pith/G6A4LNRF4JKFQ6VYXSOFYAA2P3/action/author_attestation","sign_citation":"https://pith.science/pith/G6A4LNRF4JKFQ6VYXSOFYAA2P3/action/citation_signature","submit_replication":"https://pith.science/pith/G6A4LNRF4JKFQ6VYXSOFYAA2P3/action/replication_record"}},"created_at":"2026-05-18T02:30:17.001146+00:00","updated_at":"2026-05-18T02:30:17.001146+00:00"}