{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XEXKC3ZEF7MDVK43P2QXRRECHC","short_pith_number":"pith:XEXKC3ZE","canonical_record":{"source":{"id":"1512.01749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-06T06:20:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2c3ac5fc362acb47a4d6403f113005b481cc7006565c44de1bc7fe75a68a9c20","abstract_canon_sha256":"6bb9eaee3fe5f79dbd6808159dab67edce2c35b838a7e39abded662eff286eb3"},"schema_version":"1.0"},"canonical_sha256":"b92ea16f242fd83aab9b7ea178c48238a4c35e4970ecfab1526def433d7600f9","source":{"kind":"arxiv","id":"1512.01749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01749","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01749v1","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01749","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"XEXKC3ZEF7MD","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XEXKC3ZEF7MDVK43","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XEXKC3ZE","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XEXKC3ZEF7MDVK43P2QXRRECHC","target":"record","payload":{"canonical_record":{"source":{"id":"1512.01749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-06T06:20:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2c3ac5fc362acb47a4d6403f113005b481cc7006565c44de1bc7fe75a68a9c20","abstract_canon_sha256":"6bb9eaee3fe5f79dbd6808159dab67edce2c35b838a7e39abded662eff286eb3"},"schema_version":"1.0"},"canonical_sha256":"b92ea16f242fd83aab9b7ea178c48238a4c35e4970ecfab1526def433d7600f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:10.444806Z","signature_b64":"m5gXDRJhqFp3AwN6648dtGqTTxo8DbXhPPRuwXkprLpY62GF9ygSFk2rZbx0C7kk6T9yfJWKmnWU1dUlHx2sBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b92ea16f242fd83aab9b7ea178c48238a4c35e4970ecfab1526def433d7600f9","last_reissued_at":"2026-05-18T01:25:10.444035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:10.444035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.01749","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:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1dhAhBxYj4rWbiv98fmIRewPmtttQvyaeq2EAMqm/uaF5+gfYvonchg5jhFbKRyuOnGAHSQi4wTMUodBKQtQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:01:07.167121Z"},"content_sha256":"cd0dba5072b3dc741f259e13ac7d5c120abb64fa203dad914311ae9b6dbdb67b","schema_version":"1.0","event_id":"sha256:cd0dba5072b3dc741f259e13ac7d5c120abb64fa203dad914311ae9b6dbdb67b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XEXKC3ZEF7MDVK43P2QXRRECHC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial Message Sharing and a New Achievable Region for Multiple Descriptions","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":"2015-12-06T06:20:16Z","abstract_excerpt":"This paper presents a new achievable rate-distortion region for the general L channel multiple descriptions problem. A well known general region for this problem is due to Venkataramani, Kramer and Goyal (VKG) [1]. Their encoding scheme is an extension of the El-Gamal-Cover (EC) and Zhang- Berger (ZB) coding schemes to the L channel case and includes a combinatorial number of refinement codebooks, one for each subset of the descriptions. As in ZB, the scheme also allows for a single common codeword to be shared by all descriptions. This paper proposes a novel encoding technique involving Combi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01749","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:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DcGyfT+P9o9bc3LEATVHI0VYe3NjdK8fMAeL1AS2bLnbPc7zOOt57xi6aMrcJFyi+nXP8SUBs+t/eKqxwDrXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:01:07.167756Z"},"content_sha256":"bcd297119ef8fd01f730a5521fe5ae8ea71084a3bd8a70e1b78cb5a94e7fbf3c","schema_version":"1.0","event_id":"sha256:bcd297119ef8fd01f730a5521fe5ae8ea71084a3bd8a70e1b78cb5a94e7fbf3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XEXKC3ZEF7MDVK43P2QXRRECHC/bundle.json","state_url":"https://pith.science/pith/XEXKC3ZEF7MDVK43P2QXRRECHC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XEXKC3ZEF7MDVK43P2QXRRECHC/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-09T03:01:07Z","links":{"resolver":"https://pith.science/pith/XEXKC3ZEF7MDVK43P2QXRRECHC","bundle":"https://pith.science/pith/XEXKC3ZEF7MDVK43P2QXRRECHC/bundle.json","state":"https://pith.science/pith/XEXKC3ZEF7MDVK43P2QXRRECHC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XEXKC3ZEF7MDVK43P2QXRRECHC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XEXKC3ZEF7MDVK43P2QXRRECHC","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":"6bb9eaee3fe5f79dbd6808159dab67edce2c35b838a7e39abded662eff286eb3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-06T06:20:16Z","title_canon_sha256":"2c3ac5fc362acb47a4d6403f113005b481cc7006565c44de1bc7fe75a68a9c20"},"schema_version":"1.0","source":{"id":"1512.01749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01749","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01749v1","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01749","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"XEXKC3ZEF7MD","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XEXKC3ZEF7MDVK43","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XEXKC3ZE","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:bcd297119ef8fd01f730a5521fe5ae8ea71084a3bd8a70e1b78cb5a94e7fbf3c","target":"graph","created_at":"2026-05-18T01:25:10Z","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":"This paper presents a new achievable rate-distortion region for the general L channel multiple descriptions problem. A well known general region for this problem is due to Venkataramani, Kramer and Goyal (VKG) [1]. Their encoding scheme is an extension of the El-Gamal-Cover (EC) and Zhang- Berger (ZB) coding schemes to the L channel case and includes a combinatorial number of refinement codebooks, one for each subset of the descriptions. As in ZB, the scheme also allows for a single common codeword to be shared by all descriptions. This paper proposes a novel encoding technique involving Combi","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":"2015-12-06T06:20:16Z","title":"Combinatorial Message Sharing and a New Achievable Region for Multiple Descriptions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01749","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:cd0dba5072b3dc741f259e13ac7d5c120abb64fa203dad914311ae9b6dbdb67b","target":"record","created_at":"2026-05-18T01:25:10Z","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":"6bb9eaee3fe5f79dbd6808159dab67edce2c35b838a7e39abded662eff286eb3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-06T06:20:16Z","title_canon_sha256":"2c3ac5fc362acb47a4d6403f113005b481cc7006565c44de1bc7fe75a68a9c20"},"schema_version":"1.0","source":{"id":"1512.01749","kind":"arxiv","version":1}},"canonical_sha256":"b92ea16f242fd83aab9b7ea178c48238a4c35e4970ecfab1526def433d7600f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b92ea16f242fd83aab9b7ea178c48238a4c35e4970ecfab1526def433d7600f9","first_computed_at":"2026-05-18T01:25:10.444035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:10.444035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m5gXDRJhqFp3AwN6648dtGqTTxo8DbXhPPRuwXkprLpY62GF9ygSFk2rZbx0C7kk6T9yfJWKmnWU1dUlHx2sBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:10.444806Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.01749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd0dba5072b3dc741f259e13ac7d5c120abb64fa203dad914311ae9b6dbdb67b","sha256:bcd297119ef8fd01f730a5521fe5ae8ea71084a3bd8a70e1b78cb5a94e7fbf3c"],"state_sha256":"b4c4cc031b9e13712b9a61f4532efb4378f05d5366b481d9d8259eaef3d8aca8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9FNWKo8AurVz+n11R7U70KO3KdOdT0660NiZRGcEo48PQ81wCLv/BVTRqMOSIS9Qv3y51UhkdbASa2f3DYPrCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:01:07.171509Z","bundle_sha256":"f7b2581182281b31b9f471cdb0f45533b61dc7f4f5a9393c1091a20e5ef18755"}}