{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:42IXHVV22YXO6SA64HCMSBQWSY","short_pith_number":"pith:42IXHVV2","schema_version":"1.0","canonical_sha256":"e69173d6bad62eef481ee1c4c906169626a1dddbf085bdc16b4c4d71f7f7d537","source":{"kind":"arxiv","id":"1011.3761","version":2},"attestation_state":"computed","paper":{"title":"Lossy compression of discrete sources via Viterbi algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrea Montanari, Shirin Jalali, Tsachy Weissman","submitted_at":"2010-11-16T17:14:16Z","abstract_excerpt":"We present a new lossy compressor for discrete-valued sources. For coding a sequence $x^n$, the encoder starts by assigning a certain cost to each possible reconstruction sequence. It then finds the one that minimizes this cost and describes it losslessly to the decoder via a universal lossless compressor. The cost of each sequence is a linear combination of its distance from the sequence $x^n$ and a linear function of its $k^{\\rm th}$ order empirical distribution. The structure of the cost function allows the encoder to employ the Viterbi algorithm to recover the minimizer of the cost. We ide"},"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":"1011.3761","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-16T17:14:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c6647846d496c683750191dc00538a6b6edb982482688c890fe6781bd13d1d45","abstract_canon_sha256":"04ff5c002a70d161303f22fd77797e490975a10335f3241a4d14f55f109b9288"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:57.546352Z","signature_b64":"jmTX6aejBOjDk27FcSP2gKwp9OjCPGBdbd6NSNxBtyG3pLpft/REUhW0Q4iRGijeWIF+IyqforSuRxeQqSXsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e69173d6bad62eef481ee1c4c906169626a1dddbf085bdc16b4c4d71f7f7d537","last_reissued_at":"2026-05-18T00:57:57.545998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:57.545998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lossy compression of discrete sources via Viterbi algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrea Montanari, Shirin Jalali, Tsachy Weissman","submitted_at":"2010-11-16T17:14:16Z","abstract_excerpt":"We present a new lossy compressor for discrete-valued sources. For coding a sequence $x^n$, the encoder starts by assigning a certain cost to each possible reconstruction sequence. It then finds the one that minimizes this cost and describes it losslessly to the decoder via a universal lossless compressor. The cost of each sequence is a linear combination of its distance from the sequence $x^n$ and a linear function of its $k^{\\rm th}$ order empirical distribution. The structure of the cost function allows the encoder to employ the Viterbi algorithm to recover the minimizer of the cost. We ide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3761","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":"1011.3761","created_at":"2026-05-18T00:57:57.546053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.3761v2","created_at":"2026-05-18T00:57:57.546053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3761","created_at":"2026-05-18T00:57:57.546053+00:00"},{"alias_kind":"pith_short_12","alias_value":"42IXHVV22YXO","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"42IXHVV22YXO6SA6","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"42IXHVV2","created_at":"2026-05-18T12:26:03.138858+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/42IXHVV22YXO6SA64HCMSBQWSY","json":"https://pith.science/pith/42IXHVV22YXO6SA64HCMSBQWSY.json","graph_json":"https://pith.science/api/pith-number/42IXHVV22YXO6SA64HCMSBQWSY/graph.json","events_json":"https://pith.science/api/pith-number/42IXHVV22YXO6SA64HCMSBQWSY/events.json","paper":"https://pith.science/paper/42IXHVV2"},"agent_actions":{"view_html":"https://pith.science/pith/42IXHVV22YXO6SA64HCMSBQWSY","download_json":"https://pith.science/pith/42IXHVV22YXO6SA64HCMSBQWSY.json","view_paper":"https://pith.science/paper/42IXHVV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.3761&json=true","fetch_graph":"https://pith.science/api/pith-number/42IXHVV22YXO6SA64HCMSBQWSY/graph.json","fetch_events":"https://pith.science/api/pith-number/42IXHVV22YXO6SA64HCMSBQWSY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42IXHVV22YXO6SA64HCMSBQWSY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42IXHVV22YXO6SA64HCMSBQWSY/action/storage_attestation","attest_author":"https://pith.science/pith/42IXHVV22YXO6SA64HCMSBQWSY/action/author_attestation","sign_citation":"https://pith.science/pith/42IXHVV22YXO6SA64HCMSBQWSY/action/citation_signature","submit_replication":"https://pith.science/pith/42IXHVV22YXO6SA64HCMSBQWSY/action/replication_record"}},"created_at":"2026-05-18T00:57:57.546053+00:00","updated_at":"2026-05-18T00:57:57.546053+00:00"}