{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:SCWLTUEXT6LFXNKAEZZXQNM4P3","short_pith_number":"pith:SCWLTUEX","schema_version":"1.0","canonical_sha256":"90acb9d0979f965bb540267378359c7ed562eb9cdef20702f0c7f3b0f000b010","source":{"kind":"arxiv","id":"1011.0397","version":2},"attestation_state":"computed","paper":{"title":"Efficient Approximation of Optimal Control for Markov Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.GT","authors_text":"John Fearnley, Lijun Zhang, Markus Rabe, Sven Schewe","submitted_at":"2010-11-01T18:00:00Z","abstract_excerpt":"We study the time-bounded reachability problem for continuous-time Markov decision processes (CTMDPs) and games (CTMGs). Existing techniques for this problem use discretisation techniques to break time into discrete intervals, and optimal control is approximated for each interval separately. Current techniques provide an accuracy of O(\\epsilon^2) on each interval, which leads to an infeasibly large number of intervals. We propose a sequence of approximations that achieve accuracies of O(\\epsilon^3), O(\\epsilon^4), and O(\\epsilon^5), that allow us to drastically reduce the number of intervals t"},"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":"1011.0397","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-11-01T18:00:00Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"9cfbfb5b187136f302ca5a98233afd0b4ac840a4635780abd570b53ac5b59b74","abstract_canon_sha256":"050999dcd8c6c895ba26b636802d600f6ea5f8e5140e944a0d08877451a2da08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:43.720146Z","signature_b64":"j6DyNAhCiaf+MQL5d5hbvr1bukmATS9CDLaX4JIX1OnulNg6hcT49qrurdkZbui/vyJpUTTR2dSaMtFEo3GBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90acb9d0979f965bb540267378359c7ed562eb9cdef20702f0c7f3b0f000b010","last_reissued_at":"2026-05-18T04:18:43.719736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:43.719736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Approximation of Optimal Control for Markov Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.GT","authors_text":"John Fearnley, Lijun Zhang, Markus Rabe, Sven Schewe","submitted_at":"2010-11-01T18:00:00Z","abstract_excerpt":"We study the time-bounded reachability problem for continuous-time Markov decision processes (CTMDPs) and games (CTMGs). Existing techniques for this problem use discretisation techniques to break time into discrete intervals, and optimal control is approximated for each interval separately. Current techniques provide an accuracy of O(\\epsilon^2) on each interval, which leads to an infeasibly large number of intervals. We propose a sequence of approximations that achieve accuracies of O(\\epsilon^3), O(\\epsilon^4), and O(\\epsilon^5), that allow us to drastically reduce the number of intervals t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0397","kind":"arxiv","version":2},"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":"1011.0397","created_at":"2026-05-18T04:18:43.719800+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.0397v2","created_at":"2026-05-18T04:18:43.719800+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0397","created_at":"2026-05-18T04:18:43.719800+00:00"},{"alias_kind":"pith_short_12","alias_value":"SCWLTUEXT6LF","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"SCWLTUEXT6LFXNKA","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"SCWLTUEX","created_at":"2026-05-18T12:26:13.927090+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/SCWLTUEXT6LFXNKAEZZXQNM4P3","json":"https://pith.science/pith/SCWLTUEXT6LFXNKAEZZXQNM4P3.json","graph_json":"https://pith.science/api/pith-number/SCWLTUEXT6LFXNKAEZZXQNM4P3/graph.json","events_json":"https://pith.science/api/pith-number/SCWLTUEXT6LFXNKAEZZXQNM4P3/events.json","paper":"https://pith.science/paper/SCWLTUEX"},"agent_actions":{"view_html":"https://pith.science/pith/SCWLTUEXT6LFXNKAEZZXQNM4P3","download_json":"https://pith.science/pith/SCWLTUEXT6LFXNKAEZZXQNM4P3.json","view_paper":"https://pith.science/paper/SCWLTUEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.0397&json=true","fetch_graph":"https://pith.science/api/pith-number/SCWLTUEXT6LFXNKAEZZXQNM4P3/graph.json","fetch_events":"https://pith.science/api/pith-number/SCWLTUEXT6LFXNKAEZZXQNM4P3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SCWLTUEXT6LFXNKAEZZXQNM4P3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SCWLTUEXT6LFXNKAEZZXQNM4P3/action/storage_attestation","attest_author":"https://pith.science/pith/SCWLTUEXT6LFXNKAEZZXQNM4P3/action/author_attestation","sign_citation":"https://pith.science/pith/SCWLTUEXT6LFXNKAEZZXQNM4P3/action/citation_signature","submit_replication":"https://pith.science/pith/SCWLTUEXT6LFXNKAEZZXQNM4P3/action/replication_record"}},"created_at":"2026-05-18T04:18:43.719800+00:00","updated_at":"2026-05-18T04:18:43.719800+00:00"}