{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GNQF6ZUZ5ECXZFKZYJ7VNCS2KA","short_pith_number":"pith:GNQF6ZUZ","canonical_record":{"source":{"id":"1704.06648","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-04-21T17:43:03Z","cross_cats_sorted":[],"title_canon_sha256":"2d06dab6970d14c27702271ee10bfea815d31a692c7fcfc5ee1e47ed18c2576c","abstract_canon_sha256":"35d84957db06bd3aabdc8fd5548314a558dfe28affbd572d2ebc09ebfade7c75"},"schema_version":"1.0"},"canonical_sha256":"33605f6699e9057c9559c27f568a5a5000e6f07779bf58dd726bb11a371dd375","source":{"kind":"arxiv","id":"1704.06648","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06648","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06648v2","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06648","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"GNQF6ZUZ5ECX","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GNQF6ZUZ5ECXZFKZ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GNQF6ZUZ","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GNQF6ZUZ5ECXZFKZYJ7VNCS2KA","target":"record","payload":{"canonical_record":{"source":{"id":"1704.06648","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-04-21T17:43:03Z","cross_cats_sorted":[],"title_canon_sha256":"2d06dab6970d14c27702271ee10bfea815d31a692c7fcfc5ee1e47ed18c2576c","abstract_canon_sha256":"35d84957db06bd3aabdc8fd5548314a558dfe28affbd572d2ebc09ebfade7c75"},"schema_version":"1.0"},"canonical_sha256":"33605f6699e9057c9559c27f568a5a5000e6f07779bf58dd726bb11a371dd375","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:43.947351Z","signature_b64":"WkL+loEgRzus/YGvuffC3pj3gTCchNgbINJIy3kQhy8qHhsopb9r6x1YOt+1E2hRHquZ+SLVodVRD6RgYnoJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33605f6699e9057c9559c27f568a5a5000e6f07779bf58dd726bb11a371dd375","last_reissued_at":"2026-05-18T00:44:43.946795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:43.946795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.06648","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-18T00:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZxMyaraZw/xp/vVY1/4zrAFvdvCQea3ZSEuZKxVBntE+wZSm6Ul8ErKRz42KtZvSD3Hu22TpFSjRA1L+LIRACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:56:12.784718Z"},"content_sha256":"222f2a92acfb66d5edab4c43e2773e2395ce05246d2cfce179b0bb11797cf753","schema_version":"1.0","event_id":"sha256:222f2a92acfb66d5edab4c43e2773e2395ce05246d2cfce179b0bb11797cf753"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GNQF6ZUZ5ECXZFKZYJ7VNCS2KA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Markov Automata with Multiple Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Joost-Pieter Katoen, Sebastian Junges, Tim Quatmann","submitted_at":"2017-04-21T17:43:03Z","abstract_excerpt":"Markov automata combine non-determinism, probabilistic branching, and exponentially distributed delays. This compositional variant of continuous-time Markov decision processes is used in reliability engineering, performance evaluation and stochastic scheduling. Their verification so far focused on single objectives such as (timed) reachability, and expected costs. In practice, often the objectives are mutually dependent and the aim is to reveal trade-offs. We present algorithms to analyze several objectives simultaneously and approximate Pareto curves. This includes, e.g., several (timed) reac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06648","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-18T00:44:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3UGxEYSiRln5nd3VhYf7TUQFZR6Meuyolysc1EAPcPQiRbD0YC3jgRQM2TG+CguQKQN79ueYybzDcUZKd1ddCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:56:12.785438Z"},"content_sha256":"f04ed35a83c01193adebc46117bd9c40a67490165689f29818f4c78ab09c3548","schema_version":"1.0","event_id":"sha256:f04ed35a83c01193adebc46117bd9c40a67490165689f29818f4c78ab09c3548"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNQF6ZUZ5ECXZFKZYJ7VNCS2KA/bundle.json","state_url":"https://pith.science/pith/GNQF6ZUZ5ECXZFKZYJ7VNCS2KA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNQF6ZUZ5ECXZFKZYJ7VNCS2KA/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-28T19:56:12Z","links":{"resolver":"https://pith.science/pith/GNQF6ZUZ5ECXZFKZYJ7VNCS2KA","bundle":"https://pith.science/pith/GNQF6ZUZ5ECXZFKZYJ7VNCS2KA/bundle.json","state":"https://pith.science/pith/GNQF6ZUZ5ECXZFKZYJ7VNCS2KA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNQF6ZUZ5ECXZFKZYJ7VNCS2KA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GNQF6ZUZ5ECXZFKZYJ7VNCS2KA","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":"35d84957db06bd3aabdc8fd5548314a558dfe28affbd572d2ebc09ebfade7c75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-04-21T17:43:03Z","title_canon_sha256":"2d06dab6970d14c27702271ee10bfea815d31a692c7fcfc5ee1e47ed18c2576c"},"schema_version":"1.0","source":{"id":"1704.06648","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06648","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06648v2","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06648","created_at":"2026-05-18T00:44:43Z"},{"alias_kind":"pith_short_12","alias_value":"GNQF6ZUZ5ECX","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GNQF6ZUZ5ECXZFKZ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GNQF6ZUZ","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:f04ed35a83c01193adebc46117bd9c40a67490165689f29818f4c78ab09c3548","target":"graph","created_at":"2026-05-18T00:44: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":"Markov automata combine non-determinism, probabilistic branching, and exponentially distributed delays. This compositional variant of continuous-time Markov decision processes is used in reliability engineering, performance evaluation and stochastic scheduling. Their verification so far focused on single objectives such as (timed) reachability, and expected costs. In practice, often the objectives are mutually dependent and the aim is to reveal trade-offs. We present algorithms to analyze several objectives simultaneously and approximate Pareto curves. This includes, e.g., several (timed) reac","authors_text":"Joost-Pieter Katoen, Sebastian Junges, Tim Quatmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-04-21T17:43:03Z","title":"Markov Automata with Multiple Objectives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06648","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:222f2a92acfb66d5edab4c43e2773e2395ce05246d2cfce179b0bb11797cf753","target":"record","created_at":"2026-05-18T00:44: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":"35d84957db06bd3aabdc8fd5548314a558dfe28affbd572d2ebc09ebfade7c75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-04-21T17:43:03Z","title_canon_sha256":"2d06dab6970d14c27702271ee10bfea815d31a692c7fcfc5ee1e47ed18c2576c"},"schema_version":"1.0","source":{"id":"1704.06648","kind":"arxiv","version":2}},"canonical_sha256":"33605f6699e9057c9559c27f568a5a5000e6f07779bf58dd726bb11a371dd375","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33605f6699e9057c9559c27f568a5a5000e6f07779bf58dd726bb11a371dd375","first_computed_at":"2026-05-18T00:44:43.946795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:43.946795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WkL+loEgRzus/YGvuffC3pj3gTCchNgbINJIy3kQhy8qHhsopb9r6x1YOt+1E2hRHquZ+SLVodVRD6RgYnoJCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:43.947351Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.06648","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:222f2a92acfb66d5edab4c43e2773e2395ce05246d2cfce179b0bb11797cf753","sha256:f04ed35a83c01193adebc46117bd9c40a67490165689f29818f4c78ab09c3548"],"state_sha256":"9664a1645bc3468e71460f76c216526c56e89428df4d3b5af2f4b33ae266d423"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X3K1k+AjCy8Y9wSrEghDCX4e13+ReociTm+gjG7XbYNHPc3VX+9Cq6+sPbf2dA2z8cMWMLwGehpJlTkoTUa+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:56:12.789151Z","bundle_sha256":"00e5a9015d75696016f97d857380521200b1929646eeb29bff3775da07c45e1c"}}