{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TX732C7F3DMVSMMCBHF3G5VRDE","short_pith_number":"pith:TX732C7F","schema_version":"1.0","canonical_sha256":"9dffbd0be5d8d959318209cbb376b119387fb1bf06a6ae1c0bffd9a062131866","source":{"kind":"arxiv","id":"1810.01567","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.01567","created_at":"2026-05-18T00:04:11.668687+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01567v1","created_at":"2026-05-18T00:04:11.668687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01567","created_at":"2026-05-18T00:04:11.668687+00:00"},{"alias_kind":"pith_short_12","alias_value":"TX732C7F3DMV","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TX732C7F3DMVSMMC","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TX732C7F","created_at":"2026-05-18T12:32:56.356000+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/TX732C7F3DMVSMMCBHF3G5VRDE","json":"https://pith.science/pith/TX732C7F3DMVSMMCBHF3G5VRDE.json","graph_json":"https://pith.science/api/pith-number/TX732C7F3DMVSMMCBHF3G5VRDE/graph.json","events_json":"https://pith.science/api/pith-number/TX732C7F3DMVSMMCBHF3G5VRDE/events.json","paper":"https://pith.science/paper/TX732C7F"},"agent_actions":{"view_html":"https://pith.science/pith/TX732C7F3DMVSMMCBHF3G5VRDE","download_json":"https://pith.science/pith/TX732C7F3DMVSMMCBHF3G5VRDE.json","view_paper":"https://pith.science/paper/TX732C7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01567&json=true","fetch_graph":"https://pith.science/api/pith-number/TX732C7F3DMVSMMCBHF3G5VRDE/graph.json","fetch_events":"https://pith.science/api/pith-number/TX732C7F3DMVSMMCBHF3G5VRDE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TX732C7F3DMVSMMCBHF3G5VRDE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TX732C7F3DMVSMMCBHF3G5VRDE/action/storage_attestation","attest_author":"https://pith.science/pith/TX732C7F3DMVSMMCBHF3G5VRDE/action/author_attestation","sign_citation":"https://pith.science/pith/TX732C7F3DMVSMMCBHF3G5VRDE/action/citation_signature","submit_replication":"https://pith.science/pith/TX732C7F3DMVSMMCBHF3G5VRDE/action/replication_record"}},"created_at":"2026-05-18T00:04:11.668687+00:00","updated_at":"2026-05-18T00:04:11.668687+00:00"}