{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QE7VZSKCU2JO5EPQFLLN5VTM3H","short_pith_number":"pith:QE7VZSKC","schema_version":"1.0","canonical_sha256":"813f5cc942a692ee91f02ad6ded66cd9eea75e9b007eb951b369db6dc5851fcc","source":{"kind":"arxiv","id":"1101.0529","version":1},"attestation_state":"computed","paper":{"title":"Channel Optimized Distributed Multiple Description Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farshad Lahouti, Mehrdad Valipour","submitted_at":"2011-01-03T14:28:37Z","abstract_excerpt":"In this paper, channel optimized distributed multiple description vector quantization (CDMD) schemes are presented for distributed source coding in symmetric and asymmetric settings. The CDMD encoder is designed using a deterministic annealing approach over noisy channels with packet loss. A minimum mean squared error asymmetric CDMD decoder is proposed for effective reconstruction of a source, utilizing the side information (SI) and its corresponding received descriptions. The proposed iterative symmetric CDMD decoder jointly reconstructs the symbols of multiple correlated sources. Two types "},"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":"1101.0529","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-03T14:28:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b70e33bf6a2c009bead199a7e44a05aa61cf7e1a466071ff0e63bb2b956d2211","abstract_canon_sha256":"15df1d5cf8e0d8d7703ddf61b6b5e7a32e02e2c028d6c32d9925d649debe7b9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:04:13.879541Z","signature_b64":"poAu775SbhMAmKg6WiAA09LgUTk4kUjtQF0C2GY2TBThARx7M0E0hNPEiElQhtiZgoJnfKm8b/3bVkWJd1OSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"813f5cc942a692ee91f02ad6ded66cd9eea75e9b007eb951b369db6dc5851fcc","last_reissued_at":"2026-05-18T02:04:13.878770Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:04:13.878770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Channel Optimized Distributed Multiple Description Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farshad Lahouti, Mehrdad Valipour","submitted_at":"2011-01-03T14:28:37Z","abstract_excerpt":"In this paper, channel optimized distributed multiple description vector quantization (CDMD) schemes are presented for distributed source coding in symmetric and asymmetric settings. The CDMD encoder is designed using a deterministic annealing approach over noisy channels with packet loss. A minimum mean squared error asymmetric CDMD decoder is proposed for effective reconstruction of a source, utilizing the side information (SI) and its corresponding received descriptions. The proposed iterative symmetric CDMD decoder jointly reconstructs the symbols of multiple correlated sources. Two types "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0529","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":"1101.0529","created_at":"2026-05-18T02:04:13.878901+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.0529v1","created_at":"2026-05-18T02:04:13.878901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0529","created_at":"2026-05-18T02:04:13.878901+00:00"},{"alias_kind":"pith_short_12","alias_value":"QE7VZSKCU2JO","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QE7VZSKCU2JO5EPQ","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QE7VZSKC","created_at":"2026-05-18T12:26:39.201973+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/QE7VZSKCU2JO5EPQFLLN5VTM3H","json":"https://pith.science/pith/QE7VZSKCU2JO5EPQFLLN5VTM3H.json","graph_json":"https://pith.science/api/pith-number/QE7VZSKCU2JO5EPQFLLN5VTM3H/graph.json","events_json":"https://pith.science/api/pith-number/QE7VZSKCU2JO5EPQFLLN5VTM3H/events.json","paper":"https://pith.science/paper/QE7VZSKC"},"agent_actions":{"view_html":"https://pith.science/pith/QE7VZSKCU2JO5EPQFLLN5VTM3H","download_json":"https://pith.science/pith/QE7VZSKCU2JO5EPQFLLN5VTM3H.json","view_paper":"https://pith.science/paper/QE7VZSKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.0529&json=true","fetch_graph":"https://pith.science/api/pith-number/QE7VZSKCU2JO5EPQFLLN5VTM3H/graph.json","fetch_events":"https://pith.science/api/pith-number/QE7VZSKCU2JO5EPQFLLN5VTM3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QE7VZSKCU2JO5EPQFLLN5VTM3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QE7VZSKCU2JO5EPQFLLN5VTM3H/action/storage_attestation","attest_author":"https://pith.science/pith/QE7VZSKCU2JO5EPQFLLN5VTM3H/action/author_attestation","sign_citation":"https://pith.science/pith/QE7VZSKCU2JO5EPQFLLN5VTM3H/action/citation_signature","submit_replication":"https://pith.science/pith/QE7VZSKCU2JO5EPQFLLN5VTM3H/action/replication_record"}},"created_at":"2026-05-18T02:04:13.878901+00:00","updated_at":"2026-05-18T02:04:13.878901+00:00"}