{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CEIK6PR3TL2L6DVFAI5BPAOS3B","short_pith_number":"pith:CEIK6PR3","canonical_record":{"source":{"id":"1710.08986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-20T07:47:41Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"ba2dc25422f848dc8851287b9202d4c4c663bc7f59b3eed3ca1e0a5edeb46c11","abstract_canon_sha256":"4640cfe0fec4a82b6644f63a4ad63b1d8a32f5319c32579c22731d7f5bbe2753"},"schema_version":"1.0"},"canonical_sha256":"1110af3e3b9af4bf0ea5023a1781d2d840588b3160f956ab566072e749e217c0","source":{"kind":"arxiv","id":"1710.08986","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08986","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08986v1","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08986","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"pith_short_12","alias_value":"CEIK6PR3TL2L","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CEIK6PR3TL2L6DVF","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CEIK6PR3","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CEIK6PR3TL2L6DVFAI5BPAOS3B","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-20T07:47:41Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"ba2dc25422f848dc8851287b9202d4c4c663bc7f59b3eed3ca1e0a5edeb46c11","abstract_canon_sha256":"4640cfe0fec4a82b6644f63a4ad63b1d8a32f5319c32579c22731d7f5bbe2753"},"schema_version":"1.0"},"canonical_sha256":"1110af3e3b9af4bf0ea5023a1781d2d840588b3160f956ab566072e749e217c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:00.642049Z","signature_b64":"tKbpUpUClpK9jFR4ruBP71mowgIS79bVNYvwYT7PlreDVQayHHTR8rjyTvflmGMQWaCfyKFAgVSYJ5xj0S3KCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1110af3e3b9af4bf0ea5023a1781d2d840588b3160f956ab566072e749e217c0","last_reissued_at":"2026-05-18T00:32:00.641684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:00.641684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08986","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-18T00:32:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bTRcXJv4xpsw1/1NtXcQL7VhrUx4pr5lBWGsYIGMh0cyQBeYmYAnlfH9Ds1QWghyOmnlumJve+VaHauChx1+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:17:39.530907Z"},"content_sha256":"f114d0c48f8fc31f8150e3568ce11b430a45189c68b65cb961f8d21b4bb9d17d","schema_version":"1.0","event_id":"sha256:f114d0c48f8fc31f8150e3568ce11b430a45189c68b65cb961f8d21b4bb9d17d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CEIK6PR3TL2L6DVFAI5BPAOS3B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Objective Approaches to Markov Decision Processes with Uncertain Transition Parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Dimitri Scheftelowitsch, Holger Hermanns, Peter Buchholz, Vahid Hashemi","submitted_at":"2017-10-20T07:47:41Z","abstract_excerpt":"Markov decision processes (MDPs) are a popular model for performance analysis and optimization of stochastic systems. The parameters of stochastic behavior of MDPs are estimates from empirical observations of a system; their values are not known precisely. Different types of MDPs with uncertain, imprecise or bounded transition rates or probabilities and rewards exist in the literature.\n  Commonly, analysis of models with uncertainties amounts to searching for the most robust policy which means that the goal is to generate a policy with the greatest lower bound on performance (or, symmetrically"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08986","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-18T00:32:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yrMed5G7EBEfSdCHXbyqEnjwddTIbBDaieBIWc1OUq9fC2+hmO9f9NkXhwIx3yHGPAiJsCtTe/FWgQ756KvLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:17:39.531608Z"},"content_sha256":"556519fbed628fef470a8262277ebb265bddd356d2fcaabd8140954fc7c2aec7","schema_version":"1.0","event_id":"sha256:556519fbed628fef470a8262277ebb265bddd356d2fcaabd8140954fc7c2aec7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CEIK6PR3TL2L6DVFAI5BPAOS3B/bundle.json","state_url":"https://pith.science/pith/CEIK6PR3TL2L6DVFAI5BPAOS3B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CEIK6PR3TL2L6DVFAI5BPAOS3B/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-27T22:17:39Z","links":{"resolver":"https://pith.science/pith/CEIK6PR3TL2L6DVFAI5BPAOS3B","bundle":"https://pith.science/pith/CEIK6PR3TL2L6DVFAI5BPAOS3B/bundle.json","state":"https://pith.science/pith/CEIK6PR3TL2L6DVFAI5BPAOS3B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CEIK6PR3TL2L6DVFAI5BPAOS3B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CEIK6PR3TL2L6DVFAI5BPAOS3B","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":"4640cfe0fec4a82b6644f63a4ad63b1d8a32f5319c32579c22731d7f5bbe2753","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-20T07:47:41Z","title_canon_sha256":"ba2dc25422f848dc8851287b9202d4c4c663bc7f59b3eed3ca1e0a5edeb46c11"},"schema_version":"1.0","source":{"id":"1710.08986","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08986","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08986v1","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08986","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"pith_short_12","alias_value":"CEIK6PR3TL2L","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CEIK6PR3TL2L6DVF","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CEIK6PR3","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:556519fbed628fef470a8262277ebb265bddd356d2fcaabd8140954fc7c2aec7","target":"graph","created_at":"2026-05-18T00:32:00Z","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":"Markov decision processes (MDPs) are a popular model for performance analysis and optimization of stochastic systems. The parameters of stochastic behavior of MDPs are estimates from empirical observations of a system; their values are not known precisely. Different types of MDPs with uncertain, imprecise or bounded transition rates or probabilities and rewards exist in the literature.\n  Commonly, analysis of models with uncertainties amounts to searching for the most robust policy which means that the goal is to generate a policy with the greatest lower bound on performance (or, symmetrically","authors_text":"Dimitri Scheftelowitsch, Holger Hermanns, Peter Buchholz, Vahid Hashemi","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-20T07:47:41Z","title":"Multi-Objective Approaches to Markov Decision Processes with Uncertain Transition Parameters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08986","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:f114d0c48f8fc31f8150e3568ce11b430a45189c68b65cb961f8d21b4bb9d17d","target":"record","created_at":"2026-05-18T00:32:00Z","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":"4640cfe0fec4a82b6644f63a4ad63b1d8a32f5319c32579c22731d7f5bbe2753","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-20T07:47:41Z","title_canon_sha256":"ba2dc25422f848dc8851287b9202d4c4c663bc7f59b3eed3ca1e0a5edeb46c11"},"schema_version":"1.0","source":{"id":"1710.08986","kind":"arxiv","version":1}},"canonical_sha256":"1110af3e3b9af4bf0ea5023a1781d2d840588b3160f956ab566072e749e217c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1110af3e3b9af4bf0ea5023a1781d2d840588b3160f956ab566072e749e217c0","first_computed_at":"2026-05-18T00:32:00.641684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:00.641684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tKbpUpUClpK9jFR4ruBP71mowgIS79bVNYvwYT7PlreDVQayHHTR8rjyTvflmGMQWaCfyKFAgVSYJ5xj0S3KCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:00.642049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08986","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f114d0c48f8fc31f8150e3568ce11b430a45189c68b65cb961f8d21b4bb9d17d","sha256:556519fbed628fef470a8262277ebb265bddd356d2fcaabd8140954fc7c2aec7"],"state_sha256":"12ae6fbfa50fa0192f7bfa697f26fcc6fbf688fddd28e089438160daacbfaf1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i+r3aTsfa7pIJ9NVsaPhMScLuaFUmsD4jvARgky6FRATdd2D4H11SBEDmGzipfmOH2QSQbid2x1JgHior11iAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:17:39.535286Z","bundle_sha256":"1071e8b083c979eaba96aa6ce7d460775d57dd9bf9bb9f4f7b33afabccb9dae5"}}