{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:LUYEGKDCK6STFNAR6KWXNETMRX","short_pith_number":"pith:LUYEGKDC","canonical_record":{"source":{"id":"2011.00632","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-11-01T21:42:57Z","cross_cats_sorted":["cs.FL","cs.SY"],"title_canon_sha256":"bcb5ae19406bb4550324c44ae427c86d1892132006116bf425ca6b3740d82134","abstract_canon_sha256":"cf901084dee69f986eecaf40dd5d025e4e10c2418a54bfe27b0f1da254f4ddbd"},"schema_version":"1.0"},"canonical_sha256":"5d3043286257a532b411f2ad76926c8dcde8333703759dc6cd2d9548311fbe57","source":{"kind":"arxiv","id":"2011.00632","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.00632","created_at":"2026-07-05T02:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"2011.00632v2","created_at":"2026-07-05T02:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.00632","created_at":"2026-07-05T02:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"LUYEGKDCK6ST","created_at":"2026-07-05T02:25:27Z"},{"alias_kind":"pith_short_16","alias_value":"LUYEGKDCK6STFNAR","created_at":"2026-07-05T02:25:27Z"},{"alias_kind":"pith_short_8","alias_value":"LUYEGKDC","created_at":"2026-07-05T02:25:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:LUYEGKDCK6STFNAR6KWXNETMRX","target":"record","payload":{"canonical_record":{"source":{"id":"2011.00632","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-11-01T21:42:57Z","cross_cats_sorted":["cs.FL","cs.SY"],"title_canon_sha256":"bcb5ae19406bb4550324c44ae427c86d1892132006116bf425ca6b3740d82134","abstract_canon_sha256":"cf901084dee69f986eecaf40dd5d025e4e10c2418a54bfe27b0f1da254f4ddbd"},"schema_version":"1.0"},"canonical_sha256":"5d3043286257a532b411f2ad76926c8dcde8333703759dc6cd2d9548311fbe57","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:25:27.764650Z","signature_b64":"4dZg+oOfMitSXAP3KR/7S10UN1EIu8Ajqev8OLPlbYUs3SX2Fq4fZcCsASbD08VXlfomeTBN7csbMbwkm1mXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d3043286257a532b411f2ad76926c8dcde8333703759dc6cd2d9548311fbe57","last_reissued_at":"2026-07-05T02:25:27.764207Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:25:27.764207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.00632","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-07-05T02:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rFpU5E/Ai9G8IyFhQlKzkDo0arO5XuQWMd20yMMkVxPhRQGyh6KgMK35sDgu1FnvOmiu5yIMutJPZYe6dXpUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T06:25:55.993595Z"},"content_sha256":"bbcbb2f80bc57892710308a1f513bae67e5eb83d0fc05aac5fd253fb84b028b1","schema_version":"1.0","event_id":"sha256:bbcbb2f80bc57892710308a1f513bae67e5eb83d0fc05aac5fd253fb84b028b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:LUYEGKDCK6STFNAR6KWXNETMRX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Synthesis of Discounted-Reward Optimal Policies for Markov Decision Processes Under Linear Temporal Logic Specifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.SY"],"primary_cat":"eess.SY","authors_text":"Krishna C. Kalagarla, Pierluigi Nuzzo, Rahul Jain","submitted_at":"2020-11-01T21:42:57Z","abstract_excerpt":"We present a method to find an optimal policy with respect to a reward function for a discounted Markov decision process under general linear temporal logic (LTL) specifications. Previous work has either focused on maximizing a cumulative reward objective under finite-duration tasks, specified by syntactically co-safe LTL, or maximizing an average reward for persistent (e.g., surveillance) tasks. This paper extends and generalizes these results by introducing a pair of occupancy measures to express the LTL satisfaction objective and the expected discounted reward objective, respectively. These"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.00632","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.00632/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-05T02:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VgyOl0KVIOQPkpdXxb897BbBhF8Gsrk9EBO6tDm0RNXS9cnqbLoneR89ocfWBitVxcOpqQxdmrDUlqFkGcuICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T06:25:55.993970Z"},"content_sha256":"099beb95f2ac7a0694f6f74eb0201b661d1261c44c58fa4c2bf66bf18b2d3f9a","schema_version":"1.0","event_id":"sha256:099beb95f2ac7a0694f6f74eb0201b661d1261c44c58fa4c2bf66bf18b2d3f9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LUYEGKDCK6STFNAR6KWXNETMRX/bundle.json","state_url":"https://pith.science/pith/LUYEGKDCK6STFNAR6KWXNETMRX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LUYEGKDCK6STFNAR6KWXNETMRX/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-07-10T06:25:55Z","links":{"resolver":"https://pith.science/pith/LUYEGKDCK6STFNAR6KWXNETMRX","bundle":"https://pith.science/pith/LUYEGKDCK6STFNAR6KWXNETMRX/bundle.json","state":"https://pith.science/pith/LUYEGKDCK6STFNAR6KWXNETMRX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LUYEGKDCK6STFNAR6KWXNETMRX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:LUYEGKDCK6STFNAR6KWXNETMRX","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":"cf901084dee69f986eecaf40dd5d025e4e10c2418a54bfe27b0f1da254f4ddbd","cross_cats_sorted":["cs.FL","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-11-01T21:42:57Z","title_canon_sha256":"bcb5ae19406bb4550324c44ae427c86d1892132006116bf425ca6b3740d82134"},"schema_version":"1.0","source":{"id":"2011.00632","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.00632","created_at":"2026-07-05T02:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"2011.00632v2","created_at":"2026-07-05T02:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.00632","created_at":"2026-07-05T02:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"LUYEGKDCK6ST","created_at":"2026-07-05T02:25:27Z"},{"alias_kind":"pith_short_16","alias_value":"LUYEGKDCK6STFNAR","created_at":"2026-07-05T02:25:27Z"},{"alias_kind":"pith_short_8","alias_value":"LUYEGKDC","created_at":"2026-07-05T02:25:27Z"}],"graph_snapshots":[{"event_id":"sha256:099beb95f2ac7a0694f6f74eb0201b661d1261c44c58fa4c2bf66bf18b2d3f9a","target":"graph","created_at":"2026-07-05T02:25:27Z","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/2011.00632/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a method to find an optimal policy with respect to a reward function for a discounted Markov decision process under general linear temporal logic (LTL) specifications. Previous work has either focused on maximizing a cumulative reward objective under finite-duration tasks, specified by syntactically co-safe LTL, or maximizing an average reward for persistent (e.g., surveillance) tasks. This paper extends and generalizes these results by introducing a pair of occupancy measures to express the LTL satisfaction objective and the expected discounted reward objective, respectively. These","authors_text":"Krishna C. Kalagarla, Pierluigi Nuzzo, Rahul Jain","cross_cats":["cs.FL","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-11-01T21:42:57Z","title":"Synthesis of Discounted-Reward Optimal Policies for Markov Decision Processes Under Linear Temporal Logic Specifications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.00632","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:bbcbb2f80bc57892710308a1f513bae67e5eb83d0fc05aac5fd253fb84b028b1","target":"record","created_at":"2026-07-05T02:25:27Z","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":"cf901084dee69f986eecaf40dd5d025e4e10c2418a54bfe27b0f1da254f4ddbd","cross_cats_sorted":["cs.FL","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-11-01T21:42:57Z","title_canon_sha256":"bcb5ae19406bb4550324c44ae427c86d1892132006116bf425ca6b3740d82134"},"schema_version":"1.0","source":{"id":"2011.00632","kind":"arxiv","version":2}},"canonical_sha256":"5d3043286257a532b411f2ad76926c8dcde8333703759dc6cd2d9548311fbe57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d3043286257a532b411f2ad76926c8dcde8333703759dc6cd2d9548311fbe57","first_computed_at":"2026-07-05T02:25:27.764207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:25:27.764207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4dZg+oOfMitSXAP3KR/7S10UN1EIu8Ajqev8OLPlbYUs3SX2Fq4fZcCsASbD08VXlfomeTBN7csbMbwkm1mXBg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:25:27.764650Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.00632","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbcbb2f80bc57892710308a1f513bae67e5eb83d0fc05aac5fd253fb84b028b1","sha256:099beb95f2ac7a0694f6f74eb0201b661d1261c44c58fa4c2bf66bf18b2d3f9a"],"state_sha256":"ad8d35fa0dee0ab810455e521f4352327c096193af405aa8b2e10398aaa3c33b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qlOwj2vqthkgkHMXLWO/Jsq6VQxmGIn0/3zzJJ1fba9mxl+wcVj3Z1VMrI6UpQbD+gb5pc+0ydK596h5CjMTCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T06:25:55.996005Z","bundle_sha256":"dfa06d20201e78117d5a7ac2e248fbe70bd061ecc2bda93e2a7b1e3f3bb3a215"}}