{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:C545ESUVIDNP5ILIA7Y7P5AK5T","short_pith_number":"pith:C545ESUV","schema_version":"1.0","canonical_sha256":"1779d24a9540dafea16807f1f7f40aecd44e135cf12ce1646b332992a160b099","source":{"kind":"arxiv","id":"1305.3375","version":1},"attestation_state":"computed","paper":{"title":"On the Role of Common Codewords in Quadratic Gaussian Multiple Descriptions Coding","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":"2013-05-15T07:17:52Z","abstract_excerpt":"This paper focuses on the problem of $L-$channel quadratic Gaussian multiple description (MD) coding. We recently introduced a new encoding scheme in [1] for general $L-$channel MD problem, based on a technique called `Combinatorial Message Sharing' (CMS), where every subset of the descriptions shares a distinct common message. The new achievable region subsumes the most well known region for the general problem, due to Venkataramani, Kramer and Goyal (VKG) [2]. Moreover, we showed in [3] that the new scheme provides a strict improvement of the achievable region for any source and distortion m"},"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":"1305.3375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-15T07:17:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a0a7f98bf4e294f35283ba1772b55cbda2ff66c8ceaef2091767cf52ad968810","abstract_canon_sha256":"ce09081a219f5c1ee9970f2b6a368bbb0c703330df8a25029122daff37620a32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:36.009155Z","signature_b64":"BZ9o6QGcDDGHlJDXyoba7iDl4pKlO8huaxqhNsESo61qzGXR6lTOPYNL3ZEWe5BwaAQNmN//0Dtk17BZ9TmUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1779d24a9540dafea16807f1f7f40aecd44e135cf12ce1646b332992a160b099","last_reissued_at":"2026-05-18T03:25:36.008520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:36.008520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Role of Common Codewords in Quadratic Gaussian Multiple Descriptions Coding","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":"2013-05-15T07:17:52Z","abstract_excerpt":"This paper focuses on the problem of $L-$channel quadratic Gaussian multiple description (MD) coding. We recently introduced a new encoding scheme in [1] for general $L-$channel MD problem, based on a technique called `Combinatorial Message Sharing' (CMS), where every subset of the descriptions shares a distinct common message. The new achievable region subsumes the most well known region for the general problem, due to Venkataramani, Kramer and Goyal (VKG) [2]. Moreover, we showed in [3] that the new scheme provides a strict improvement of the achievable region for any source and distortion m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3375","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":"1305.3375","created_at":"2026-05-18T03:25:36.008626+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.3375v1","created_at":"2026-05-18T03:25:36.008626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3375","created_at":"2026-05-18T03:25:36.008626+00:00"},{"alias_kind":"pith_short_12","alias_value":"C545ESUVIDNP","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"C545ESUVIDNP5ILI","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"C545ESUV","created_at":"2026-05-18T12:27:40.988391+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/C545ESUVIDNP5ILIA7Y7P5AK5T","json":"https://pith.science/pith/C545ESUVIDNP5ILIA7Y7P5AK5T.json","graph_json":"https://pith.science/api/pith-number/C545ESUVIDNP5ILIA7Y7P5AK5T/graph.json","events_json":"https://pith.science/api/pith-number/C545ESUVIDNP5ILIA7Y7P5AK5T/events.json","paper":"https://pith.science/paper/C545ESUV"},"agent_actions":{"view_html":"https://pith.science/pith/C545ESUVIDNP5ILIA7Y7P5AK5T","download_json":"https://pith.science/pith/C545ESUVIDNP5ILIA7Y7P5AK5T.json","view_paper":"https://pith.science/paper/C545ESUV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.3375&json=true","fetch_graph":"https://pith.science/api/pith-number/C545ESUVIDNP5ILIA7Y7P5AK5T/graph.json","fetch_events":"https://pith.science/api/pith-number/C545ESUVIDNP5ILIA7Y7P5AK5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C545ESUVIDNP5ILIA7Y7P5AK5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C545ESUVIDNP5ILIA7Y7P5AK5T/action/storage_attestation","attest_author":"https://pith.science/pith/C545ESUVIDNP5ILIA7Y7P5AK5T/action/author_attestation","sign_citation":"https://pith.science/pith/C545ESUVIDNP5ILIA7Y7P5AK5T/action/citation_signature","submit_replication":"https://pith.science/pith/C545ESUVIDNP5ILIA7Y7P5AK5T/action/replication_record"}},"created_at":"2026-05-18T03:25:36.008626+00:00","updated_at":"2026-05-18T03:25:36.008626+00:00"}