{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YMNYPHC62XFGMOTBU4JYMUYAPY","short_pith_number":"pith:YMNYPHC6","canonical_record":{"source":{"id":"1910.11024","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-10-24T10:48:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e02ff98146efd93c6f8cf4680eaca7bb12b453d227347becff36d64b8305b655","abstract_canon_sha256":"666dc159422c3cd35bbf06296114d8f9041901fdf4b393ce27c1998796308d30"},"schema_version":"1.0"},"canonical_sha256":"c31b879c5ed5ca663a61a7138653007e0f8736e27059245026bfcf88e215574f","source":{"kind":"arxiv","id":"1910.11024","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.11024","created_at":"2026-07-05T00:40:59Z"},{"alias_kind":"arxiv_version","alias_value":"1910.11024v3","created_at":"2026-07-05T00:40:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.11024","created_at":"2026-07-05T00:40:59Z"},{"alias_kind":"pith_short_12","alias_value":"YMNYPHC62XFG","created_at":"2026-07-05T00:40:59Z"},{"alias_kind":"pith_short_16","alias_value":"YMNYPHC62XFGMOTB","created_at":"2026-07-05T00:40:59Z"},{"alias_kind":"pith_short_8","alias_value":"YMNYPHC6","created_at":"2026-07-05T00:40:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YMNYPHC62XFGMOTBU4JYMUYAPY","target":"record","payload":{"canonical_record":{"source":{"id":"1910.11024","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-10-24T10:48:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e02ff98146efd93c6f8cf4680eaca7bb12b453d227347becff36d64b8305b655","abstract_canon_sha256":"666dc159422c3cd35bbf06296114d8f9041901fdf4b393ce27c1998796308d30"},"schema_version":"1.0"},"canonical_sha256":"c31b879c5ed5ca663a61a7138653007e0f8736e27059245026bfcf88e215574f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:59.795652Z","signature_b64":"zlFEp6kV/btWtI5mWnN2DNKYm0tnvY9OYu81U234Vi9Vj1W3c10NDT/lOgsnTjbu/hce6qNFpMIdWvD83tLpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c31b879c5ed5ca663a61a7138653007e0f8736e27059245026bfcf88e215574f","last_reissued_at":"2026-07-05T00:40:59.795198Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:59.795198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1910.11024","source_version":3,"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-07-05T00:40:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ePwxrW5SPL3ubDYJz19oZdJfCxOFQl56NQiDzrP+08u5crTZSRoZuKmqGsfYmYEtWF5tTgldMN4GI9c+LqRbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T22:39:46.155778Z"},"content_sha256":"45493a7175dea85fd9f13b73e51262d95dacf9c458142831d71400a7ecf9a90d","schema_version":"1.0","event_id":"sha256:45493a7175dea85fd9f13b73e51262d95dacf9c458142831d71400a7ecf9a90d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YMNYPHC62XFGMOTBU4JYMUYAPY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple Strategies in Multi-Objective MDPs (Technical Report)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Florent Delgrange, Joost-Pieter Katoen, Mickael Randour, Tim Quatmann","submitted_at":"2019-10-24T10:48:21Z","abstract_excerpt":"We consider the verification of multiple expected reward objectives at once on Markov decision processes (MDPs). This enables a trade-off analysis among multiple objectives by obtaining the Pareto front. We focus on strategies that are easy to employ and implement. That is, strategies that are pure (no randomization) and have bounded memory. We show that checking whether a point is achievable by a pure stationary strategy is NP-complete, even for two objectives, and we provide an MILP encoding to solve the corresponding problem. The bounded memory case can be reduced to the stationary one by a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.11024","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.11024/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:40:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TrZk2vLUTByxwqUacDTeIJSdydJ9B9zbyGAlSxlHLfu2N1n1Ct1Y0AwvQ1isWd3colqKHUTWQkSI7zJ0SJhUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T22:39:46.156290Z"},"content_sha256":"37e4f973d67acae8b7a811dfbc03e124028515e6407f1f5f49091a3107b852bd","schema_version":"1.0","event_id":"sha256:37e4f973d67acae8b7a811dfbc03e124028515e6407f1f5f49091a3107b852bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YMNYPHC62XFGMOTBU4JYMUYAPY/bundle.json","state_url":"https://pith.science/pith/YMNYPHC62XFGMOTBU4JYMUYAPY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YMNYPHC62XFGMOTBU4JYMUYAPY/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-08-04T22:39:46Z","links":{"resolver":"https://pith.science/pith/YMNYPHC62XFGMOTBU4JYMUYAPY","bundle":"https://pith.science/pith/YMNYPHC62XFGMOTBU4JYMUYAPY/bundle.json","state":"https://pith.science/pith/YMNYPHC62XFGMOTBU4JYMUYAPY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YMNYPHC62XFGMOTBU4JYMUYAPY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YMNYPHC62XFGMOTBU4JYMUYAPY","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":"666dc159422c3cd35bbf06296114d8f9041901fdf4b393ce27c1998796308d30","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-10-24T10:48:21Z","title_canon_sha256":"e02ff98146efd93c6f8cf4680eaca7bb12b453d227347becff36d64b8305b655"},"schema_version":"1.0","source":{"id":"1910.11024","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.11024","created_at":"2026-07-05T00:40:59Z"},{"alias_kind":"arxiv_version","alias_value":"1910.11024v3","created_at":"2026-07-05T00:40:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.11024","created_at":"2026-07-05T00:40:59Z"},{"alias_kind":"pith_short_12","alias_value":"YMNYPHC62XFG","created_at":"2026-07-05T00:40:59Z"},{"alias_kind":"pith_short_16","alias_value":"YMNYPHC62XFGMOTB","created_at":"2026-07-05T00:40:59Z"},{"alias_kind":"pith_short_8","alias_value":"YMNYPHC6","created_at":"2026-07-05T00:40:59Z"}],"graph_snapshots":[{"event_id":"sha256:37e4f973d67acae8b7a811dfbc03e124028515e6407f1f5f49091a3107b852bd","target":"graph","created_at":"2026-07-05T00:40:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1910.11024/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the verification of multiple expected reward objectives at once on Markov decision processes (MDPs). This enables a trade-off analysis among multiple objectives by obtaining the Pareto front. We focus on strategies that are easy to employ and implement. That is, strategies that are pure (no randomization) and have bounded memory. We show that checking whether a point is achievable by a pure stationary strategy is NP-complete, even for two objectives, and we provide an MILP encoding to solve the corresponding problem. The bounded memory case can be reduced to the stationary one by a","authors_text":"Florent Delgrange, Joost-Pieter Katoen, Mickael Randour, Tim Quatmann","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-10-24T10:48:21Z","title":"Simple Strategies in Multi-Objective MDPs (Technical Report)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.11024","kind":"arxiv","version":3},"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:45493a7175dea85fd9f13b73e51262d95dacf9c458142831d71400a7ecf9a90d","target":"record","created_at":"2026-07-05T00:40:59Z","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":"666dc159422c3cd35bbf06296114d8f9041901fdf4b393ce27c1998796308d30","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-10-24T10:48:21Z","title_canon_sha256":"e02ff98146efd93c6f8cf4680eaca7bb12b453d227347becff36d64b8305b655"},"schema_version":"1.0","source":{"id":"1910.11024","kind":"arxiv","version":3}},"canonical_sha256":"c31b879c5ed5ca663a61a7138653007e0f8736e27059245026bfcf88e215574f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c31b879c5ed5ca663a61a7138653007e0f8736e27059245026bfcf88e215574f","first_computed_at":"2026-07-05T00:40:59.795198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:40:59.795198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zlFEp6kV/btWtI5mWnN2DNKYm0tnvY9OYu81U234Vi9Vj1W3c10NDT/lOgsnTjbu/hce6qNFpMIdWvD83tLpCw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:40:59.795652Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.11024","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45493a7175dea85fd9f13b73e51262d95dacf9c458142831d71400a7ecf9a90d","sha256:37e4f973d67acae8b7a811dfbc03e124028515e6407f1f5f49091a3107b852bd"],"state_sha256":"fe3a5f2c53e80d372c0da7e2c685f7e439bfc1c557488de30f67f0d50d93663e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPXu17MgEAIAx2gepxsp/MgPRURQ0R7UDEYm8QCgRuqQwE2J+hjjte7y+qd6E6WpxRbd3pPQRl4DCoWk3VeRAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T22:39:46.161786Z","bundle_sha256":"c6368e1196bbc17a9b5a827289bb7d385aadd79b6387126ccf5da1390d8c639e"}}