{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RWOF444AP6ANS2ZGMNPEGT3TSA","short_pith_number":"pith:RWOF444A","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"},"canonical_sha256":"8d9c5e73807f80d96b26635e434f739010636ef3dfaa6f46f81b50973b842a91","source":{"kind":"arxiv","id":"1607.08297","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08297","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08297v1","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08297","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"pith_short_12","alias_value":"RWOF444AP6AN","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RWOF444AP6ANS2ZG","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RWOF444A","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RWOF444AP6ANS2ZGMNPEGT3TSA","target":"record","payload":{"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"},"canonical_sha256":"8d9c5e73807f80d96b26635e434f739010636ef3dfaa6f46f81b50973b842a91","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"},"source_kind":"arxiv","source_id":"1607.08297","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-18T01:10:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kI9u3J2WydSo7ZZhbD/2nyD0QVLqLTclBob/Rl3MQc3l6u/sazTO/XujWXvvlEgrVV/RCTv2++VfLhVwqY9IBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:32:04.100097Z"},"content_sha256":"02a820378ce2ba2a47e84794a6b9998b5e1b4d0a97ddb76275bdfc5c1ec2ab70","schema_version":"1.0","event_id":"sha256:02a820378ce2ba2a47e84794a6b9998b5e1b4d0a97ddb76275bdfc5c1ec2ab70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RWOF444AP6ANS2ZGMNPEGT3TSA","target":"graph","payload":{"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"},"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-18T01:10:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MOp7H6rOeS9wq3RlhEmWLKf8lOFoMIR9fkQYr3XQh2udxPYXOcjGd0OARL1MQ8bq2E9LdRHxsTQVQnnhJLpWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:32:04.100522Z"},"content_sha256":"45c9cbb8fba9b912abb6b18c5cd1226a3754e041bff3247c3f043772d259c485","schema_version":"1.0","event_id":"sha256:45c9cbb8fba9b912abb6b18c5cd1226a3754e041bff3247c3f043772d259c485"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RWOF444AP6ANS2ZGMNPEGT3TSA/bundle.json","state_url":"https://pith.science/pith/RWOF444AP6ANS2ZGMNPEGT3TSA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RWOF444AP6ANS2ZGMNPEGT3TSA/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-26T22:32:04Z","links":{"resolver":"https://pith.science/pith/RWOF444AP6ANS2ZGMNPEGT3TSA","bundle":"https://pith.science/pith/RWOF444AP6ANS2ZGMNPEGT3TSA/bundle.json","state":"https://pith.science/pith/RWOF444AP6ANS2ZGMNPEGT3TSA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RWOF444AP6ANS2ZGMNPEGT3TSA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RWOF444AP6ANS2ZGMNPEGT3TSA","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":"3faaf8e0b20e79ea67653da2af4de2d6c37273cdc7a0c8d673723b99173e0915","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-28T02:36:36Z","title_canon_sha256":"a47d3f9912af0412e0955ac00944ebd1d4751899e12d9545e4966114f6930de3"},"schema_version":"1.0","source":{"id":"1607.08297","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08297","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08297v1","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08297","created_at":"2026-05-18T01:10:19Z"},{"alias_kind":"pith_short_12","alias_value":"RWOF444AP6AN","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RWOF444AP6ANS2ZG","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RWOF444A","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:45c9cbb8fba9b912abb6b18c5cd1226a3754e041bff3247c3f043772d259c485","target":"graph","created_at":"2026-05-18T01:10:19Z","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":"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.","authors_text":"Jun Chen, Qiao Wang, Yinfei Xu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-28T02:36:36Z","title":"The Sum Rate of Vector Gaussian Multiple Description Coding with Tree-Structured Covariance Distortion Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08297","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:02a820378ce2ba2a47e84794a6b9998b5e1b4d0a97ddb76275bdfc5c1ec2ab70","target":"record","created_at":"2026-05-18T01:10:19Z","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":"3faaf8e0b20e79ea67653da2af4de2d6c37273cdc7a0c8d673723b99173e0915","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-28T02:36:36Z","title_canon_sha256":"a47d3f9912af0412e0955ac00944ebd1d4751899e12d9545e4966114f6930de3"},"schema_version":"1.0","source":{"id":"1607.08297","kind":"arxiv","version":1}},"canonical_sha256":"8d9c5e73807f80d96b26635e434f739010636ef3dfaa6f46f81b50973b842a91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d9c5e73807f80d96b26635e434f739010636ef3dfaa6f46f81b50973b842a91","first_computed_at":"2026-05-18T01:10:19.457411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:19.457411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dHJrEJChpDo7htv15W44YQa8eOAg7L2Aj067APg6X9VAJrzG5T0AoObAcGe6wLrKkCjgLyCsbJFwg/FrmoyoCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:19.458112Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.08297","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02a820378ce2ba2a47e84794a6b9998b5e1b4d0a97ddb76275bdfc5c1ec2ab70","sha256:45c9cbb8fba9b912abb6b18c5cd1226a3754e041bff3247c3f043772d259c485"],"state_sha256":"a52eed9162b3f06e67a8d952398275dabba0670d819bf9c9a6b3423dad20a92c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OUfSECCYS3Pidj/JV+Xu62HSJzGOeqKZ8LQ7rW4o3Ug7+LpObRAqekBiwqx99nb/HT57Fh2IbxWTAieaXzlGCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:32:04.103698Z","bundle_sha256":"11e3803ea814681bdd29e1ce6059a6b966da8fb7a2d6c881f6fbb3a249d21ee2"}}