{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BRE4OAXN74BM7553JDUHV5MVQT","short_pith_number":"pith:BRE4OAXN","canonical_record":{"source":{"id":"1811.11445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-11-28T08:53:07Z","cross_cats_sorted":[],"title_canon_sha256":"2003b25e7746329804494277f7324d4b8647a5a4758db31401b2ad12a1eecd71","abstract_canon_sha256":"fe271ec43fa5aa0c381a030d94f3564a02df1e518faa31d653370cafe1c6ac25"},"schema_version":"1.0"},"canonical_sha256":"0c49c702edff02cff7bb48e87af59584c5f915f910a563f86369788e02f2507c","source":{"kind":"arxiv","id":"1811.11445","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11445","created_at":"2026-05-17T23:59:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11445v1","created_at":"2026-05-17T23:59:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11445","created_at":"2026-05-17T23:59:42Z"},{"alias_kind":"pith_short_12","alias_value":"BRE4OAXN74BM","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BRE4OAXN74BM7553","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BRE4OAXN","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BRE4OAXN74BM7553JDUHV5MVQT","target":"record","payload":{"canonical_record":{"source":{"id":"1811.11445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-11-28T08:53:07Z","cross_cats_sorted":[],"title_canon_sha256":"2003b25e7746329804494277f7324d4b8647a5a4758db31401b2ad12a1eecd71","abstract_canon_sha256":"fe271ec43fa5aa0c381a030d94f3564a02df1e518faa31d653370cafe1c6ac25"},"schema_version":"1.0"},"canonical_sha256":"0c49c702edff02cff7bb48e87af59584c5f915f910a563f86369788e02f2507c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:42.951447Z","signature_b64":"7D3ypbXlBmpvYSHylZqKYkIJKfaSeW/9o3PL3vWto3jQoTdW+WKCLd2glMmWVZBblbFisJyO2gK/CCRLIlBTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c49c702edff02cff7bb48e87af59584c5f915f910a563f86369788e02f2507c","last_reissued_at":"2026-05-17T23:59:42.950957Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:42.950957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.11445","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-17T23:59:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pBYAOxUH3HhJqz3GKqllEun7uGIExavaG+mlHRlRw2B6dnDPNhexh35NyVw1K0MzQB6bTPeya/5uM+teG9hXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:25:01.910195Z"},"content_sha256":"54f961e471f3aa2da076e064bd3ac230c270fa2af6e23b7ec204090cfe028f46","schema_version":"1.0","event_id":"sha256:54f961e471f3aa2da076e064bd3ac230c270fa2af6e23b7ec204090cfe028f46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BRE4OAXN74BM7553JDUHV5MVQT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Dynamic Programming for Temporal Logic Control of Stochastic Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Sadegh Soudjani, Sofie Haesaert","submitted_at":"2018-11-28T08:53:07Z","abstract_excerpt":"Discrete-time stochastic systems are an essential modelling tool for many engineering systems. We consider stochastic control systems that are evolving over continuous spaces. For this class of models, methods for the formal verification and synthesis of control strategies are computationally hard and generally rely on the use of approximate abstractions. Building on approximate abstractions, we compute control strategies with lower- and upper-bounds for satisfying unbounded temporal logic specifications. Firstly, robust dynamic programming mappings over the abstract system are introduced to s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11445","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-17T23:59:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ri6YtkjsQT4VZdq6WJzHL7bibcP4C0EXDeEjduGQ6dhdPl0gA3tXEG+19/bA9iJCKb4gDWAoRKJoGw/OhCqlCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:25:01.910884Z"},"content_sha256":"7e33620da5c4bc259b824a4d268ded099bee789e2591d5355c2d7ae2eeeae36c","schema_version":"1.0","event_id":"sha256:7e33620da5c4bc259b824a4d268ded099bee789e2591d5355c2d7ae2eeeae36c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BRE4OAXN74BM7553JDUHV5MVQT/bundle.json","state_url":"https://pith.science/pith/BRE4OAXN74BM7553JDUHV5MVQT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BRE4OAXN74BM7553JDUHV5MVQT/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-06-11T21:25:01Z","links":{"resolver":"https://pith.science/pith/BRE4OAXN74BM7553JDUHV5MVQT","bundle":"https://pith.science/pith/BRE4OAXN74BM7553JDUHV5MVQT/bundle.json","state":"https://pith.science/pith/BRE4OAXN74BM7553JDUHV5MVQT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BRE4OAXN74BM7553JDUHV5MVQT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BRE4OAXN74BM7553JDUHV5MVQT","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":"fe271ec43fa5aa0c381a030d94f3564a02df1e518faa31d653370cafe1c6ac25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-11-28T08:53:07Z","title_canon_sha256":"2003b25e7746329804494277f7324d4b8647a5a4758db31401b2ad12a1eecd71"},"schema_version":"1.0","source":{"id":"1811.11445","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11445","created_at":"2026-05-17T23:59:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11445v1","created_at":"2026-05-17T23:59:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11445","created_at":"2026-05-17T23:59:42Z"},{"alias_kind":"pith_short_12","alias_value":"BRE4OAXN74BM","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BRE4OAXN74BM7553","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BRE4OAXN","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:7e33620da5c4bc259b824a4d268ded099bee789e2591d5355c2d7ae2eeeae36c","target":"graph","created_at":"2026-05-17T23:59:42Z","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":"Discrete-time stochastic systems are an essential modelling tool for many engineering systems. We consider stochastic control systems that are evolving over continuous spaces. For this class of models, methods for the formal verification and synthesis of control strategies are computationally hard and generally rely on the use of approximate abstractions. Building on approximate abstractions, we compute control strategies with lower- and upper-bounds for satisfying unbounded temporal logic specifications. Firstly, robust dynamic programming mappings over the abstract system are introduced to s","authors_text":"Sadegh Soudjani, Sofie Haesaert","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-11-28T08:53:07Z","title":"Robust Dynamic Programming for Temporal Logic Control of Stochastic Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11445","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:54f961e471f3aa2da076e064bd3ac230c270fa2af6e23b7ec204090cfe028f46","target":"record","created_at":"2026-05-17T23:59:42Z","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":"fe271ec43fa5aa0c381a030d94f3564a02df1e518faa31d653370cafe1c6ac25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-11-28T08:53:07Z","title_canon_sha256":"2003b25e7746329804494277f7324d4b8647a5a4758db31401b2ad12a1eecd71"},"schema_version":"1.0","source":{"id":"1811.11445","kind":"arxiv","version":1}},"canonical_sha256":"0c49c702edff02cff7bb48e87af59584c5f915f910a563f86369788e02f2507c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c49c702edff02cff7bb48e87af59584c5f915f910a563f86369788e02f2507c","first_computed_at":"2026-05-17T23:59:42.950957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:42.950957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7D3ypbXlBmpvYSHylZqKYkIJKfaSeW/9o3PL3vWto3jQoTdW+WKCLd2glMmWVZBblbFisJyO2gK/CCRLIlBTBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:42.951447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11445","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54f961e471f3aa2da076e064bd3ac230c270fa2af6e23b7ec204090cfe028f46","sha256:7e33620da5c4bc259b824a4d268ded099bee789e2591d5355c2d7ae2eeeae36c"],"state_sha256":"868ad8269971830a34022bd00d6133be0608ca573cf063d6270b2af4c222bb0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nrxp75Ft21Q0GT/adMuP/z82IKSv7HJICmuoCfuTjnJBVoCAjiwIGL2e8cH6oM5r68ApabXqufC5tapPyEMFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:25:01.914676Z","bundle_sha256":"6c9183a3c023e2e183dd4b2b13785fb99db0e4593c9cbea3e2f47c5b5ed6fbd6"}}