{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:UUZPQID3GOD7RIUMET3W4KAJAA","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":"fcb60c4b81341dd69ad2b36e9649f5aaeab820130acbcbf5dfc8717e2e049aff","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-06T21:27:35Z","title_canon_sha256":"0535cc8a5da54e3a28a36d0e9c28501ab878bbb9f33b11074e894101ecf01842"},"schema_version":"1.0","source":{"id":"1010.1286","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1286","created_at":"2026-05-18T04:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1286v1","created_at":"2026-05-18T04:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1286","created_at":"2026-05-18T04:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"UUZPQID3GOD7","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UUZPQID3GOD7RIUM","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UUZPQID3","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:4c2c2fd236541d94847b5a996b67c921e4075f7133978734279c134237cc1ae3","target":"graph","created_at":"2026-05-18T04:39:41Z","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":"Let G be a finite strongly connected aperiodic directed graph in which each edge carries a label from a finite alphabet A. Then G induces a trellis coded quantizer for encoding an alphabet A memoryless source. A source sequence of long finite length is encoded by finding a path in G of that length whose sequence of labels is closest in Hamming distance to the source sequence; finding the minimum distance path is a dynamic programming problem that is solved using the Viterbi algorithm. We show how a Markov chain can be used to obtain a closed form expression for the asymptotic expected Hamming ","authors_text":"John Kieffer, Yu Liao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-06T21:27:35Z","title":"Exact Hamming Distortion Analysis of Viterbi Encoded Trellis Coded Quantizers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1286","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:1b3a3a56677e12bdddaa5a446a4978ce97e8e514369fd6cfadbe2bd2bcbaf8bc","target":"record","created_at":"2026-05-18T04:39:41Z","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":"fcb60c4b81341dd69ad2b36e9649f5aaeab820130acbcbf5dfc8717e2e049aff","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-06T21:27:35Z","title_canon_sha256":"0535cc8a5da54e3a28a36d0e9c28501ab878bbb9f33b11074e894101ecf01842"},"schema_version":"1.0","source":{"id":"1010.1286","kind":"arxiv","version":1}},"canonical_sha256":"a532f8207b3387f8a28c24f76e2809001858a362a4cee8875cedc74b6a288e68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a532f8207b3387f8a28c24f76e2809001858a362a4cee8875cedc74b6a288e68","first_computed_at":"2026-05-18T04:39:41.479770Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:41.479770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ww3KxEIWZKbyUOzGuQjLYV6C4IqM5peVWZg31RpBwXnlrnU5NlehiD8PWR9LA55zEPqq0EzQU1iNTtnVsxzHDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:41.480482Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.1286","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b3a3a56677e12bdddaa5a446a4978ce97e8e514369fd6cfadbe2bd2bcbaf8bc","sha256:4c2c2fd236541d94847b5a996b67c921e4075f7133978734279c134237cc1ae3"],"state_sha256":"d73b18556e872291b2d3b6a1aac59b794555d15ec5cf46eabcf3779726ec5e65"}