{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:NKPKMDOFUT7UCFQ6OJMX3IZEAT","short_pith_number":"pith:NKPKMDOF","canonical_record":{"source":{"id":"0810.3631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-10-20T18:58:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5fb4cb94e1c931bf871f2fd0f16fc3207a31b89e1855db078bde4800bc8731bd","abstract_canon_sha256":"75e2d63464a31f8bc4fc98f0752caa913aedd8a1bc1785866fcb058caec5e3b3"},"schema_version":"1.0"},"canonical_sha256":"6a9ea60dc5a4ff41161e72597da32404f7edd08053679858cb4043780b616c29","source":{"kind":"arxiv","id":"0810.3631","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.3631","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0810.3631v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.3631","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"NKPKMDOFUT7U","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"NKPKMDOFUT7UCFQ6","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"NKPKMDOF","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:NKPKMDOFUT7UCFQ6OJMX3IZEAT","target":"record","payload":{"canonical_record":{"source":{"id":"0810.3631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-10-20T18:58:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5fb4cb94e1c931bf871f2fd0f16fc3207a31b89e1855db078bde4800bc8731bd","abstract_canon_sha256":"75e2d63464a31f8bc4fc98f0752caa913aedd8a1bc1785866fcb058caec5e3b3"},"schema_version":"1.0"},"canonical_sha256":"6a9ea60dc5a4ff41161e72597da32404f7edd08053679858cb4043780b616c29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.629326Z","signature_b64":"+jcnrT+5ccNxCIJMw6s6o9Pr04S3On1e7sl+KUlrXpn7oO6zbc4NnkS1g0q/lmxUYQe2hneYXvRTTBMBFcIXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a9ea60dc5a4ff41161e72597da32404f7edd08053679858cb4043780b616c29","last_reissued_at":"2026-05-18T00:59:11.628428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.628428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0810.3631","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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z0phYGwHJN07+5XMlx5FaXMtubdKyBMJb+CSLp5J1ZdnH7DYOee4n1gPIOCujyrVbPG3uZ+1z4GBbXlVmTPQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:09:06.066223Z"},"content_sha256":"f2c187f1c93bdf2dc33170583007486f589ca6da59d0c8965bd7ab2d8b1cdba3","schema_version":"1.0","event_id":"sha256:f2c187f1c93bdf2dc33170583007486f589ca6da59d0c8965bd7ab2d8b1cdba3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:NKPKMDOFUT7UCFQ6OJMX3IZEAT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating the Gaussian Multiple Description Rate Region Under Symmetric Distortion Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chao Tian, Soheil Mohajer, Suhas N. Diggavi","submitted_at":"2008-10-20T18:58:16Z","abstract_excerpt":"We consider multiple description coding for the Gaussian source with K descriptions under the symmetric mean squared error distortion constraints, and provide an approximate characterization of the rate region. We show that the rate region can be sandwiched between two polytopes, between which the gap can be upper bounded by constants dependent on the number of descriptions, but independent of the exact distortion constraints. Underlying this result is an exact characterization of the lossless multi-level diversity source coding problem: a lossless counterpart of the MD problem. This connectio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.3631","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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jdQA0+apRRo7SUgvol3C4zrhMp0H/EHrLfJs7i41MgVQKExC7JHLe/mKYa6fxseljgir/FMmtclkxi5Pv5IfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:09:06.066594Z"},"content_sha256":"2406da977668e9e311e7509308c8e9bd18faa9896aa7dab1785bac98ba3aa83e","schema_version":"1.0","event_id":"sha256:2406da977668e9e311e7509308c8e9bd18faa9896aa7dab1785bac98ba3aa83e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NKPKMDOFUT7UCFQ6OJMX3IZEAT/bundle.json","state_url":"https://pith.science/pith/NKPKMDOFUT7UCFQ6OJMX3IZEAT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NKPKMDOFUT7UCFQ6OJMX3IZEAT/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-30T06:09:06Z","links":{"resolver":"https://pith.science/pith/NKPKMDOFUT7UCFQ6OJMX3IZEAT","bundle":"https://pith.science/pith/NKPKMDOFUT7UCFQ6OJMX3IZEAT/bundle.json","state":"https://pith.science/pith/NKPKMDOFUT7UCFQ6OJMX3IZEAT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NKPKMDOFUT7UCFQ6OJMX3IZEAT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:NKPKMDOFUT7UCFQ6OJMX3IZEAT","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":"75e2d63464a31f8bc4fc98f0752caa913aedd8a1bc1785866fcb058caec5e3b3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-10-20T18:58:16Z","title_canon_sha256":"5fb4cb94e1c931bf871f2fd0f16fc3207a31b89e1855db078bde4800bc8731bd"},"schema_version":"1.0","source":{"id":"0810.3631","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0810.3631","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0810.3631v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.3631","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"NKPKMDOFUT7U","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"NKPKMDOFUT7UCFQ6","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"NKPKMDOF","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:2406da977668e9e311e7509308c8e9bd18faa9896aa7dab1785bac98ba3aa83e","target":"graph","created_at":"2026-05-18T00:59: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":"We consider multiple description coding for the Gaussian source with K descriptions under the symmetric mean squared error distortion constraints, and provide an approximate characterization of the rate region. We show that the rate region can be sandwiched between two polytopes, between which the gap can be upper bounded by constants dependent on the number of descriptions, but independent of the exact distortion constraints. Underlying this result is an exact characterization of the lossless multi-level diversity source coding problem: a lossless counterpart of the MD problem. This connectio","authors_text":"Chao Tian, Soheil Mohajer, Suhas N. Diggavi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-10-20T18:58:16Z","title":"Approximating the Gaussian Multiple Description Rate Region Under Symmetric Distortion Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.3631","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:f2c187f1c93bdf2dc33170583007486f589ca6da59d0c8965bd7ab2d8b1cdba3","target":"record","created_at":"2026-05-18T00:59: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":"75e2d63464a31f8bc4fc98f0752caa913aedd8a1bc1785866fcb058caec5e3b3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-10-20T18:58:16Z","title_canon_sha256":"5fb4cb94e1c931bf871f2fd0f16fc3207a31b89e1855db078bde4800bc8731bd"},"schema_version":"1.0","source":{"id":"0810.3631","kind":"arxiv","version":1}},"canonical_sha256":"6a9ea60dc5a4ff41161e72597da32404f7edd08053679858cb4043780b616c29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a9ea60dc5a4ff41161e72597da32404f7edd08053679858cb4043780b616c29","first_computed_at":"2026-05-18T00:59:11.628428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:11.628428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+jcnrT+5ccNxCIJMw6s6o9Pr04S3On1e7sl+KUlrXpn7oO6zbc4NnkS1g0q/lmxUYQe2hneYXvRTTBMBFcIXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:11.629326Z","signed_message":"canonical_sha256_bytes"},"source_id":"0810.3631","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2c187f1c93bdf2dc33170583007486f589ca6da59d0c8965bd7ab2d8b1cdba3","sha256:2406da977668e9e311e7509308c8e9bd18faa9896aa7dab1785bac98ba3aa83e"],"state_sha256":"d5d836bbb7ce42a6942a62b3a86ff55267019bc39711924722bb24ec19859648"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4T9zDsSxBjC03+oSztWbkYaWRM8vHPevUPXrVV0aOBRq7c0vcBbTMPBSQwwVWBiYY4Gg8ypVGqO7Uqyjw9jdBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:09:06.068527Z","bundle_sha256":"ecc23fe1c886410584498b95d4e86df2e5b63a2433bf3540bb6d00607bca980a"}}