{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:P7LYGIFFT3NMNNUDVMSM23YDGX","short_pith_number":"pith:P7LYGIFF","canonical_record":{"source":{"id":"1609.08868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-28T11:57:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f4d67b7bc3998b5771ad5215234e7ff8187fbb2eb51968d2fda03b6db80592de","abstract_canon_sha256":"19b81210d5449ebed31e90dfb156efd5ad9aa20d210e7ac56ca7b2bfb5df4844"},"schema_version":"1.0"},"canonical_sha256":"7fd78320a59edac6b683ab24cd6f0335d10ad324e5c1fb0dc9182412a6765fdc","source":{"kind":"arxiv","id":"1609.08868","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08868","created_at":"2026-05-18T01:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08868v1","created_at":"2026-05-18T01:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08868","created_at":"2026-05-18T01:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"P7LYGIFFT3NM","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"P7LYGIFFT3NMNNUD","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"P7LYGIFF","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:P7LYGIFFT3NMNNUDVMSM23YDGX","target":"record","payload":{"canonical_record":{"source":{"id":"1609.08868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-28T11:57:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f4d67b7bc3998b5771ad5215234e7ff8187fbb2eb51968d2fda03b6db80592de","abstract_canon_sha256":"19b81210d5449ebed31e90dfb156efd5ad9aa20d210e7ac56ca7b2bfb5df4844"},"schema_version":"1.0"},"canonical_sha256":"7fd78320a59edac6b683ab24cd6f0335d10ad324e5c1fb0dc9182412a6765fdc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:41.697807Z","signature_b64":"zPud8ISiwnYxrNnksWzEBBCRKngzI7fGElTNIjeKjHc9E2wVG2w0+sJ9ATEcmUOF2qTb9vAvFjWU4OT/OCp2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fd78320a59edac6b683ab24cd6f0335d10ad324e5c1fb0dc9182412a6765fdc","last_reissued_at":"2026-05-18T01:03:41.697418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:41.697418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.08868","source_version":1,"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-18T01:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qEB4CRXTFCxz3U4mimIekasWaEz7Tf1nlYwDe4YSLMPABs8OpBJAnUOu5+k/sifFe09XptgU5M0QQ0nrWmPPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:09:08.727020Z"},"content_sha256":"c1b04d6d9cc9f90301ec6d9b97b4bc768b510525b0604b76457891052552aed5","schema_version":"1.0","event_id":"sha256:c1b04d6d9cc9f90301ec6d9b97b4bc768b510525b0604b76457891052552aed5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:P7LYGIFFT3NMNNUDVMSM23YDGX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reliability of universal decoding based on vector-quantized codewords","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2016-09-28T11:57:33Z","abstract_excerpt":"Motivated by applications of biometric identification and content identification systems, we consider the problem of random coding for channels, where each codeword undergoes lossy compression (vector quantization), and where the decoder bases its decision only on the compressed codewords and the channel output, which is in turn, the channel's response to the transmission of an original codeword, before compression. For memoryless sources and memoryless channels with finite alphabets, we propose a new universal decoder and analyze its error exponent, which improves on an earlier result by Dasa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08868","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"},"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-18T01:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c63JdzMlNiDsStnQzoPVbDduLBfCyWzehZXShh0GHPNoYtwf5F5uMfzxabD32U/u7iL/RLyR2xUlVJyU2caVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:09:08.727574Z"},"content_sha256":"e54337070404134219391060109bd537368fe0e148ab15d4d5752b335b82df64","schema_version":"1.0","event_id":"sha256:e54337070404134219391060109bd537368fe0e148ab15d4d5752b335b82df64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P7LYGIFFT3NMNNUDVMSM23YDGX/bundle.json","state_url":"https://pith.science/pith/P7LYGIFFT3NMNNUDVMSM23YDGX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P7LYGIFFT3NMNNUDVMSM23YDGX/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-05-27T18:09:08Z","links":{"resolver":"https://pith.science/pith/P7LYGIFFT3NMNNUDVMSM23YDGX","bundle":"https://pith.science/pith/P7LYGIFFT3NMNNUDVMSM23YDGX/bundle.json","state":"https://pith.science/pith/P7LYGIFFT3NMNNUDVMSM23YDGX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P7LYGIFFT3NMNNUDVMSM23YDGX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:P7LYGIFFT3NMNNUDVMSM23YDGX","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":"19b81210d5449ebed31e90dfb156efd5ad9aa20d210e7ac56ca7b2bfb5df4844","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-28T11:57:33Z","title_canon_sha256":"f4d67b7bc3998b5771ad5215234e7ff8187fbb2eb51968d2fda03b6db80592de"},"schema_version":"1.0","source":{"id":"1609.08868","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08868","created_at":"2026-05-18T01:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08868v1","created_at":"2026-05-18T01:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08868","created_at":"2026-05-18T01:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"P7LYGIFFT3NM","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"P7LYGIFFT3NMNNUD","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"P7LYGIFF","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:e54337070404134219391060109bd537368fe0e148ab15d4d5752b335b82df64","target":"graph","created_at":"2026-05-18T01:03: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":"Motivated by applications of biometric identification and content identification systems, we consider the problem of random coding for channels, where each codeword undergoes lossy compression (vector quantization), and where the decoder bases its decision only on the compressed codewords and the channel output, which is in turn, the channel's response to the transmission of an original codeword, before compression. For memoryless sources and memoryless channels with finite alphabets, we propose a new universal decoder and analyze its error exponent, which improves on an earlier result by Dasa","authors_text":"Neri Merhav","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-28T11:57:33Z","title":"Reliability of universal decoding based on vector-quantized codewords"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08868","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:c1b04d6d9cc9f90301ec6d9b97b4bc768b510525b0604b76457891052552aed5","target":"record","created_at":"2026-05-18T01:03: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":"19b81210d5449ebed31e90dfb156efd5ad9aa20d210e7ac56ca7b2bfb5df4844","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-28T11:57:33Z","title_canon_sha256":"f4d67b7bc3998b5771ad5215234e7ff8187fbb2eb51968d2fda03b6db80592de"},"schema_version":"1.0","source":{"id":"1609.08868","kind":"arxiv","version":1}},"canonical_sha256":"7fd78320a59edac6b683ab24cd6f0335d10ad324e5c1fb0dc9182412a6765fdc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fd78320a59edac6b683ab24cd6f0335d10ad324e5c1fb0dc9182412a6765fdc","first_computed_at":"2026-05-18T01:03:41.697418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:41.697418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zPud8ISiwnYxrNnksWzEBBCRKngzI7fGElTNIjeKjHc9E2wVG2w0+sJ9ATEcmUOF2qTb9vAvFjWU4OT/OCp2Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:41.697807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.08868","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1b04d6d9cc9f90301ec6d9b97b4bc768b510525b0604b76457891052552aed5","sha256:e54337070404134219391060109bd537368fe0e148ab15d4d5752b335b82df64"],"state_sha256":"770507a01ee84aa846e8ffc300b460689bdd6214c55a17b01c7eeb3f7ee795ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"meBS0jvknDbKR6LhZEbicHoWie8CPZIbAo1YJ83sEK05ikxAY8uAVCPhGVaA6vpH7hZeD+Flt40QOiKrOL4oDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:09:08.730757Z","bundle_sha256":"936e9ef2267cc8be2a4e903ac83bb93a9946200043bebb6162d9bf94368801ae"}}