{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5PGZAU4ZCWQUXQJZCGCITPOCX3","short_pith_number":"pith:5PGZAU4Z","canonical_record":{"source":{"id":"1602.01911","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-05T02:32:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"02efac35c5e614ca08d66758e4c29e1231c099bded8bb55c5a3b932c58c65c7a","abstract_canon_sha256":"bb05c8e52d0a2383e1ab330ba308095cf9046769ac9a371d5af07420be9c2f39"},"schema_version":"1.0"},"canonical_sha256":"ebcd90539915a14bc139118489bdc2bef2560a8a77035f3fdd2b9cb35ebf1ddb","source":{"kind":"arxiv","id":"1602.01911","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01911","created_at":"2026-05-18T01:21:15Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01911v1","created_at":"2026-05-18T01:21:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01911","created_at":"2026-05-18T01:21:15Z"},{"alias_kind":"pith_short_12","alias_value":"5PGZAU4ZCWQU","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5PGZAU4ZCWQUXQJZ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5PGZAU4Z","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5PGZAU4ZCWQUXQJZCGCITPOCX3","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01911","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-05T02:32:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"02efac35c5e614ca08d66758e4c29e1231c099bded8bb55c5a3b932c58c65c7a","abstract_canon_sha256":"bb05c8e52d0a2383e1ab330ba308095cf9046769ac9a371d5af07420be9c2f39"},"schema_version":"1.0"},"canonical_sha256":"ebcd90539915a14bc139118489bdc2bef2560a8a77035f3fdd2b9cb35ebf1ddb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:15.066635Z","signature_b64":"jcFIBSzF4n0+I226NTr7Ha1L24WdyjKmud5fgiZqslMErfbUrC7qwO2HrNJv03vSWU9CVWwKE+YKjprYvltnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebcd90539915a14bc139118489bdc2bef2560a8a77035f3fdd2b9cb35ebf1ddb","last_reissued_at":"2026-05-18T01:21:15.065921Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:15.065921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01911","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:21:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kqsWMNoHyXj5d9n5wvZE+gjb/pLIR1V7Xq49WBhWh8q6ScBzy/cVmnbCztRBNrmp44uS2aPwSxIicTmTqsIwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:52:29.433911Z"},"content_sha256":"4f88855650662c24d09bda253fde559a559ebe839195f21c1ec124faa8d532d0","schema_version":"1.0","event_id":"sha256:4f88855650662c24d09bda253fde559a559ebe839195f21c1ec124faa8d532d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5PGZAU4ZCWQUXQJZCGCITPOCX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Achievable Rate-Distortion Region for Multiple Descriptions Source Coding Based on Coset Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farhad Shirani, S. Sandeep Pradhan","submitted_at":"2016-02-05T02:32:38Z","abstract_excerpt":"We consider the problem of multiple descriptions (MD) source coding and propose new coding strategies involving both unstructured and structured coding layers. Previously, the most general achievable rate-distortion (RD) region for the $l$-descriptions problem was the Combinatorial Message Sharing with Binning (CMSB) region. The CMSB scheme utilizes unstructured quantizers and unstructured binning. In the first part of the paper, we show that this strategy can be improved upon using more general unstructured quantizers and a more general unstructured binning method. In the second part, structu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01911","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:21:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fur6nWKlDb9hZeGvW0d0hLLGt4CdPgje5Qxhhv03k2n+48pJr418fUNgHfLXZGOuLR8DWKczoYONSnlEOCJ+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:52:29.434508Z"},"content_sha256":"4f9c78b0131e63016374f20d86cb7c62411affbe6548cf58c6fa918479add912","schema_version":"1.0","event_id":"sha256:4f9c78b0131e63016374f20d86cb7c62411affbe6548cf58c6fa918479add912"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5PGZAU4ZCWQUXQJZCGCITPOCX3/bundle.json","state_url":"https://pith.science/pith/5PGZAU4ZCWQUXQJZCGCITPOCX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5PGZAU4ZCWQUXQJZCGCITPOCX3/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-07T15:52:29Z","links":{"resolver":"https://pith.science/pith/5PGZAU4ZCWQUXQJZCGCITPOCX3","bundle":"https://pith.science/pith/5PGZAU4ZCWQUXQJZCGCITPOCX3/bundle.json","state":"https://pith.science/pith/5PGZAU4ZCWQUXQJZCGCITPOCX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5PGZAU4ZCWQUXQJZCGCITPOCX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5PGZAU4ZCWQUXQJZCGCITPOCX3","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":"bb05c8e52d0a2383e1ab330ba308095cf9046769ac9a371d5af07420be9c2f39","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-05T02:32:38Z","title_canon_sha256":"02efac35c5e614ca08d66758e4c29e1231c099bded8bb55c5a3b932c58c65c7a"},"schema_version":"1.0","source":{"id":"1602.01911","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01911","created_at":"2026-05-18T01:21:15Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01911v1","created_at":"2026-05-18T01:21:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01911","created_at":"2026-05-18T01:21:15Z"},{"alias_kind":"pith_short_12","alias_value":"5PGZAU4ZCWQU","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5PGZAU4ZCWQUXQJZ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5PGZAU4Z","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:4f9c78b0131e63016374f20d86cb7c62411affbe6548cf58c6fa918479add912","target":"graph","created_at":"2026-05-18T01:21:15Z","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 consider the problem of multiple descriptions (MD) source coding and propose new coding strategies involving both unstructured and structured coding layers. Previously, the most general achievable rate-distortion (RD) region for the $l$-descriptions problem was the Combinatorial Message Sharing with Binning (CMSB) region. The CMSB scheme utilizes unstructured quantizers and unstructured binning. In the first part of the paper, we show that this strategy can be improved upon using more general unstructured quantizers and a more general unstructured binning method. In the second part, structu","authors_text":"Farhad Shirani, S. Sandeep Pradhan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-05T02:32:38Z","title":"An Achievable Rate-Distortion Region for Multiple Descriptions Source Coding Based on Coset Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01911","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:4f88855650662c24d09bda253fde559a559ebe839195f21c1ec124faa8d532d0","target":"record","created_at":"2026-05-18T01:21:15Z","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":"bb05c8e52d0a2383e1ab330ba308095cf9046769ac9a371d5af07420be9c2f39","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-05T02:32:38Z","title_canon_sha256":"02efac35c5e614ca08d66758e4c29e1231c099bded8bb55c5a3b932c58c65c7a"},"schema_version":"1.0","source":{"id":"1602.01911","kind":"arxiv","version":1}},"canonical_sha256":"ebcd90539915a14bc139118489bdc2bef2560a8a77035f3fdd2b9cb35ebf1ddb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebcd90539915a14bc139118489bdc2bef2560a8a77035f3fdd2b9cb35ebf1ddb","first_computed_at":"2026-05-18T01:21:15.065921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:15.065921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jcFIBSzF4n0+I226NTr7Ha1L24WdyjKmud5fgiZqslMErfbUrC7qwO2HrNJv03vSWU9CVWwKE+YKjprYvltnAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:15.066635Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01911","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f88855650662c24d09bda253fde559a559ebe839195f21c1ec124faa8d532d0","sha256:4f9c78b0131e63016374f20d86cb7c62411affbe6548cf58c6fa918479add912"],"state_sha256":"71acb4067408f20c26eede92f03991924015040f87521bb5a7d37deac913e5c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q6r/4fa3pWTfPvuONY/l+nCm7DQSbliDxcbI2ZFXG+u24FPq/NknSxx+iyatMNFPOwNTojk7mjLS8kmsJYg+AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T15:52:29.438146Z","bundle_sha256":"6cd75dc91c6cc56c4cc66e39b8767c039e9f893797c8432a82cbf584b96156dc"}}