{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KH2EFCWR3QANQLVJTVAGQID5T7","short_pith_number":"pith:KH2EFCWR","canonical_record":{"source":{"id":"1712.07622","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-20T18:21:52Z","cross_cats_sorted":["cs.LO","math.OC"],"title_canon_sha256":"7a6885e236336cb770d9a662c500be371981f9da2086196bd789ac4fd2d2bfc7","abstract_canon_sha256":"07753470b3ab84c4a75c0bd2e066d1ad1d2393d1a4051d58c52a48f96d6ddbad"},"schema_version":"1.0"},"canonical_sha256":"51f4428ad1dc00d82ea99d4068207d9fcf2f211a6575f69747c1cb06c6ce862f","source":{"kind":"arxiv","id":"1712.07622","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07622","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07622v2","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07622","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"KH2EFCWR3QAN","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KH2EFCWR3QANQLVJ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KH2EFCWR","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KH2EFCWR3QANQLVJTVAGQID5T7","target":"record","payload":{"canonical_record":{"source":{"id":"1712.07622","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-20T18:21:52Z","cross_cats_sorted":["cs.LO","math.OC"],"title_canon_sha256":"7a6885e236336cb770d9a662c500be371981f9da2086196bd789ac4fd2d2bfc7","abstract_canon_sha256":"07753470b3ab84c4a75c0bd2e066d1ad1d2393d1a4051d58c52a48f96d6ddbad"},"schema_version":"1.0"},"canonical_sha256":"51f4428ad1dc00d82ea99d4068207d9fcf2f211a6575f69747c1cb06c6ce862f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:53.400589Z","signature_b64":"RvXzP2D9QXgB0xHqxjE9CZsqIFsWvclHrv0JfJMc1hhAqW49PY4xiLISHffvJblPZWYy0JjtbUHQ7Ck2S+dtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51f4428ad1dc00d82ea99d4068207d9fcf2f211a6575f69747c1cb06c6ce862f","last_reissued_at":"2026-05-17T23:59:53.399881Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:53.399881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.07622","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-17T23:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O0MfzmPSc8sWJFZl5/ivm578UHOwEzb728L9+Wlu8OW5fnNy03dP3z8eyDQkpsYIQnaZEiRHxfqMLCul1CXjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:20:56.900078Z"},"content_sha256":"46fa239142c5296ecc0c1f1fabdd7eb7cf6702089986bbd9ea4764c0cd3a3f8e","schema_version":"1.0","event_id":"sha256:46fa239142c5296ecc0c1f1fabdd7eb7cf6702089986bbd9ea4764c0cd3a3f8e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KH2EFCWR3QANQLVJTVAGQID5T7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Temporal logic control of general Markov decision processes by approximate policy refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.OC"],"primary_cat":"cs.SY","authors_text":"Alessandro Abate, Sadegh Soudjani, Sofie Haesaert","submitted_at":"2017-12-20T18:21:52Z","abstract_excerpt":"The formal verification and controller synthesis for Markov decision processes that evolve over uncountable state spaces are computationally hard and thus generally rely on the use of approximations. In this work, we consider the correct-by-design control of general Markov decision processes (gMDPs) with respect to temporal logic properties by leveraging approximate probabilistic relations between the original model and its abstraction. We newly work with a robust satisfaction for the construction and verification of control strategies, which allows for both deviations in the outputs of the gM"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07622","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-17T23:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eki/wH55Gb0mDDBptgcNKmV2P8a7do0vuy+oGb4PN1AmkWv7qjJmp0WK1XtfforGrTdUarlU7bGVLTlHMCQMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:20:56.900509Z"},"content_sha256":"6fb330c9878adc7e4e50c45d8fb5cffacfc130aa68e2dec27cda473d280f3512","schema_version":"1.0","event_id":"sha256:6fb330c9878adc7e4e50c45d8fb5cffacfc130aa68e2dec27cda473d280f3512"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KH2EFCWR3QANQLVJTVAGQID5T7/bundle.json","state_url":"https://pith.science/pith/KH2EFCWR3QANQLVJTVAGQID5T7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KH2EFCWR3QANQLVJTVAGQID5T7/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-11T17:20:56Z","links":{"resolver":"https://pith.science/pith/KH2EFCWR3QANQLVJTVAGQID5T7","bundle":"https://pith.science/pith/KH2EFCWR3QANQLVJTVAGQID5T7/bundle.json","state":"https://pith.science/pith/KH2EFCWR3QANQLVJTVAGQID5T7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KH2EFCWR3QANQLVJTVAGQID5T7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KH2EFCWR3QANQLVJTVAGQID5T7","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":"07753470b3ab84c4a75c0bd2e066d1ad1d2393d1a4051d58c52a48f96d6ddbad","cross_cats_sorted":["cs.LO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-20T18:21:52Z","title_canon_sha256":"7a6885e236336cb770d9a662c500be371981f9da2086196bd789ac4fd2d2bfc7"},"schema_version":"1.0","source":{"id":"1712.07622","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07622","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07622v2","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07622","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"KH2EFCWR3QAN","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KH2EFCWR3QANQLVJ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KH2EFCWR","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:6fb330c9878adc7e4e50c45d8fb5cffacfc130aa68e2dec27cda473d280f3512","target":"graph","created_at":"2026-05-17T23:59:53Z","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":"The formal verification and controller synthesis for Markov decision processes that evolve over uncountable state spaces are computationally hard and thus generally rely on the use of approximations. In this work, we consider the correct-by-design control of general Markov decision processes (gMDPs) with respect to temporal logic properties by leveraging approximate probabilistic relations between the original model and its abstraction. We newly work with a robust satisfaction for the construction and verification of control strategies, which allows for both deviations in the outputs of the gM","authors_text":"Alessandro Abate, Sadegh Soudjani, Sofie Haesaert","cross_cats":["cs.LO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-20T18:21:52Z","title":"Temporal logic control of general Markov decision processes by approximate policy refinement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07622","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:46fa239142c5296ecc0c1f1fabdd7eb7cf6702089986bbd9ea4764c0cd3a3f8e","target":"record","created_at":"2026-05-17T23:59:53Z","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":"07753470b3ab84c4a75c0bd2e066d1ad1d2393d1a4051d58c52a48f96d6ddbad","cross_cats_sorted":["cs.LO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-20T18:21:52Z","title_canon_sha256":"7a6885e236336cb770d9a662c500be371981f9da2086196bd789ac4fd2d2bfc7"},"schema_version":"1.0","source":{"id":"1712.07622","kind":"arxiv","version":2}},"canonical_sha256":"51f4428ad1dc00d82ea99d4068207d9fcf2f211a6575f69747c1cb06c6ce862f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51f4428ad1dc00d82ea99d4068207d9fcf2f211a6575f69747c1cb06c6ce862f","first_computed_at":"2026-05-17T23:59:53.399881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:53.399881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RvXzP2D9QXgB0xHqxjE9CZsqIFsWvclHrv0JfJMc1hhAqW49PY4xiLISHffvJblPZWYy0JjtbUHQ7Ck2S+dtBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:53.400589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.07622","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46fa239142c5296ecc0c1f1fabdd7eb7cf6702089986bbd9ea4764c0cd3a3f8e","sha256:6fb330c9878adc7e4e50c45d8fb5cffacfc130aa68e2dec27cda473d280f3512"],"state_sha256":"313cd7e75ac5370db4af2314317eae25b82b6b7723dd2b47a40f4d6c3ec6dd79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JUNtollBEfICCUKVkLIKsoAqE2udzjrHtAOFMNXsZnCiK710IdzciGP0f07MzaFlB1Fuu+oaCJPZFh9kU7HFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T17:20:56.903389Z","bundle_sha256":"2996b0edae8097e99c7414bc04d2b66150f254bc21cf4074607c3f82d4c4dea6"}}