{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RWOF444AP6ANS2ZGMNPEGT3TSA","short_pith_number":"pith:RWOF444A","schema_version":"1.0","canonical_sha256":"8d9c5e73807f80d96b26635e434f739010636ef3dfaa6f46f81b50973b842a91","source":{"kind":"arxiv","id":"1607.08297","version":1},"attestation_state":"computed","paper":{"title":"The Sum Rate of Vector Gaussian Multiple Description Coding with Tree-Structured Covariance Distortion Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Chen, Qiao Wang, Yinfei Xu","submitted_at":"2016-07-28T02:36:36Z","abstract_excerpt":"A single-letter lower bound on the sum rate of multiple description coding with tree-structured distortion constraints is established by generalizing Ozarow's celebrated converse argument through the introduction of auxiliary random variables that form a Markov tree. For the quadratic vector Gaussian case, this lower bound is shown to be achievable by an extended version of the El Gamal-Cover scheme, yielding a complete sum-rate characterization."},"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":"1607.08297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-28T02:36:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a47d3f9912af0412e0955ac00944ebd1d4751899e12d9545e4966114f6930de3","abstract_canon_sha256":"3faaf8e0b20e79ea67653da2af4de2d6c37273cdc7a0c8d673723b99173e0915"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:19.458112Z","signature_b64":"dHJrEJChpDo7htv15W44YQa8eOAg7L2Aj067APg6X9VAJrzG5T0AoObAcGe6wLrKkCjgLyCsbJFwg/FrmoyoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d9c5e73807f80d96b26635e434f739010636ef3dfaa6f46f81b50973b842a91","last_reissued_at":"2026-05-18T01:10:19.457411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:19.457411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Sum Rate of Vector Gaussian Multiple Description Coding with Tree-Structured Covariance Distortion Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Chen, Qiao Wang, Yinfei Xu","submitted_at":"2016-07-28T02:36:36Z","abstract_excerpt":"A single-letter lower bound on the sum rate of multiple description coding with tree-structured distortion constraints is established by generalizing Ozarow's celebrated converse argument through the introduction of auxiliary random variables that form a Markov tree. For the quadratic vector Gaussian case, this lower bound is shown to be achievable by an extended version of the El Gamal-Cover scheme, yielding a complete sum-rate characterization."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08297","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":"1607.08297","created_at":"2026-05-18T01:10:19.457512+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.08297v1","created_at":"2026-05-18T01:10:19.457512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08297","created_at":"2026-05-18T01:10:19.457512+00:00"},{"alias_kind":"pith_short_12","alias_value":"RWOF444AP6AN","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RWOF444AP6ANS2ZG","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RWOF444A","created_at":"2026-05-18T12:30:41.710351+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/RWOF444AP6ANS2ZGMNPEGT3TSA","json":"https://pith.science/pith/RWOF444AP6ANS2ZGMNPEGT3TSA.json","graph_json":"https://pith.science/api/pith-number/RWOF444AP6ANS2ZGMNPEGT3TSA/graph.json","events_json":"https://pith.science/api/pith-number/RWOF444AP6ANS2ZGMNPEGT3TSA/events.json","paper":"https://pith.science/paper/RWOF444A"},"agent_actions":{"view_html":"https://pith.science/pith/RWOF444AP6ANS2ZGMNPEGT3TSA","download_json":"https://pith.science/pith/RWOF444AP6ANS2ZGMNPEGT3TSA.json","view_paper":"https://pith.science/paper/RWOF444A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.08297&json=true","fetch_graph":"https://pith.science/api/pith-number/RWOF444AP6ANS2ZGMNPEGT3TSA/graph.json","fetch_events":"https://pith.science/api/pith-number/RWOF444AP6ANS2ZGMNPEGT3TSA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RWOF444AP6ANS2ZGMNPEGT3TSA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RWOF444AP6ANS2ZGMNPEGT3TSA/action/storage_attestation","attest_author":"https://pith.science/pith/RWOF444AP6ANS2ZGMNPEGT3TSA/action/author_attestation","sign_citation":"https://pith.science/pith/RWOF444AP6ANS2ZGMNPEGT3TSA/action/citation_signature","submit_replication":"https://pith.science/pith/RWOF444AP6ANS2ZGMNPEGT3TSA/action/replication_record"}},"created_at":"2026-05-18T01:10:19.457512+00:00","updated_at":"2026-05-18T01:10:19.457512+00:00"}