{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DT3AMLLZDPGU25LA2IRJWAA7UH","short_pith_number":"pith:DT3AMLLZ","schema_version":"1.0","canonical_sha256":"1cf6062d791bcd4d7560d2229b001fa1fb4be09415a5113a5eac23ce7d73486b","source":{"kind":"arxiv","id":"1606.09135","version":2},"attestation_state":"computed","paper":{"title":"Optimal Zero Delay Coding of Markov Sources: Stationary and Finite Memory Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Richard G. Wood, Serdar Y\\\"uksel, Tam\\'as Linder","submitted_at":"2016-06-29T14:54:23Z","abstract_excerpt":"The optimal zero delay coding of a finite state Markov source is considered. The existence and structure of optimal codes are studied using a stochastic control formulation. Prior results in the literature established the optimality of deterministic Markov (Walrand-Varaiya type) coding policies for finite time horizon problem, and the optimality of both deterministic nonstationary and randomized stationary policies for the infinite time horizon problem. Our main result here shows that for any irreducible and aperiodic Markov source with a finite alphabet, \\emph{deterministic and stationary} Ma"},"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":"1606.09135","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-29T14:54:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1de5777d840ba81cf1b81ba95d4e569b58b2712b56eeb9c2aa6ee83dfd4eb7f9","abstract_canon_sha256":"6e05f413fdd5d79372da861e6e31e4b145aebe7445f8481bd47d43e5c4523d6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:55.664459Z","signature_b64":"B8uhDp0ywOC9fZmoNoknUv3WEhZXE1DMDcdIgGqs7dWgKhSIybv+eTeFsGXAyeatRVz5MHOPIthJmqZI2b/VAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cf6062d791bcd4d7560d2229b001fa1fb4be09415a5113a5eac23ce7d73486b","last_reissued_at":"2026-05-18T00:46:55.663649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:55.663649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Zero Delay Coding of Markov Sources: Stationary and Finite Memory Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Richard G. Wood, Serdar Y\\\"uksel, Tam\\'as Linder","submitted_at":"2016-06-29T14:54:23Z","abstract_excerpt":"The optimal zero delay coding of a finite state Markov source is considered. The existence and structure of optimal codes are studied using a stochastic control formulation. Prior results in the literature established the optimality of deterministic Markov (Walrand-Varaiya type) coding policies for finite time horizon problem, and the optimality of both deterministic nonstationary and randomized stationary policies for the infinite time horizon problem. Our main result here shows that for any irreducible and aperiodic Markov source with a finite alphabet, \\emph{deterministic and stationary} Ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.09135","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":"1606.09135","created_at":"2026-05-18T00:46:55.663820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.09135v2","created_at":"2026-05-18T00:46:55.663820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.09135","created_at":"2026-05-18T00:46:55.663820+00:00"},{"alias_kind":"pith_short_12","alias_value":"DT3AMLLZDPGU","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DT3AMLLZDPGU25LA","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DT3AMLLZ","created_at":"2026-05-18T12:30:12.583610+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/DT3AMLLZDPGU25LA2IRJWAA7UH","json":"https://pith.science/pith/DT3AMLLZDPGU25LA2IRJWAA7UH.json","graph_json":"https://pith.science/api/pith-number/DT3AMLLZDPGU25LA2IRJWAA7UH/graph.json","events_json":"https://pith.science/api/pith-number/DT3AMLLZDPGU25LA2IRJWAA7UH/events.json","paper":"https://pith.science/paper/DT3AMLLZ"},"agent_actions":{"view_html":"https://pith.science/pith/DT3AMLLZDPGU25LA2IRJWAA7UH","download_json":"https://pith.science/pith/DT3AMLLZDPGU25LA2IRJWAA7UH.json","view_paper":"https://pith.science/paper/DT3AMLLZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.09135&json=true","fetch_graph":"https://pith.science/api/pith-number/DT3AMLLZDPGU25LA2IRJWAA7UH/graph.json","fetch_events":"https://pith.science/api/pith-number/DT3AMLLZDPGU25LA2IRJWAA7UH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DT3AMLLZDPGU25LA2IRJWAA7UH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DT3AMLLZDPGU25LA2IRJWAA7UH/action/storage_attestation","attest_author":"https://pith.science/pith/DT3AMLLZDPGU25LA2IRJWAA7UH/action/author_attestation","sign_citation":"https://pith.science/pith/DT3AMLLZDPGU25LA2IRJWAA7UH/action/citation_signature","submit_replication":"https://pith.science/pith/DT3AMLLZDPGU25LA2IRJWAA7UH/action/replication_record"}},"created_at":"2026-05-18T00:46:55.663820+00:00","updated_at":"2026-05-18T00:46:55.663820+00:00"}