{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:SCWLTUEXT6LFXNKAEZZXQNM4P3","short_pith_number":"pith:SCWLTUEX","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"},"canonical_sha256":"90acb9d0979f965bb540267378359c7ed562eb9cdef20702f0c7f3b0f000b010","source":{"kind":"arxiv","id":"1011.0397","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0397","created_at":"2026-05-18T04:18:43Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0397v2","created_at":"2026-05-18T04:18:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0397","created_at":"2026-05-18T04:18:43Z"},{"alias_kind":"pith_short_12","alias_value":"SCWLTUEXT6LF","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SCWLTUEXT6LFXNKA","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SCWLTUEX","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:SCWLTUEXT6LFXNKAEZZXQNM4P3","target":"record","payload":{"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"},"canonical_sha256":"90acb9d0979f965bb540267378359c7ed562eb9cdef20702f0c7f3b0f000b010","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"},"source_kind":"arxiv","source_id":"1011.0397","source_version":2,"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-18T04:18:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aAKgmvJ4ZWRktV/yta5qKFZKBWhrerQPNF6t7XBhQEKg6VB5nsvXddpyfzoHFkOQMaPRiIPvVL/RHJOCD6MDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:02:11.902698Z"},"content_sha256":"276ed3ade2a939a659bf47effa7723460f483a5aec0e3a8b8068933fed8c703f","schema_version":"1.0","event_id":"sha256:276ed3ade2a939a659bf47effa7723460f483a5aec0e3a8b8068933fed8c703f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:SCWLTUEXT6LFXNKAEZZXQNM4P3","target":"graph","payload":{"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"},"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-18T04:18:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mpqpGGGiCpEANtbUJL6KUZEf9CBE32eei5/e+s7xaGNPGLDmQJgt1cSOofb5aHrwTWyPnksMmpgkZ9YcSZIcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:02:11.903191Z"},"content_sha256":"4ac83e5d2073cef561a87a0032115ebb8afe3e25cd6cc128f4d0975136bc1495","schema_version":"1.0","event_id":"sha256:4ac83e5d2073cef561a87a0032115ebb8afe3e25cd6cc128f4d0975136bc1495"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SCWLTUEXT6LFXNKAEZZXQNM4P3/bundle.json","state_url":"https://pith.science/pith/SCWLTUEXT6LFXNKAEZZXQNM4P3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SCWLTUEXT6LFXNKAEZZXQNM4P3/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-05-26T20:02:11Z","links":{"resolver":"https://pith.science/pith/SCWLTUEXT6LFXNKAEZZXQNM4P3","bundle":"https://pith.science/pith/SCWLTUEXT6LFXNKAEZZXQNM4P3/bundle.json","state":"https://pith.science/pith/SCWLTUEXT6LFXNKAEZZXQNM4P3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SCWLTUEXT6LFXNKAEZZXQNM4P3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:SCWLTUEXT6LFXNKAEZZXQNM4P3","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":"050999dcd8c6c895ba26b636802d600f6ea5f8e5140e944a0d08877451a2da08","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-11-01T18:00:00Z","title_canon_sha256":"9cfbfb5b187136f302ca5a98233afd0b4ac840a4635780abd570b53ac5b59b74"},"schema_version":"1.0","source":{"id":"1011.0397","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0397","created_at":"2026-05-18T04:18:43Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0397v2","created_at":"2026-05-18T04:18:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0397","created_at":"2026-05-18T04:18:43Z"},{"alias_kind":"pith_short_12","alias_value":"SCWLTUEXT6LF","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SCWLTUEXT6LFXNKA","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SCWLTUEX","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:4ac83e5d2073cef561a87a0032115ebb8afe3e25cd6cc128f4d0975136bc1495","target":"graph","created_at":"2026-05-18T04:18:43Z","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 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","authors_text":"John Fearnley, Lijun Zhang, Markus Rabe, Sven Schewe","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-11-01T18:00:00Z","title":"Efficient Approximation of Optimal Control for Markov Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0397","kind":"arxiv","version":2},"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:276ed3ade2a939a659bf47effa7723460f483a5aec0e3a8b8068933fed8c703f","target":"record","created_at":"2026-05-18T04:18:43Z","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":"050999dcd8c6c895ba26b636802d600f6ea5f8e5140e944a0d08877451a2da08","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-11-01T18:00:00Z","title_canon_sha256":"9cfbfb5b187136f302ca5a98233afd0b4ac840a4635780abd570b53ac5b59b74"},"schema_version":"1.0","source":{"id":"1011.0397","kind":"arxiv","version":2}},"canonical_sha256":"90acb9d0979f965bb540267378359c7ed562eb9cdef20702f0c7f3b0f000b010","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90acb9d0979f965bb540267378359c7ed562eb9cdef20702f0c7f3b0f000b010","first_computed_at":"2026-05-18T04:18:43.719736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:43.719736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j6DyNAhCiaf+MQL5d5hbvr1bukmATS9CDLaX4JIX1OnulNg6hcT49qrurdkZbui/vyJpUTTR2dSaMtFEo3GBCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:43.720146Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.0397","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:276ed3ade2a939a659bf47effa7723460f483a5aec0e3a8b8068933fed8c703f","sha256:4ac83e5d2073cef561a87a0032115ebb8afe3e25cd6cc128f4d0975136bc1495"],"state_sha256":"5d7ea955a2ba2a3c4df25e4ceb97f6f1164b2726606a4aa14e9ff730d9db7fdf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G6PsEbtWHuaE/NVhWGFmO5GtO+/0ESAgT4/W4zbvd6xz0jrQexGDHnLarxbadxHNgoysCSjrWdCym6vYkOfMDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:02:11.905434Z","bundle_sha256":"ab2e429deddf9b0a1382fa87d4a5b3eb77c48e2557c528cdb3de22f064bde012"}}