{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:UUZPQID3GOD7RIUMET3W4KAJAA","short_pith_number":"pith:UUZPQID3","schema_version":"1.0","canonical_sha256":"a532f8207b3387f8a28c24f76e2809001858a362a4cee8875cedc74b6a288e68","source":{"kind":"arxiv","id":"1010.1286","version":1},"attestation_state":"computed","paper":{"title":"Exact Hamming Distortion Analysis of Viterbi Encoded Trellis Coded Quantizers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"John Kieffer, Yu Liao","submitted_at":"2010-10-06T21:27:35Z","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 "},"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.1286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-06T21:27:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0535cc8a5da54e3a28a36d0e9c28501ab878bbb9f33b11074e894101ecf01842","abstract_canon_sha256":"fcb60c4b81341dd69ad2b36e9649f5aaeab820130acbcbf5dfc8717e2e049aff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:41.480482Z","signature_b64":"ww3KxEIWZKbyUOzGuQjLYV6C4IqM5peVWZg31RpBwXnlrnU5NlehiD8PWR9LA55zEPqq0EzQU1iNTtnVsxzHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a532f8207b3387f8a28c24f76e2809001858a362a4cee8875cedc74b6a288e68","last_reissued_at":"2026-05-18T04:39:41.479770Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:41.479770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Hamming Distortion Analysis of Viterbi Encoded Trellis Coded Quantizers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"John Kieffer, Yu Liao","submitted_at":"2010-10-06T21:27:35Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1286","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1010.1286","created_at":"2026-05-18T04:39:41.479881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.1286v1","created_at":"2026-05-18T04:39:41.479881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1286","created_at":"2026-05-18T04:39:41.479881+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUZPQID3GOD7","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUZPQID3GOD7RIUM","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUZPQID3","created_at":"2026-05-18T12:26:15.391820+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/UUZPQID3GOD7RIUMET3W4KAJAA","json":"https://pith.science/pith/UUZPQID3GOD7RIUMET3W4KAJAA.json","graph_json":"https://pith.science/api/pith-number/UUZPQID3GOD7RIUMET3W4KAJAA/graph.json","events_json":"https://pith.science/api/pith-number/UUZPQID3GOD7RIUMET3W4KAJAA/events.json","paper":"https://pith.science/paper/UUZPQID3"},"agent_actions":{"view_html":"https://pith.science/pith/UUZPQID3GOD7RIUMET3W4KAJAA","download_json":"https://pith.science/pith/UUZPQID3GOD7RIUMET3W4KAJAA.json","view_paper":"https://pith.science/paper/UUZPQID3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.1286&json=true","fetch_graph":"https://pith.science/api/pith-number/UUZPQID3GOD7RIUMET3W4KAJAA/graph.json","fetch_events":"https://pith.science/api/pith-number/UUZPQID3GOD7RIUMET3W4KAJAA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUZPQID3GOD7RIUMET3W4KAJAA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUZPQID3GOD7RIUMET3W4KAJAA/action/storage_attestation","attest_author":"https://pith.science/pith/UUZPQID3GOD7RIUMET3W4KAJAA/action/author_attestation","sign_citation":"https://pith.science/pith/UUZPQID3GOD7RIUMET3W4KAJAA/action/citation_signature","submit_replication":"https://pith.science/pith/UUZPQID3GOD7RIUMET3W4KAJAA/action/replication_record"}},"created_at":"2026-05-18T04:39:41.479881+00:00","updated_at":"2026-05-18T04:39:41.479881+00:00"}