{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ACOHLKBUOONM3YWPBSYJLQC2U7","short_pith_number":"pith:ACOHLKBU","canonical_record":{"source":{"id":"1907.06128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-13T20:57:38Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"f97590ef8436d8e54ceb645effdc4e052e849257269aa4c79da25a00e9604dc6","abstract_canon_sha256":"35e3df47d902108ea2ea4e60fff090d7f9b846ff6ddc08b901764189768f6b4d"},"schema_version":"1.0"},"canonical_sha256":"009c75a834739acde2cf0cb095c05aa7f8fe0d838111dff2ef70a057619a1da5","source":{"kind":"arxiv","id":"1907.06128","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06128","created_at":"2026-05-17T23:40:42Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06128v1","created_at":"2026-05-17T23:40:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06128","created_at":"2026-05-17T23:40:42Z"},{"alias_kind":"pith_short_12","alias_value":"ACOHLKBUOONM","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"ACOHLKBUOONM3YWP","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"ACOHLKBU","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ACOHLKBUOONM3YWPBSYJLQC2U7","target":"record","payload":{"canonical_record":{"source":{"id":"1907.06128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-13T20:57:38Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"f97590ef8436d8e54ceb645effdc4e052e849257269aa4c79da25a00e9604dc6","abstract_canon_sha256":"35e3df47d902108ea2ea4e60fff090d7f9b846ff6ddc08b901764189768f6b4d"},"schema_version":"1.0"},"canonical_sha256":"009c75a834739acde2cf0cb095c05aa7f8fe0d838111dff2ef70a057619a1da5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:42.353125Z","signature_b64":"d7VcyGBh7cOLYvTO+0FXrzpTd1IezLx9LmKciHC2QB6RowME0sc3OskWesLur9e65EtniwASIkLAMv3Y2dS4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"009c75a834739acde2cf0cb095c05aa7f8fe0d838111dff2ef70a057619a1da5","last_reissued_at":"2026-05-17T23:40:42.352563Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:42.352563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.06128","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-17T23:40:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yOsSf7wRM/y4//VccLUHG00JfTA+aqQ84cVfV4iJI9adNPNjgwQo4zjOSq9BtDAd+dEH8OtHLB7Bj2WvrmHxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:10:04.545242Z"},"content_sha256":"8ff43777ecffbc4900ffede2218630c2b3732c36800410697b1a0143da415c63","schema_version":"1.0","event_id":"sha256:8ff43777ecffbc4900ffede2218630c2b3732c36800410697b1a0143da415c63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ACOHLKBUOONM3YWPBSYJLQC2U7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Continuous-Time Markov Decision Processes with Controlled Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Quanyan Zhu, Veeraruna Kavitha, Yunhan Huang","submitted_at":"2019-07-13T20:57:38Z","abstract_excerpt":"In this paper, we study a continuous-time discounted jump Markov decision process with both controlled actions and observations. The observation is only available for a discrete set of time instances. At each time of observation, one has to select an optimal timing for the next observation and a control trajectory for the time interval between two observation points. We provide a theoretical framework that the decision maker can utilize to find the optimal observation epochs and the optimal actions jointly. Two cases are investigated. One is gated queueing systems in which we explicitly charac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06128","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-17T23:40:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HrwlTNNvFMW5rxNXterdE731BiWHYbplPgqMr5y7FjN60cGJREGBdza+SRG0WOrA20xcInzJgNPjWWb8qGGjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:10:04.545894Z"},"content_sha256":"295ce9b12f141d134d83731972809bf07acb7f7eb1d507990a8b6b53c48f8af5","schema_version":"1.0","event_id":"sha256:295ce9b12f141d134d83731972809bf07acb7f7eb1d507990a8b6b53c48f8af5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACOHLKBUOONM3YWPBSYJLQC2U7/bundle.json","state_url":"https://pith.science/pith/ACOHLKBUOONM3YWPBSYJLQC2U7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACOHLKBUOONM3YWPBSYJLQC2U7/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-27T04:10:04Z","links":{"resolver":"https://pith.science/pith/ACOHLKBUOONM3YWPBSYJLQC2U7","bundle":"https://pith.science/pith/ACOHLKBUOONM3YWPBSYJLQC2U7/bundle.json","state":"https://pith.science/pith/ACOHLKBUOONM3YWPBSYJLQC2U7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACOHLKBUOONM3YWPBSYJLQC2U7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ACOHLKBUOONM3YWPBSYJLQC2U7","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":"35e3df47d902108ea2ea4e60fff090d7f9b846ff6ddc08b901764189768f6b4d","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-13T20:57:38Z","title_canon_sha256":"f97590ef8436d8e54ceb645effdc4e052e849257269aa4c79da25a00e9604dc6"},"schema_version":"1.0","source":{"id":"1907.06128","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06128","created_at":"2026-05-17T23:40:42Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06128v1","created_at":"2026-05-17T23:40:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06128","created_at":"2026-05-17T23:40:42Z"},{"alias_kind":"pith_short_12","alias_value":"ACOHLKBUOONM","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"ACOHLKBUOONM3YWP","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"ACOHLKBU","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:295ce9b12f141d134d83731972809bf07acb7f7eb1d507990a8b6b53c48f8af5","target":"graph","created_at":"2026-05-17T23:40:42Z","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":"In this paper, we study a continuous-time discounted jump Markov decision process with both controlled actions and observations. The observation is only available for a discrete set of time instances. At each time of observation, one has to select an optimal timing for the next observation and a control trajectory for the time interval between two observation points. We provide a theoretical framework that the decision maker can utilize to find the optimal observation epochs and the optimal actions jointly. Two cases are investigated. One is gated queueing systems in which we explicitly charac","authors_text":"Quanyan Zhu, Veeraruna Kavitha, Yunhan Huang","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-13T20:57:38Z","title":"Continuous-Time Markov Decision Processes with Controlled Observations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06128","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:8ff43777ecffbc4900ffede2218630c2b3732c36800410697b1a0143da415c63","target":"record","created_at":"2026-05-17T23:40:42Z","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":"35e3df47d902108ea2ea4e60fff090d7f9b846ff6ddc08b901764189768f6b4d","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-13T20:57:38Z","title_canon_sha256":"f97590ef8436d8e54ceb645effdc4e052e849257269aa4c79da25a00e9604dc6"},"schema_version":"1.0","source":{"id":"1907.06128","kind":"arxiv","version":1}},"canonical_sha256":"009c75a834739acde2cf0cb095c05aa7f8fe0d838111dff2ef70a057619a1da5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"009c75a834739acde2cf0cb095c05aa7f8fe0d838111dff2ef70a057619a1da5","first_computed_at":"2026-05-17T23:40:42.352563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:42.352563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d7VcyGBh7cOLYvTO+0FXrzpTd1IezLx9LmKciHC2QB6RowME0sc3OskWesLur9e65EtniwASIkLAMv3Y2dS4CA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:42.353125Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.06128","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ff43777ecffbc4900ffede2218630c2b3732c36800410697b1a0143da415c63","sha256:295ce9b12f141d134d83731972809bf07acb7f7eb1d507990a8b6b53c48f8af5"],"state_sha256":"7f0a76278ae6e7a527d84d042a20dc6b970359a1a51f3bab6b455bcd843830cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JkRUSvzI7wz1mMFuaWv+c+1fpuRNLKV2U/ivu7AgTUiDWssfpaMgFMZwPMg750xX+ejDfoz8BKBNiBpKtdbuDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:10:04.549408Z","bundle_sha256":"d8ddb3d803e7307725db2ac9d2144435d0619aaa53f7f7f715c4f8d4267f98ca"}}