{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:S43SCWSCZJAL6CTGXPDVCYRK53","short_pith_number":"pith:S43SCWSC","schema_version":"1.0","canonical_sha256":"9737215a42ca40bf0a66bbc751622aeede4c240bc0d7cd76445c5a531f8125b7","source":{"kind":"arxiv","id":"1707.07202","version":2},"attestation_state":"computed","paper":{"title":"Optimal control of continuous-time Markov chains with noise-free observation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alessandro Calvia","submitted_at":"2017-07-22T18:26:38Z","abstract_excerpt":"We consider an infinite horizon optimal control problem for a continuous-time Markov chain $X$ in a finite set $I$ with noise-free partial observation. The observation process is defined as $Y_t = h(X_t)$, $t \\geq 0$, where $h$ is a given map defined on $I$. The observation is noise-free in the sense that the only source of randomness is the process $X$ itself. The aim is to minimize a discounted cost functional and study the associated value function $V$. After transforming the control problem with partial observation into one with complete observation (the separated problem) using filtering "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1707.07202","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-22T18:26:38Z","cross_cats_sorted":[],"title_canon_sha256":"8ab5d9723bab8fd0d82dc9d5e0b26574cfc50ec980d12d8d5108caceda159f1f","abstract_canon_sha256":"12e4eb28b204cda44abff9a729e460daf06d625bba403adfd8506be61d0f173d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:28.865967Z","signature_b64":"GoPMnsIO7nHULsj42CICDhEgrfudTCLlLW9X2nSB3zz1lEfVfYcrSQlqSm8nqfpWwqK7zhtlbx4vc7qvO78xAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9737215a42ca40bf0a66bbc751622aeede4c240bc0d7cd76445c5a531f8125b7","last_reissued_at":"2026-05-18T00:14:28.865260Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:28.865260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal control of continuous-time Markov chains with noise-free observation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alessandro Calvia","submitted_at":"2017-07-22T18:26:38Z","abstract_excerpt":"We consider an infinite horizon optimal control problem for a continuous-time Markov chain $X$ in a finite set $I$ with noise-free partial observation. The observation process is defined as $Y_t = h(X_t)$, $t \\geq 0$, where $h$ is a given map defined on $I$. The observation is noise-free in the sense that the only source of randomness is the process $X$ itself. The aim is to minimize a discounted cost functional and study the associated value function $V$. After transforming the control problem with partial observation into one with complete observation (the separated problem) using filtering "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07202","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.07202","created_at":"2026-05-18T00:14:28.865388+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.07202v2","created_at":"2026-05-18T00:14:28.865388+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07202","created_at":"2026-05-18T00:14:28.865388+00:00"},{"alias_kind":"pith_short_12","alias_value":"S43SCWSCZJAL","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"S43SCWSCZJAL6CTG","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"S43SCWSC","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S43SCWSCZJAL6CTGXPDVCYRK53","json":"https://pith.science/pith/S43SCWSCZJAL6CTGXPDVCYRK53.json","graph_json":"https://pith.science/api/pith-number/S43SCWSCZJAL6CTGXPDVCYRK53/graph.json","events_json":"https://pith.science/api/pith-number/S43SCWSCZJAL6CTGXPDVCYRK53/events.json","paper":"https://pith.science/paper/S43SCWSC"},"agent_actions":{"view_html":"https://pith.science/pith/S43SCWSCZJAL6CTGXPDVCYRK53","download_json":"https://pith.science/pith/S43SCWSCZJAL6CTGXPDVCYRK53.json","view_paper":"https://pith.science/paper/S43SCWSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.07202&json=true","fetch_graph":"https://pith.science/api/pith-number/S43SCWSCZJAL6CTGXPDVCYRK53/graph.json","fetch_events":"https://pith.science/api/pith-number/S43SCWSCZJAL6CTGXPDVCYRK53/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S43SCWSCZJAL6CTGXPDVCYRK53/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S43SCWSCZJAL6CTGXPDVCYRK53/action/storage_attestation","attest_author":"https://pith.science/pith/S43SCWSCZJAL6CTGXPDVCYRK53/action/author_attestation","sign_citation":"https://pith.science/pith/S43SCWSCZJAL6CTGXPDVCYRK53/action/citation_signature","submit_replication":"https://pith.science/pith/S43SCWSCZJAL6CTGXPDVCYRK53/action/replication_record"}},"created_at":"2026-05-18T00:14:28.865388+00:00","updated_at":"2026-05-18T00:14:28.865388+00:00"}