{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:WYS7ECLFV6KZ32MONPFGDAZVAO","short_pith_number":"pith:WYS7ECLF","schema_version":"1.0","canonical_sha256":"b625f20965af959de98e6bca61833503b85cb7d09a4b7508d48a2081a993e124","source":{"kind":"arxiv","id":"1010.4824","version":4},"attestation_state":"computed","paper":{"title":"On Optimal Causal Coding of Partially Observed Markov Sources in Single and Multi-Terminal Settings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Serdar Y\\\"uksel","submitted_at":"2010-10-22T22:52:01Z","abstract_excerpt":"The optimal causal coding of a partially observed Markov process is studied, where the cost to be minimized is a bounded, non-negative, additive, measurable single-letter function of the source and the receiver output. A structural result is obtained extending Witsenhausen's and Walrand-Varaiya's structural results on optimal real-time coders to a partially observed setting. The decentralized (multi-terminal) setup is also considered. For the case where the source is an i.i.d. process, it is shown that the optimal decentralized causal coding of correlated observations problem admits a solution"},"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":"1010.4824","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-22T22:52:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ed9e81deb6772ed875182ed24fd10768833949475047386485022552d4eddbe7","abstract_canon_sha256":"aec25aac393f7995b4594c713d9854428becb76bc3ba7773f3806806ba97da8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:13.884027Z","signature_b64":"UCOtjQuR68mfqqfhi8WxoDL+f6Pqi1VWGQ9E2v8/fUZBbntwRKO38+JdFumAttR9Tvhqg8cqh7qwCIJ5BXpKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b625f20965af959de98e6bca61833503b85cb7d09a4b7508d48a2081a993e124","last_reissued_at":"2026-05-18T03:48:13.883239Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:13.883239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Optimal Causal Coding of Partially Observed Markov Sources in Single and Multi-Terminal Settings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Serdar Y\\\"uksel","submitted_at":"2010-10-22T22:52:01Z","abstract_excerpt":"The optimal causal coding of a partially observed Markov process is studied, where the cost to be minimized is a bounded, non-negative, additive, measurable single-letter function of the source and the receiver output. A structural result is obtained extending Witsenhausen's and Walrand-Varaiya's structural results on optimal real-time coders to a partially observed setting. The decentralized (multi-terminal) setup is also considered. For the case where the source is an i.i.d. process, it is shown that the optimal decentralized causal coding of correlated observations problem admits a solution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.4824","kind":"arxiv","version":4},"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":"1010.4824","created_at":"2026-05-18T03:48:13.883374+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.4824v4","created_at":"2026-05-18T03:48:13.883374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.4824","created_at":"2026-05-18T03:48:13.883374+00:00"},{"alias_kind":"pith_short_12","alias_value":"WYS7ECLFV6KZ","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"WYS7ECLFV6KZ32MO","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"WYS7ECLF","created_at":"2026-05-18T12:26:17.028572+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/WYS7ECLFV6KZ32MONPFGDAZVAO","json":"https://pith.science/pith/WYS7ECLFV6KZ32MONPFGDAZVAO.json","graph_json":"https://pith.science/api/pith-number/WYS7ECLFV6KZ32MONPFGDAZVAO/graph.json","events_json":"https://pith.science/api/pith-number/WYS7ECLFV6KZ32MONPFGDAZVAO/events.json","paper":"https://pith.science/paper/WYS7ECLF"},"agent_actions":{"view_html":"https://pith.science/pith/WYS7ECLFV6KZ32MONPFGDAZVAO","download_json":"https://pith.science/pith/WYS7ECLFV6KZ32MONPFGDAZVAO.json","view_paper":"https://pith.science/paper/WYS7ECLF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.4824&json=true","fetch_graph":"https://pith.science/api/pith-number/WYS7ECLFV6KZ32MONPFGDAZVAO/graph.json","fetch_events":"https://pith.science/api/pith-number/WYS7ECLFV6KZ32MONPFGDAZVAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WYS7ECLFV6KZ32MONPFGDAZVAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WYS7ECLFV6KZ32MONPFGDAZVAO/action/storage_attestation","attest_author":"https://pith.science/pith/WYS7ECLFV6KZ32MONPFGDAZVAO/action/author_attestation","sign_citation":"https://pith.science/pith/WYS7ECLFV6KZ32MONPFGDAZVAO/action/citation_signature","submit_replication":"https://pith.science/pith/WYS7ECLFV6KZ32MONPFGDAZVAO/action/replication_record"}},"created_at":"2026-05-18T03:48:13.883374+00:00","updated_at":"2026-05-18T03:48:13.883374+00:00"}