{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XEXKC3ZEF7MDVK43P2QXRRECHC","short_pith_number":"pith:XEXKC3ZE","schema_version":"1.0","canonical_sha256":"b92ea16f242fd83aab9b7ea178c48238a4c35e4970ecfab1526def433d7600f9","source":{"kind":"arxiv","id":"1512.01749","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.01749","created_at":"2026-05-18T01:25:10.444164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.01749v1","created_at":"2026-05-18T01:25:10.444164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01749","created_at":"2026-05-18T01:25:10.444164+00:00"},{"alias_kind":"pith_short_12","alias_value":"XEXKC3ZEF7MD","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XEXKC3ZEF7MDVK43","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XEXKC3ZE","created_at":"2026-05-18T12:29:50.041715+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/XEXKC3ZEF7MDVK43P2QXRRECHC","json":"https://pith.science/pith/XEXKC3ZEF7MDVK43P2QXRRECHC.json","graph_json":"https://pith.science/api/pith-number/XEXKC3ZEF7MDVK43P2QXRRECHC/graph.json","events_json":"https://pith.science/api/pith-number/XEXKC3ZEF7MDVK43P2QXRRECHC/events.json","paper":"https://pith.science/paper/XEXKC3ZE"},"agent_actions":{"view_html":"https://pith.science/pith/XEXKC3ZEF7MDVK43P2QXRRECHC","download_json":"https://pith.science/pith/XEXKC3ZEF7MDVK43P2QXRRECHC.json","view_paper":"https://pith.science/paper/XEXKC3ZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.01749&json=true","fetch_graph":"https://pith.science/api/pith-number/XEXKC3ZEF7MDVK43P2QXRRECHC/graph.json","fetch_events":"https://pith.science/api/pith-number/XEXKC3ZEF7MDVK43P2QXRRECHC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XEXKC3ZEF7MDVK43P2QXRRECHC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XEXKC3ZEF7MDVK43P2QXRRECHC/action/storage_attestation","attest_author":"https://pith.science/pith/XEXKC3ZEF7MDVK43P2QXRRECHC/action/author_attestation","sign_citation":"https://pith.science/pith/XEXKC3ZEF7MDVK43P2QXRRECHC/action/citation_signature","submit_replication":"https://pith.science/pith/XEXKC3ZEF7MDVK43P2QXRRECHC/action/replication_record"}},"created_at":"2026-05-18T01:25:10.444164+00:00","updated_at":"2026-05-18T01:25:10.444164+00:00"}