{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NIMLG5BLYMETRHWKNUNYLAOTHD","short_pith_number":"pith:NIMLG5BL","canonical_record":{"source":{"id":"1807.03223","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-09T15:19:15Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6b3aa106c0e7097675dc36a4635403d3f62e4dc712c65173859144e2de4ce929","abstract_canon_sha256":"2091901d0c21ea20876a1c06baabc4953dcabc176fdbbff9a075e7e669f71320"},"schema_version":"1.0"},"canonical_sha256":"6a18b3742bc309389eca6d1b8581d338cc3da119be59d369c65dc6553ad9f3ca","source":{"kind":"arxiv","id":"1807.03223","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03223","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03223v3","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03223","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"NIMLG5BLYMET","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NIMLG5BLYMETRHWK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NIMLG5BL","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NIMLG5BLYMETRHWKNUNYLAOTHD","target":"record","payload":{"canonical_record":{"source":{"id":"1807.03223","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-09T15:19:15Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6b3aa106c0e7097675dc36a4635403d3f62e4dc712c65173859144e2de4ce929","abstract_canon_sha256":"2091901d0c21ea20876a1c06baabc4953dcabc176fdbbff9a075e7e669f71320"},"schema_version":"1.0"},"canonical_sha256":"6a18b3742bc309389eca6d1b8581d338cc3da119be59d369c65dc6553ad9f3ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:23.792772Z","signature_b64":"0VbWrQhR9TXLheFoEoSTnp9RWSMR8wGJy7StAsR5abeI6cgfIAT26k1EwbxLvZxEAGmdcGPS2PdO9PH3/7Z0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a18b3742bc309389eca6d1b8581d338cc3da119be59d369c65dc6553ad9f3ca","last_reissued_at":"2026-05-17T23:43:23.792073Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:23.792073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.03223","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-05-17T23:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jv/DJtIaNx8BAa+vD8b3/o+7a02UOYvKs3TSx6hEyzNXaEar0KlcMp6S1rvSdz78s+q4Gd3hnvQNsReCkHb4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:04:35.394349Z"},"content_sha256":"869468eb658d6641267d691d3b223a4a13830e00ed01ef80663412fbc86e8d38","schema_version":"1.0","event_id":"sha256:869468eb658d6641267d691d3b223a4a13830e00ed01ef80663412fbc86e8d38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NIMLG5BLYMETRHWKNUNYLAOTHD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Entropy Maximization for Markov Decision Processes Under Temporal Logic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"math.OC","authors_text":"Melkior Ornik, Murat Cubuktepe, Mustafa O. Karabag, Ufuk Topcu, Yagiz Savas","submitted_at":"2018-07-09T15:19:15Z","abstract_excerpt":"We study the problem of synthesizing a policy that maximizes the entropy of a Markov decision process (MDP) subject to a temporal logic constraint. Such a policy minimizes the predictability of the paths it generates, or dually, maximizes the exploration of different paths in an MDP while ensuring the satisfaction of a temporal logic specification. We first show that the maximum entropy of an MDP can be finite, infinite or unbounded. We provide necessary and sufficient conditions under which the maximum entropy of an MDP is finite, infinite or unbounded. We then present an algorithm which is b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03223","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":""},"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:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mqYN7dYJr/SsohOvwJc9hl8Z3c72RalBfcuCMzNozR5ihQoRNKSf3/OxpHc7IA2B4ADoYiD3YfoEjcddK/7DBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:04:35.394950Z"},"content_sha256":"8f6de6f81f440c34e8cba06aea99a392468da946e18767681b4ff4e6e8221285","schema_version":"1.0","event_id":"sha256:8f6de6f81f440c34e8cba06aea99a392468da946e18767681b4ff4e6e8221285"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NIMLG5BLYMETRHWKNUNYLAOTHD/bundle.json","state_url":"https://pith.science/pith/NIMLG5BLYMETRHWKNUNYLAOTHD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NIMLG5BLYMETRHWKNUNYLAOTHD/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-28T20:04:35Z","links":{"resolver":"https://pith.science/pith/NIMLG5BLYMETRHWKNUNYLAOTHD","bundle":"https://pith.science/pith/NIMLG5BLYMETRHWKNUNYLAOTHD/bundle.json","state":"https://pith.science/pith/NIMLG5BLYMETRHWKNUNYLAOTHD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NIMLG5BLYMETRHWKNUNYLAOTHD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NIMLG5BLYMETRHWKNUNYLAOTHD","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":"2091901d0c21ea20876a1c06baabc4953dcabc176fdbbff9a075e7e669f71320","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-09T15:19:15Z","title_canon_sha256":"6b3aa106c0e7097675dc36a4635403d3f62e4dc712c65173859144e2de4ce929"},"schema_version":"1.0","source":{"id":"1807.03223","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03223","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03223v3","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03223","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"NIMLG5BLYMET","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NIMLG5BLYMETRHWK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NIMLG5BL","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:8f6de6f81f440c34e8cba06aea99a392468da946e18767681b4ff4e6e8221285","target":"graph","created_at":"2026-05-17T23:43:23Z","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":"We study the problem of synthesizing a policy that maximizes the entropy of a Markov decision process (MDP) subject to a temporal logic constraint. Such a policy minimizes the predictability of the paths it generates, or dually, maximizes the exploration of different paths in an MDP while ensuring the satisfaction of a temporal logic specification. We first show that the maximum entropy of an MDP can be finite, infinite or unbounded. We provide necessary and sufficient conditions under which the maximum entropy of an MDP is finite, infinite or unbounded. We then present an algorithm which is b","authors_text":"Melkior Ornik, Murat Cubuktepe, Mustafa O. Karabag, Ufuk Topcu, Yagiz Savas","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-09T15:19:15Z","title":"Entropy Maximization for Markov Decision Processes Under Temporal Logic Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03223","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:869468eb658d6641267d691d3b223a4a13830e00ed01ef80663412fbc86e8d38","target":"record","created_at":"2026-05-17T23:43:23Z","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":"2091901d0c21ea20876a1c06baabc4953dcabc176fdbbff9a075e7e669f71320","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-09T15:19:15Z","title_canon_sha256":"6b3aa106c0e7097675dc36a4635403d3f62e4dc712c65173859144e2de4ce929"},"schema_version":"1.0","source":{"id":"1807.03223","kind":"arxiv","version":3}},"canonical_sha256":"6a18b3742bc309389eca6d1b8581d338cc3da119be59d369c65dc6553ad9f3ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a18b3742bc309389eca6d1b8581d338cc3da119be59d369c65dc6553ad9f3ca","first_computed_at":"2026-05-17T23:43:23.792073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:23.792073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0VbWrQhR9TXLheFoEoSTnp9RWSMR8wGJy7StAsR5abeI6cgfIAT26k1EwbxLvZxEAGmdcGPS2PdO9PH3/7Z0DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:23.792772Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03223","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:869468eb658d6641267d691d3b223a4a13830e00ed01ef80663412fbc86e8d38","sha256:8f6de6f81f440c34e8cba06aea99a392468da946e18767681b4ff4e6e8221285"],"state_sha256":"3c636380b7db4f2c49aebd79317798f6b8ab0da09701390ff3a3e1fd872d1fab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3dvwqdzumqQ31VOpNVLFWCzNIy80JTZfpaTgHOzyyi4oOKds/BCtqGwCo3oejmK28Zh/aqUuNeIg7rZaBZyuDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:04:35.398196Z","bundle_sha256":"88bd2b1f30d7bea1bc443282c03d4c27bfe9894687a496aff605c1b89ce5d5c9"}}