{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VJ7RAO3SQT5DAM3NF6IWJYT6PI","short_pith_number":"pith:VJ7RAO3S","canonical_record":{"source":{"id":"1605.09703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-05-31T16:28:02Z","cross_cats_sorted":[],"title_canon_sha256":"553623d8a78a1c9ae2018baa9d189fc659a834f6516b5517f41c27cfdc549a02","abstract_canon_sha256":"d0ea5702069749f6b01319fcd9e904f8fb87ddd593380744f7ed5cb7a90e74e5"},"schema_version":"1.0"},"canonical_sha256":"aa7f103b7284fa30336d2f9164e27e7a3b3ce0b3a8e8ee9e7bdabe2a663d3386","source":{"kind":"arxiv","id":"1605.09703","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09703","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09703v1","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09703","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"VJ7RAO3SQT5D","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VJ7RAO3SQT5DAM3N","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VJ7RAO3S","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VJ7RAO3SQT5DAM3NF6IWJYT6PI","target":"record","payload":{"canonical_record":{"source":{"id":"1605.09703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-05-31T16:28:02Z","cross_cats_sorted":[],"title_canon_sha256":"553623d8a78a1c9ae2018baa9d189fc659a834f6516b5517f41c27cfdc549a02","abstract_canon_sha256":"d0ea5702069749f6b01319fcd9e904f8fb87ddd593380744f7ed5cb7a90e74e5"},"schema_version":"1.0"},"canonical_sha256":"aa7f103b7284fa30336d2f9164e27e7a3b3ce0b3a8e8ee9e7bdabe2a663d3386","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:10.328666Z","signature_b64":"zRjMpYtwX48Aapjvfws/fLsJzEh1jIY5f/Pd90qvCUSI2bUn51+NZbYxJVUGTQcmJHxwf96/LyigVS7E6LCnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa7f103b7284fa30336d2f9164e27e7a3b3ce0b3a8e8ee9e7bdabe2a663d3386","last_reissued_at":"2026-05-18T01:13:10.328036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:10.328036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.09703","source_version":1,"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-18T01:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OXyV9TjLZJEiZ59A6jYq2uhRBNATkB/epfNHQNrXe7hrjvWGziuj6EaqOmzmt3Nf0UnUv48c4OT35YsaVa2xAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:38:26.364353Z"},"content_sha256":"565a4ac6343ed8c0b75fc5dfc2939f1b17cdee1424a26c5ecc8bbf63da7bd75f","schema_version":"1.0","event_id":"sha256:565a4ac6343ed8c0b75fc5dfc2939f1b17cdee1424a26c5ecc8bbf63da7bd75f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VJ7RAO3SQT5DAM3NF6IWJYT6PI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Policy learning for time-bounded reachability in Continuous-Time Markov Decision Processes via doubly-stochastic gradient ascent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Dimitrios Milios, Ezio Bartocci, Guido Sanguinetti, Luca Bortolussi, Tom\\v{a}\\v{s} Br\\'azdil","submitted_at":"2016-05-31T16:28:02Z","abstract_excerpt":"Continuous-time Markov decision processes are an important class of models in a wide range of applications, ranging from cyber-physical systems to synthetic biology. A central problem is how to devise a policy to control the system in order to maximise the probability of satisfying a set of temporal logic specifications. Here we present a novel approach based on statistical model checking and an unbiased estimation of a functional gradient in the space of possible policies. The statistical approach has several advantages over conventional approaches based on uniformisation, as it can also be a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09703","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"},"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-18T01:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cn0HIvO1U3FCEPbOJ+1UMHj4rVj+n6aFmVBzAE/gkhb/zAjaebJV8vyNpM/Zp3876xHI5C6bJ426/1Fc91wgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:38:26.364700Z"},"content_sha256":"1c94ac2252817135da293a9edc725c523584a3f2d1c44f0bcbe2a6c1370a74ce","schema_version":"1.0","event_id":"sha256:1c94ac2252817135da293a9edc725c523584a3f2d1c44f0bcbe2a6c1370a74ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VJ7RAO3SQT5DAM3NF6IWJYT6PI/bundle.json","state_url":"https://pith.science/pith/VJ7RAO3SQT5DAM3NF6IWJYT6PI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VJ7RAO3SQT5DAM3NF6IWJYT6PI/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-28T04:38:26Z","links":{"resolver":"https://pith.science/pith/VJ7RAO3SQT5DAM3NF6IWJYT6PI","bundle":"https://pith.science/pith/VJ7RAO3SQT5DAM3NF6IWJYT6PI/bundle.json","state":"https://pith.science/pith/VJ7RAO3SQT5DAM3NF6IWJYT6PI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VJ7RAO3SQT5DAM3NF6IWJYT6PI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VJ7RAO3SQT5DAM3NF6IWJYT6PI","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":"d0ea5702069749f6b01319fcd9e904f8fb87ddd593380744f7ed5cb7a90e74e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-05-31T16:28:02Z","title_canon_sha256":"553623d8a78a1c9ae2018baa9d189fc659a834f6516b5517f41c27cfdc549a02"},"schema_version":"1.0","source":{"id":"1605.09703","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09703","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09703v1","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09703","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"VJ7RAO3SQT5D","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VJ7RAO3SQT5DAM3N","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VJ7RAO3S","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:1c94ac2252817135da293a9edc725c523584a3f2d1c44f0bcbe2a6c1370a74ce","target":"graph","created_at":"2026-05-18T01:13:10Z","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":"Continuous-time Markov decision processes are an important class of models in a wide range of applications, ranging from cyber-physical systems to synthetic biology. A central problem is how to devise a policy to control the system in order to maximise the probability of satisfying a set of temporal logic specifications. Here we present a novel approach based on statistical model checking and an unbiased estimation of a functional gradient in the space of possible policies. The statistical approach has several advantages over conventional approaches based on uniformisation, as it can also be a","authors_text":"Dimitrios Milios, Ezio Bartocci, Guido Sanguinetti, Luca Bortolussi, Tom\\v{a}\\v{s} Br\\'azdil","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-05-31T16:28:02Z","title":"Policy learning for time-bounded reachability in Continuous-Time Markov Decision Processes via doubly-stochastic gradient ascent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09703","kind":"arxiv","version":1},"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:565a4ac6343ed8c0b75fc5dfc2939f1b17cdee1424a26c5ecc8bbf63da7bd75f","target":"record","created_at":"2026-05-18T01:13:10Z","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":"d0ea5702069749f6b01319fcd9e904f8fb87ddd593380744f7ed5cb7a90e74e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-05-31T16:28:02Z","title_canon_sha256":"553623d8a78a1c9ae2018baa9d189fc659a834f6516b5517f41c27cfdc549a02"},"schema_version":"1.0","source":{"id":"1605.09703","kind":"arxiv","version":1}},"canonical_sha256":"aa7f103b7284fa30336d2f9164e27e7a3b3ce0b3a8e8ee9e7bdabe2a663d3386","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa7f103b7284fa30336d2f9164e27e7a3b3ce0b3a8e8ee9e7bdabe2a663d3386","first_computed_at":"2026-05-18T01:13:10.328036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:10.328036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zRjMpYtwX48Aapjvfws/fLsJzEh1jIY5f/Pd90qvCUSI2bUn51+NZbYxJVUGTQcmJHxwf96/LyigVS7E6LCnAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:10.328666Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.09703","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:565a4ac6343ed8c0b75fc5dfc2939f1b17cdee1424a26c5ecc8bbf63da7bd75f","sha256:1c94ac2252817135da293a9edc725c523584a3f2d1c44f0bcbe2a6c1370a74ce"],"state_sha256":"2eb8f1fa4fa1e3d0f116f65d2b5287cc106eaa404223beacad8ade12156301b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kAyrF98qSrs3CrZYPjyBkDVcQeO3ivMpfQ4CN57pjOKBSro4VDSyF4BrSvxTJMOb6VFaK6sDmWz63uKt8ZW5AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:38:26.366773Z","bundle_sha256":"675110f8ecd01ae611b981982c9b3cb21dcbb570ba23a2a75e47fb08fdc004f8"}}