{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TX732C7F3DMVSMMCBHF3G5VRDE","short_pith_number":"pith:TX732C7F","canonical_record":{"source":{"id":"1810.01567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-03T02:19:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"784a6a968fa6e41dcb28f48a4a7487e248a7554f5cd341c816f0b084ba2fb4cc","abstract_canon_sha256":"9e8fa22aee05444517c55f3cdf4a841c26011d450923280a5a27bcc51ec48505"},"schema_version":"1.0"},"canonical_sha256":"9dffbd0be5d8d959318209cbb376b119387fb1bf06a6ae1c0bffd9a062131866","source":{"kind":"arxiv","id":"1810.01567","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01567","created_at":"2026-05-18T00:04:11Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01567v1","created_at":"2026-05-18T00:04:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01567","created_at":"2026-05-18T00:04:11Z"},{"alias_kind":"pith_short_12","alias_value":"TX732C7F3DMV","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TX732C7F3DMVSMMC","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TX732C7F","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TX732C7F3DMVSMMCBHF3G5VRDE","target":"record","payload":{"canonical_record":{"source":{"id":"1810.01567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-03T02:19:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"784a6a968fa6e41dcb28f48a4a7487e248a7554f5cd341c816f0b084ba2fb4cc","abstract_canon_sha256":"9e8fa22aee05444517c55f3cdf4a841c26011d450923280a5a27bcc51ec48505"},"schema_version":"1.0"},"canonical_sha256":"9dffbd0be5d8d959318209cbb376b119387fb1bf06a6ae1c0bffd9a062131866","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:11.669222Z","signature_b64":"HEu4TokqmR72+YgmUif9GUVaqibLTuUsLfbrWq12lIfjwVaI6Oja0w2dyGM/5dk4D9TfDPUQ28+E7+28wVeQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dffbd0be5d8d959318209cbb376b119387fb1bf06a6ae1c0bffd9a062131866","last_reissued_at":"2026-05-18T00:04:11.668602Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:11.668602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.01567","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-18T00:04:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I/dqHABBrL/Gy/hJj4IxvQdL0pc0y7S7TdrNlwUQ2fHxSkeObKYuX2sBMnVO8s6F51y/f5fPzqcIEROF7KvQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:18:19.431231Z"},"content_sha256":"76cfb0255ded5714b3d2d52c30258fb17e19ecf2971352158ac340527d2dfdcf","schema_version":"1.0","event_id":"sha256:76cfb0255ded5714b3d2d52c30258fb17e19ecf2971352158ac340527d2dfdcf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TX732C7F3DMVSMMCBHF3G5VRDE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lattice-based Robust Distributed Source Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dania Elzouki, Jun Chen, Sorina Dumitrescu","submitted_at":"2018-10-03T02:19:01Z","abstract_excerpt":"In this paper, we propose a lattice-based robust distributed source coding system for two correlated sources and provide a detailed performance analysis under the high resolution assumption. It is shown, among other things, that, in the asymptotic regime where 1) the side distortion approaches 0 and 2) the ratio between the central and side distortions approaches 0, our scheme is capable of achieving the information-theoretic limit of quadratic multiple description coding when the two sources are identical, whereas a variant of the random coding scheme by Chen and Berger with Gaussian codes ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01567","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-18T00:04:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mih6nCMClt+U+ZxUvorRllojtzf65y7p0D3RT/89V2oOD7vcFkUixhUvz+QkE2upApxVGwhjaCbE4uCR/CiPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:18:19.431966Z"},"content_sha256":"0237418c591dbe32f9e21f6e39e8313356c3b158233abf1adc7f0a16ae6cd5d2","schema_version":"1.0","event_id":"sha256:0237418c591dbe32f9e21f6e39e8313356c3b158233abf1adc7f0a16ae6cd5d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TX732C7F3DMVSMMCBHF3G5VRDE/bundle.json","state_url":"https://pith.science/pith/TX732C7F3DMVSMMCBHF3G5VRDE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TX732C7F3DMVSMMCBHF3G5VRDE/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-08T01:18:19Z","links":{"resolver":"https://pith.science/pith/TX732C7F3DMVSMMCBHF3G5VRDE","bundle":"https://pith.science/pith/TX732C7F3DMVSMMCBHF3G5VRDE/bundle.json","state":"https://pith.science/pith/TX732C7F3DMVSMMCBHF3G5VRDE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TX732C7F3DMVSMMCBHF3G5VRDE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TX732C7F3DMVSMMCBHF3G5VRDE","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":"9e8fa22aee05444517c55f3cdf4a841c26011d450923280a5a27bcc51ec48505","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-03T02:19:01Z","title_canon_sha256":"784a6a968fa6e41dcb28f48a4a7487e248a7554f5cd341c816f0b084ba2fb4cc"},"schema_version":"1.0","source":{"id":"1810.01567","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01567","created_at":"2026-05-18T00:04:11Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01567v1","created_at":"2026-05-18T00:04:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01567","created_at":"2026-05-18T00:04:11Z"},{"alias_kind":"pith_short_12","alias_value":"TX732C7F3DMV","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TX732C7F3DMVSMMC","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TX732C7F","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:0237418c591dbe32f9e21f6e39e8313356c3b158233abf1adc7f0a16ae6cd5d2","target":"graph","created_at":"2026-05-18T00:04:11Z","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":"In this paper, we propose a lattice-based robust distributed source coding system for two correlated sources and provide a detailed performance analysis under the high resolution assumption. It is shown, among other things, that, in the asymptotic regime where 1) the side distortion approaches 0 and 2) the ratio between the central and side distortions approaches 0, our scheme is capable of achieving the information-theoretic limit of quadratic multiple description coding when the two sources are identical, whereas a variant of the random coding scheme by Chen and Berger with Gaussian codes ha","authors_text":"Dania Elzouki, Jun Chen, Sorina Dumitrescu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-03T02:19:01Z","title":"Lattice-based Robust Distributed Source Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01567","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:76cfb0255ded5714b3d2d52c30258fb17e19ecf2971352158ac340527d2dfdcf","target":"record","created_at":"2026-05-18T00:04:11Z","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":"9e8fa22aee05444517c55f3cdf4a841c26011d450923280a5a27bcc51ec48505","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-03T02:19:01Z","title_canon_sha256":"784a6a968fa6e41dcb28f48a4a7487e248a7554f5cd341c816f0b084ba2fb4cc"},"schema_version":"1.0","source":{"id":"1810.01567","kind":"arxiv","version":1}},"canonical_sha256":"9dffbd0be5d8d959318209cbb376b119387fb1bf06a6ae1c0bffd9a062131866","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9dffbd0be5d8d959318209cbb376b119387fb1bf06a6ae1c0bffd9a062131866","first_computed_at":"2026-05-18T00:04:11.668602Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:11.668602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HEu4TokqmR72+YgmUif9GUVaqibLTuUsLfbrWq12lIfjwVaI6Oja0w2dyGM/5dk4D9TfDPUQ28+E7+28wVeQAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:11.669222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.01567","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76cfb0255ded5714b3d2d52c30258fb17e19ecf2971352158ac340527d2dfdcf","sha256:0237418c591dbe32f9e21f6e39e8313356c3b158233abf1adc7f0a16ae6cd5d2"],"state_sha256":"aa7152bde1e5bff849ef946646eb92f493060324fcfe7f52d78bfe2db80047f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LjrRVoBJY5kG/XbSYhKZn2cYlWoqDR9mTViuosOWZ62GyMUCgj4HUy5zmn6/Sg1ShzOOs2FCTP8+zehw4mfVCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:18:19.436282Z","bundle_sha256":"c3caa3297866a9572eeec7de595ea6fc37600626a6b5af545abcc38a4fa89698"}}