{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WXN2U3KSXITUS7GFTORSVTMNBU","short_pith_number":"pith:WXN2U3KS","canonical_record":{"source":{"id":"1411.3597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-13T16:04:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8aaf887d7164dc9927b0d35303b3fe9c410101bdb817a4e2f94b8d8d2de46f07","abstract_canon_sha256":"1a53ce6d79f61cd38e46eb0881521e70cff637c43eed441b11fc6fc7f2ed0aeb"},"schema_version":"1.0"},"canonical_sha256":"b5dbaa6d52ba27497cc59ba32acd8d0d3b7a773b74dcd142037759db764de0dc","source":{"kind":"arxiv","id":"1411.3597","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3597","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3597v1","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3597","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"WXN2U3KSXITU","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WXN2U3KSXITUS7GF","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WXN2U3KS","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WXN2U3KSXITUS7GFTORSVTMNBU","target":"record","payload":{"canonical_record":{"source":{"id":"1411.3597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-13T16:04:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8aaf887d7164dc9927b0d35303b3fe9c410101bdb817a4e2f94b8d8d2de46f07","abstract_canon_sha256":"1a53ce6d79f61cd38e46eb0881521e70cff637c43eed441b11fc6fc7f2ed0aeb"},"schema_version":"1.0"},"canonical_sha256":"b5dbaa6d52ba27497cc59ba32acd8d0d3b7a773b74dcd142037759db764de0dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:43.383042Z","signature_b64":"bx07RUHG+XQJnGJchIAvcbngn5R7uJLB1jeNqNnR5QCucUHduNb4Hc1w0hu2hXCXebx3zulOj1ox78zOHxQ7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5dbaa6d52ba27497cc59ba32acd8d0d3b7a773b74dcd142037759db764de0dc","last_reissued_at":"2026-05-18T02:37:43.382454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:43.382454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.3597","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-18T02:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3F8M5UaEXdKHPdKmBklDe79OohHxHvooQ2k5sCnME9i1mB+RB41QRESv1c8IwuVxSHk3Y0ZBdNClPmJYgWpyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:38:55.900526Z"},"content_sha256":"b4cbb67fe11e8cf5fe5e450d03013e7f7a6bbee60506a916310d5f628e3c1c2c","schema_version":"1.0","event_id":"sha256:b4cbb67fe11e8cf5fe5e450d03013e7f7a6bbee60506a916310d5f628e3c1c2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WXN2U3KSXITUS7GFTORSVTMNBU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal Quantization for Separate Encodings and Joint Decoding of Correlated Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Avraham Reani, Neri Merhav","submitted_at":"2014-11-13T16:04:32Z","abstract_excerpt":"We consider the multi-user lossy source-coding problem for continuous alphabet sources. In a previous work, Ziv proposed a single-user universal coding scheme which uses uniform quantization with dither, followed by a lossless source encoder (entropy coder). In this paper, we generalize Ziv's scheme to the multi-user setting. For this generalized universal scheme, upper bounds are derived on the redundancies, defined as the differences between the actual rates and the closest corresponding rates on the boundary of the rate region. It is shown that this scheme can achieve redundancies of no mor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3597","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-18T02:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B2BiI6fwUdnq5pvlNc2EyqHmiTvbbOr4L6fonVN+GbWDfbyfZ0jmvihSjvIN4H7btXajrpuanVEO9w1oMgsfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:38:55.900906Z"},"content_sha256":"d67c727e57fe62d2ad0263a8c5ee96052b994afae43da4ab5a9d96226549d11d","schema_version":"1.0","event_id":"sha256:d67c727e57fe62d2ad0263a8c5ee96052b994afae43da4ab5a9d96226549d11d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WXN2U3KSXITUS7GFTORSVTMNBU/bundle.json","state_url":"https://pith.science/pith/WXN2U3KSXITUS7GFTORSVTMNBU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WXN2U3KSXITUS7GFTORSVTMNBU/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-27T21:38:55Z","links":{"resolver":"https://pith.science/pith/WXN2U3KSXITUS7GFTORSVTMNBU","bundle":"https://pith.science/pith/WXN2U3KSXITUS7GFTORSVTMNBU/bundle.json","state":"https://pith.science/pith/WXN2U3KSXITUS7GFTORSVTMNBU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WXN2U3KSXITUS7GFTORSVTMNBU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WXN2U3KSXITUS7GFTORSVTMNBU","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":"1a53ce6d79f61cd38e46eb0881521e70cff637c43eed441b11fc6fc7f2ed0aeb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-13T16:04:32Z","title_canon_sha256":"8aaf887d7164dc9927b0d35303b3fe9c410101bdb817a4e2f94b8d8d2de46f07"},"schema_version":"1.0","source":{"id":"1411.3597","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3597","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3597v1","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3597","created_at":"2026-05-18T02:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"WXN2U3KSXITU","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WXN2U3KSXITUS7GF","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WXN2U3KS","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:d67c727e57fe62d2ad0263a8c5ee96052b994afae43da4ab5a9d96226549d11d","target":"graph","created_at":"2026-05-18T02:37:43Z","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 consider the multi-user lossy source-coding problem for continuous alphabet sources. In a previous work, Ziv proposed a single-user universal coding scheme which uses uniform quantization with dither, followed by a lossless source encoder (entropy coder). In this paper, we generalize Ziv's scheme to the multi-user setting. For this generalized universal scheme, upper bounds are derived on the redundancies, defined as the differences between the actual rates and the closest corresponding rates on the boundary of the rate region. It is shown that this scheme can achieve redundancies of no mor","authors_text":"Avraham Reani, Neri Merhav","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-13T16:04:32Z","title":"Universal Quantization for Separate Encodings and Joint Decoding of Correlated Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3597","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:b4cbb67fe11e8cf5fe5e450d03013e7f7a6bbee60506a916310d5f628e3c1c2c","target":"record","created_at":"2026-05-18T02:37:43Z","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":"1a53ce6d79f61cd38e46eb0881521e70cff637c43eed441b11fc6fc7f2ed0aeb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-13T16:04:32Z","title_canon_sha256":"8aaf887d7164dc9927b0d35303b3fe9c410101bdb817a4e2f94b8d8d2de46f07"},"schema_version":"1.0","source":{"id":"1411.3597","kind":"arxiv","version":1}},"canonical_sha256":"b5dbaa6d52ba27497cc59ba32acd8d0d3b7a773b74dcd142037759db764de0dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5dbaa6d52ba27497cc59ba32acd8d0d3b7a773b74dcd142037759db764de0dc","first_computed_at":"2026-05-18T02:37:43.382454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:43.382454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bx07RUHG+XQJnGJchIAvcbngn5R7uJLB1jeNqNnR5QCucUHduNb4Hc1w0hu2hXCXebx3zulOj1ox78zOHxQ7Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:43.383042Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.3597","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4cbb67fe11e8cf5fe5e450d03013e7f7a6bbee60506a916310d5f628e3c1c2c","sha256:d67c727e57fe62d2ad0263a8c5ee96052b994afae43da4ab5a9d96226549d11d"],"state_sha256":"e13ccc4643f18df187c311d4efff0c6eb49234f87f4e2300bf0ef84c38decf2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7rVsXtgVJkYNNttjcaepz7XWWERg7lA225UpYwNs52/LQmryfn9h3rfVw8w/GdXrqqqQNNRYwfZQPy+fElr/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:38:55.903090Z","bundle_sha256":"50b1492b2ebb0432356e3768b9584cfbd3de777a2c9b34bcd9509d9864000dbd"}}