{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DPEX55R7TEUC24GFQVCBXSHICK","short_pith_number":"pith:DPEX55R7","canonical_record":{"source":{"id":"1105.6150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-31T02:41:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0218409ea68d109bb362c638cf128428f35e9c7ae5f53c176c9f936658201ec3","abstract_canon_sha256":"32633edcfcdbdd4e9ba36e1f84b89c8ece640b1f6e674e245203ef5de815fa0c"},"schema_version":"1.0"},"canonical_sha256":"1bc97ef63f99282d70c585441bc8e812b112e91fb3c8bb4340671c0fb243d5fc","source":{"kind":"arxiv","id":"1105.6150","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.6150","created_at":"2026-05-18T04:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1105.6150v1","created_at":"2026-05-18T04:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.6150","created_at":"2026-05-18T04:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"DPEX55R7TEUC","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DPEX55R7TEUC24GF","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DPEX55R7","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DPEX55R7TEUC24GFQVCBXSHICK","target":"record","payload":{"canonical_record":{"source":{"id":"1105.6150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-31T02:41:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0218409ea68d109bb362c638cf128428f35e9c7ae5f53c176c9f936658201ec3","abstract_canon_sha256":"32633edcfcdbdd4e9ba36e1f84b89c8ece640b1f6e674e245203ef5de815fa0c"},"schema_version":"1.0"},"canonical_sha256":"1bc97ef63f99282d70c585441bc8e812b112e91fb3c8bb4340671c0fb243d5fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:00.068258Z","signature_b64":"hUUDWa0n6XT6lMf6CNOXbY1W8inNSNr1J1M614sVMBq8FcLdI3zULZ7fEnNh9vj606Db11y8tlZm7b5DtmuoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bc97ef63f99282d70c585441bc8e812b112e91fb3c8bb4340671c0fb243d5fc","last_reissued_at":"2026-05-18T04:21:00.067636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:00.067636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.6150","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-18T04:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dlObp5fdWX6XbsW66/acMaN6pw2x7poeHQhudGLRrONj8wwOPz5oSjFHNB3P4DUYxpCnz6oY6WIa8QoN1gpBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:55:24.911852Z"},"content_sha256":"6cb9fb38e6a6d4acab70f13bd1c15745afd0882dbc1ce0bac5711bacac58ff8b","schema_version":"1.0","event_id":"sha256:6cb9fb38e6a6d4acab70f13bd1c15745afd0882dbc1ce0bac5711bacac58ff8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DPEX55R7TEUC24GFQVCBXSHICK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Strictly Improved Achievable Region for Multiple Descriptions Using Combinatorial Message Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emrah Akyol, Kenneth Rose, Kumar Viswanatha","submitted_at":"2011-05-31T02:41:09Z","abstract_excerpt":"We recently proposed a new coding scheme for the L-channel multiple descriptions (MD) problem for general sources and distortion measures involving `Combinatorial Message Sharing' (CMS) [7] leading to a new achievable rate-distortion region. Our objective in this paper is to establish that this coding scheme strictly subsumes the most popular region for this problem due to Venkataramani, Kramer and Goyal (VKG) [3]. In particular, we show that for a binary symmetric source under Hamming distortion measure, the CMS scheme provides a strictly larger region for all L>2. The principle of the CMS co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.6150","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-18T04:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9TE0J2U71oaBQ9YkW3s+9Kud7MSypmn5Ggoub1yXg+aNqVIZcparFFoVWhgTn3jeO+51bXjihpY9rsnVYMOBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:55:24.912611Z"},"content_sha256":"78d62819d12c2757cdeca35d1116ba843fc5648df1e2cd8fd1a5fb27aa15b050","schema_version":"1.0","event_id":"sha256:78d62819d12c2757cdeca35d1116ba843fc5648df1e2cd8fd1a5fb27aa15b050"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DPEX55R7TEUC24GFQVCBXSHICK/bundle.json","state_url":"https://pith.science/pith/DPEX55R7TEUC24GFQVCBXSHICK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DPEX55R7TEUC24GFQVCBXSHICK/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-09T02:55:24Z","links":{"resolver":"https://pith.science/pith/DPEX55R7TEUC24GFQVCBXSHICK","bundle":"https://pith.science/pith/DPEX55R7TEUC24GFQVCBXSHICK/bundle.json","state":"https://pith.science/pith/DPEX55R7TEUC24GFQVCBXSHICK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DPEX55R7TEUC24GFQVCBXSHICK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DPEX55R7TEUC24GFQVCBXSHICK","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":"32633edcfcdbdd4e9ba36e1f84b89c8ece640b1f6e674e245203ef5de815fa0c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-31T02:41:09Z","title_canon_sha256":"0218409ea68d109bb362c638cf128428f35e9c7ae5f53c176c9f936658201ec3"},"schema_version":"1.0","source":{"id":"1105.6150","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.6150","created_at":"2026-05-18T04:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1105.6150v1","created_at":"2026-05-18T04:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.6150","created_at":"2026-05-18T04:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"DPEX55R7TEUC","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DPEX55R7TEUC24GF","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DPEX55R7","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:78d62819d12c2757cdeca35d1116ba843fc5648df1e2cd8fd1a5fb27aa15b050","target":"graph","created_at":"2026-05-18T04:21:00Z","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 recently proposed a new coding scheme for the L-channel multiple descriptions (MD) problem for general sources and distortion measures involving `Combinatorial Message Sharing' (CMS) [7] leading to a new achievable rate-distortion region. Our objective in this paper is to establish that this coding scheme strictly subsumes the most popular region for this problem due to Venkataramani, Kramer and Goyal (VKG) [3]. In particular, we show that for a binary symmetric source under Hamming distortion measure, the CMS scheme provides a strictly larger region for all L>2. The principle of the CMS co","authors_text":"Emrah Akyol, Kenneth Rose, Kumar Viswanatha","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-31T02:41:09Z","title":"A Strictly Improved Achievable Region for Multiple Descriptions Using Combinatorial Message Sharing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.6150","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:6cb9fb38e6a6d4acab70f13bd1c15745afd0882dbc1ce0bac5711bacac58ff8b","target":"record","created_at":"2026-05-18T04:21:00Z","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":"32633edcfcdbdd4e9ba36e1f84b89c8ece640b1f6e674e245203ef5de815fa0c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-31T02:41:09Z","title_canon_sha256":"0218409ea68d109bb362c638cf128428f35e9c7ae5f53c176c9f936658201ec3"},"schema_version":"1.0","source":{"id":"1105.6150","kind":"arxiv","version":1}},"canonical_sha256":"1bc97ef63f99282d70c585441bc8e812b112e91fb3c8bb4340671c0fb243d5fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bc97ef63f99282d70c585441bc8e812b112e91fb3c8bb4340671c0fb243d5fc","first_computed_at":"2026-05-18T04:21:00.067636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:00.067636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hUUDWa0n6XT6lMf6CNOXbY1W8inNSNr1J1M614sVMBq8FcLdI3zULZ7fEnNh9vj606Db11y8tlZm7b5DtmuoCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:00.068258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.6150","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cb9fb38e6a6d4acab70f13bd1c15745afd0882dbc1ce0bac5711bacac58ff8b","sha256:78d62819d12c2757cdeca35d1116ba843fc5648df1e2cd8fd1a5fb27aa15b050"],"state_sha256":"0b4fdfaaca54a7ae45d3f8a7e210f6df460217945caf7824a58b7692febc158c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UjecIBWcHCgsmesZDAcPRwxXAs2F48zsZMwRTUWmUZtXaPR2ePpRq41DKEC5UNghfpdFhP9hRSPWx9snkRTwCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:55:24.917204Z","bundle_sha256":"37dba20c982f4645d6cc413cb93c46f865db56091878ca23518a0d0b4b1cc74a"}}