{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QE7VZSKCU2JO5EPQFLLN5VTM3H","short_pith_number":"pith:QE7VZSKC","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"},"canonical_sha256":"813f5cc942a692ee91f02ad6ded66cd9eea75e9b007eb951b369db6dc5851fcc","source":{"kind":"arxiv","id":"1101.0529","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.0529","created_at":"2026-05-18T02:04:13Z"},{"alias_kind":"arxiv_version","alias_value":"1101.0529v1","created_at":"2026-05-18T02:04:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0529","created_at":"2026-05-18T02:04:13Z"},{"alias_kind":"pith_short_12","alias_value":"QE7VZSKCU2JO","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QE7VZSKCU2JO5EPQ","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QE7VZSKC","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QE7VZSKCU2JO5EPQFLLN5VTM3H","target":"record","payload":{"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"},"canonical_sha256":"813f5cc942a692ee91f02ad6ded66cd9eea75e9b007eb951b369db6dc5851fcc","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"},"source_kind":"arxiv","source_id":"1101.0529","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:04:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lSbSR2k9DmJyHvjrdOPHienYsPGA2c7pXDEBilpqgutikIUnzB0/ebpEZzbmiziEDyzvfP3p9Bq+3czeq+g5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:07:43.788261Z"},"content_sha256":"e7a79efc55c6c43e0d53e6067b76f285eab6dad9006d8a46ebfd31bc1ad95561","schema_version":"1.0","event_id":"sha256:e7a79efc55c6c43e0d53e6067b76f285eab6dad9006d8a46ebfd31bc1ad95561"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QE7VZSKCU2JO5EPQFLLN5VTM3H","target":"graph","payload":{"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"},"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:04:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8TbNHx8084KmAcWUFC6DufSTPeRfqVCCiFmiZ9cJgNzeu4Nrne2yHH4LPekEAD2nL4b9qwulxG5VVwupB2ZWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:07:43.788941Z"},"content_sha256":"70a69b47e672853a5899433bd7de5720bfa851e2c5cda2d2f62d813b9b2a3b98","schema_version":"1.0","event_id":"sha256:70a69b47e672853a5899433bd7de5720bfa851e2c5cda2d2f62d813b9b2a3b98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QE7VZSKCU2JO5EPQFLLN5VTM3H/bundle.json","state_url":"https://pith.science/pith/QE7VZSKCU2JO5EPQFLLN5VTM3H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QE7VZSKCU2JO5EPQFLLN5VTM3H/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-05T22:07:43Z","links":{"resolver":"https://pith.science/pith/QE7VZSKCU2JO5EPQFLLN5VTM3H","bundle":"https://pith.science/pith/QE7VZSKCU2JO5EPQFLLN5VTM3H/bundle.json","state":"https://pith.science/pith/QE7VZSKCU2JO5EPQFLLN5VTM3H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QE7VZSKCU2JO5EPQFLLN5VTM3H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QE7VZSKCU2JO5EPQFLLN5VTM3H","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":"15df1d5cf8e0d8d7703ddf61b6b5e7a32e02e2c028d6c32d9925d649debe7b9d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-03T14:28:37Z","title_canon_sha256":"b70e33bf6a2c009bead199a7e44a05aa61cf7e1a466071ff0e63bb2b956d2211"},"schema_version":"1.0","source":{"id":"1101.0529","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.0529","created_at":"2026-05-18T02:04:13Z"},{"alias_kind":"arxiv_version","alias_value":"1101.0529v1","created_at":"2026-05-18T02:04:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0529","created_at":"2026-05-18T02:04:13Z"},{"alias_kind":"pith_short_12","alias_value":"QE7VZSKCU2JO","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QE7VZSKCU2JO5EPQ","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QE7VZSKC","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:70a69b47e672853a5899433bd7de5720bfa851e2c5cda2d2f62d813b9b2a3b98","target":"graph","created_at":"2026-05-18T02:04:13Z","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, 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 ","authors_text":"Farshad Lahouti, Mehrdad Valipour","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-03T14:28:37Z","title":"Channel Optimized Distributed Multiple Description Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0529","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:e7a79efc55c6c43e0d53e6067b76f285eab6dad9006d8a46ebfd31bc1ad95561","target":"record","created_at":"2026-05-18T02:04:13Z","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":"15df1d5cf8e0d8d7703ddf61b6b5e7a32e02e2c028d6c32d9925d649debe7b9d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-03T14:28:37Z","title_canon_sha256":"b70e33bf6a2c009bead199a7e44a05aa61cf7e1a466071ff0e63bb2b956d2211"},"schema_version":"1.0","source":{"id":"1101.0529","kind":"arxiv","version":1}},"canonical_sha256":"813f5cc942a692ee91f02ad6ded66cd9eea75e9b007eb951b369db6dc5851fcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"813f5cc942a692ee91f02ad6ded66cd9eea75e9b007eb951b369db6dc5851fcc","first_computed_at":"2026-05-18T02:04:13.878770Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:04:13.878770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"poAu775SbhMAmKg6WiAA09LgUTk4kUjtQF0C2GY2TBThARx7M0E0hNPEiElQhtiZgoJnfKm8b/3bVkWJd1OSCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:04:13.879541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.0529","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7a79efc55c6c43e0d53e6067b76f285eab6dad9006d8a46ebfd31bc1ad95561","sha256:70a69b47e672853a5899433bd7de5720bfa851e2c5cda2d2f62d813b9b2a3b98"],"state_sha256":"057e19591f980cbc2e3efe9de7e1b17c9737dfdf56688778937fdafce58d2322"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qu9zK/pCj7WZK0vZg3RDhsO6Q241msXRiN8fp74ex6YMZ7Wpgoru4O6oXNOzE/sjnEmwCEpuhF2TIlpCA61YBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T22:07:43.792786Z","bundle_sha256":"8c3f5915304af69a471034b7038787092e9fcbd57617afafe711242b36bf12c5"}}