{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:42IXHVV22YXO6SA64HCMSBQWSY","short_pith_number":"pith:42IXHVV2","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"},"canonical_sha256":"e69173d6bad62eef481ee1c4c906169626a1dddbf085bdc16b4c4d71f7f7d537","source":{"kind":"arxiv","id":"1011.3761","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3761","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3761v2","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3761","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"42IXHVV22YXO","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"42IXHVV22YXO6SA6","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"42IXHVV2","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:42IXHVV22YXO6SA64HCMSBQWSY","target":"record","payload":{"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"},"canonical_sha256":"e69173d6bad62eef481ee1c4c906169626a1dddbf085bdc16b4c4d71f7f7d537","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"},"source_kind":"arxiv","source_id":"1011.3761","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:57:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AWXR+/+UIadiAN6fapweozTj+M5TvuKnelW3g9vhDatjAo8KnWujSo0NQ6m/ILq8CGSTwn+68cFNpHfEcJnTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:21:42.146041Z"},"content_sha256":"3f75f756783b6ae9c01bdb6c85e390cc3e4e4959ec5efc09ee26f38549114635","schema_version":"1.0","event_id":"sha256:3f75f756783b6ae9c01bdb6c85e390cc3e4e4959ec5efc09ee26f38549114635"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:42IXHVV22YXO6SA64HCMSBQWSY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:57:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uOQDJx1gMIrvkkrn5bX+7iF0ZUdHFNx9SseUHzb+t434U5Wo3mjXOlkkEps3WKQZW5OCTMo4DyD4VU3FE0GOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:21:42.146775Z"},"content_sha256":"a175f32a21cbdfd72d7376ab4479322dd492ff9b54cce6e374d1db94606daed5","schema_version":"1.0","event_id":"sha256:a175f32a21cbdfd72d7376ab4479322dd492ff9b54cce6e374d1db94606daed5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42IXHVV22YXO6SA64HCMSBQWSY/bundle.json","state_url":"https://pith.science/pith/42IXHVV22YXO6SA64HCMSBQWSY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42IXHVV22YXO6SA64HCMSBQWSY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T19:21:42Z","links":{"resolver":"https://pith.science/pith/42IXHVV22YXO6SA64HCMSBQWSY","bundle":"https://pith.science/pith/42IXHVV22YXO6SA64HCMSBQWSY/bundle.json","state":"https://pith.science/pith/42IXHVV22YXO6SA64HCMSBQWSY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42IXHVV22YXO6SA64HCMSBQWSY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:42IXHVV22YXO6SA64HCMSBQWSY","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":"04ff5c002a70d161303f22fd77797e490975a10335f3241a4d14f55f109b9288","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-16T17:14:16Z","title_canon_sha256":"c6647846d496c683750191dc00538a6b6edb982482688c890fe6781bd13d1d45"},"schema_version":"1.0","source":{"id":"1011.3761","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3761","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3761v2","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3761","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"42IXHVV22YXO","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"42IXHVV22YXO6SA6","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"42IXHVV2","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:a175f32a21cbdfd72d7376ab4479322dd492ff9b54cce6e374d1db94606daed5","target":"graph","created_at":"2026-05-18T00:57:57Z","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":"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","authors_text":"Andrea Montanari, Shirin Jalali, Tsachy Weissman","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-16T17:14:16Z","title":"Lossy compression of discrete sources via Viterbi algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3761","kind":"arxiv","version":2},"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:3f75f756783b6ae9c01bdb6c85e390cc3e4e4959ec5efc09ee26f38549114635","target":"record","created_at":"2026-05-18T00:57:57Z","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":"04ff5c002a70d161303f22fd77797e490975a10335f3241a4d14f55f109b9288","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-16T17:14:16Z","title_canon_sha256":"c6647846d496c683750191dc00538a6b6edb982482688c890fe6781bd13d1d45"},"schema_version":"1.0","source":{"id":"1011.3761","kind":"arxiv","version":2}},"canonical_sha256":"e69173d6bad62eef481ee1c4c906169626a1dddbf085bdc16b4c4d71f7f7d537","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e69173d6bad62eef481ee1c4c906169626a1dddbf085bdc16b4c4d71f7f7d537","first_computed_at":"2026-05-18T00:57:57.545998Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:57.545998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jmTX6aejBOjDk27FcSP2gKwp9OjCPGBdbd6NSNxBtyG3pLpft/REUhW0Q4iRGijeWIF+IyqforSuRxeQqSXsAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:57.546352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.3761","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f75f756783b6ae9c01bdb6c85e390cc3e4e4959ec5efc09ee26f38549114635","sha256:a175f32a21cbdfd72d7376ab4479322dd492ff9b54cce6e374d1db94606daed5"],"state_sha256":"80e8af1172a7a1ae307f6433343cff5f88ccf19cc6b2ee88ea4471cf477b4cb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wkCCGgWXqTvElm5NllKyMYAfdkQrM/ikhHqfyclE1yy5stXj8ei4nRXAwFMFCweksRnz/uz3ivzfSkakF6VGDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:21:42.150845Z","bundle_sha256":"9e0116b245650155aada9f49c9850a3fe8b17a8fe2302dbf4403c48036adda18"}}