{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:LPDGVYEAMSQDMFML47BUUUVN3N","short_pith_number":"pith:LPDGVYEA","schema_version":"1.0","canonical_sha256":"5bc66ae08064a036158be7c34a52addb51a85df929cea91dc8d3294b69862b02","source":{"kind":"arxiv","id":"0810.3581","version":3},"attestation_state":"computed","paper":{"title":"Recursive Concurrent Stochastic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Kousha Etessami, Mihalis Yannakakis","submitted_at":"2008-10-20T15:18:44Z","abstract_excerpt":"We study Recursive Concurrent Stochastic Games (RCSGs), extending our recent analysis of recursive simple stochastic games to a concurrent setting where the two players choose moves simultaneously and independently at each state. For multi-exit games, our earlier work already showed undecidability for basic questions like termination, thus we focus on the important case of single-exit RCSGs (1-RCSGs).\n  We first characterize the value of a 1-RCSG termination game as the least fixed point solution of a system of nonlinear minimax functional equations, and use it to show PSPACE decidability for "},"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":"0810.3581","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2008-10-20T15:18:44Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"bf08c22189343c4cc0cb189443c5753fe403738258dbf71d2d55e11a2c02fc78","abstract_canon_sha256":"c20d98b9eb97361c8d92c993d479b00485c96faf6d18fc12238b711a5e6525c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:40.689062Z","signature_b64":"yAeV58IB2Ue4hxppVIiHnXVL+rj62mzTCKkfzRvolNNX8IL4XOAilvS6CecxONlFASeJM7FESwKsipSxrLY6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bc66ae08064a036158be7c34a52addb51a85df929cea91dc8d3294b69862b02","last_reissued_at":"2026-05-18T01:37:40.688291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:40.688291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recursive Concurrent Stochastic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Kousha Etessami, Mihalis Yannakakis","submitted_at":"2008-10-20T15:18:44Z","abstract_excerpt":"We study Recursive Concurrent Stochastic Games (RCSGs), extending our recent analysis of recursive simple stochastic games to a concurrent setting where the two players choose moves simultaneously and independently at each state. For multi-exit games, our earlier work already showed undecidability for basic questions like termination, thus we focus on the important case of single-exit RCSGs (1-RCSGs).\n  We first characterize the value of a 1-RCSG termination game as the least fixed point solution of a system of nonlinear minimax functional equations, and use it to show PSPACE decidability for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.3581","kind":"arxiv","version":3},"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":"0810.3581","created_at":"2026-05-18T01:37:40.688433+00:00"},{"alias_kind":"arxiv_version","alias_value":"0810.3581v3","created_at":"2026-05-18T01:37:40.688433+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.3581","created_at":"2026-05-18T01:37:40.688433+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPDGVYEAMSQD","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPDGVYEAMSQDMFML","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPDGVYEA","created_at":"2026-05-18T12:25:57.157939+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/LPDGVYEAMSQDMFML47BUUUVN3N","json":"https://pith.science/pith/LPDGVYEAMSQDMFML47BUUUVN3N.json","graph_json":"https://pith.science/api/pith-number/LPDGVYEAMSQDMFML47BUUUVN3N/graph.json","events_json":"https://pith.science/api/pith-number/LPDGVYEAMSQDMFML47BUUUVN3N/events.json","paper":"https://pith.science/paper/LPDGVYEA"},"agent_actions":{"view_html":"https://pith.science/pith/LPDGVYEAMSQDMFML47BUUUVN3N","download_json":"https://pith.science/pith/LPDGVYEAMSQDMFML47BUUUVN3N.json","view_paper":"https://pith.science/paper/LPDGVYEA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0810.3581&json=true","fetch_graph":"https://pith.science/api/pith-number/LPDGVYEAMSQDMFML47BUUUVN3N/graph.json","fetch_events":"https://pith.science/api/pith-number/LPDGVYEAMSQDMFML47BUUUVN3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPDGVYEAMSQDMFML47BUUUVN3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPDGVYEAMSQDMFML47BUUUVN3N/action/storage_attestation","attest_author":"https://pith.science/pith/LPDGVYEAMSQDMFML47BUUUVN3N/action/author_attestation","sign_citation":"https://pith.science/pith/LPDGVYEAMSQDMFML47BUUUVN3N/action/citation_signature","submit_replication":"https://pith.science/pith/LPDGVYEAMSQDMFML47BUUUVN3N/action/replication_record"}},"created_at":"2026-05-18T01:37:40.688433+00:00","updated_at":"2026-05-18T01:37:40.688433+00:00"}