{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PYS2NZ3OQWRGNZN3VCL34XJRWQ","short_pith_number":"pith:PYS2NZ3O","schema_version":"1.0","canonical_sha256":"7e25a6e76e85a266e5bba897be5d31b4256dbe5115c6ec6ea4ff5d62f8b73d4d","source":{"kind":"arxiv","id":"1402.2032","version":1},"attestation_state":"computed","paper":{"title":"An Achievable Rate-Distortion Region for the Multiple Descriptions Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farhad Shirani, Sandeep Pradhan","submitted_at":"2014-02-10T04:25:54Z","abstract_excerpt":"A multiple-descriptions (MD) coding strategy is proposed and an inner bound to the achievable rate-distortion region is derived. The scheme utilizes linear codes. It is shown in two different MD set-ups that the linear coding scheme achieves a larger rate-distortion region than previously known random coding strategies. Furthermore, it is shown via an example that the best known random coding scheme for the set-up can be improved by including additional randomly generated codebooks."},"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":"1402.2032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-10T04:25:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0af79acec83bcc13d0074d0740a892e4629a170f223e5ef15d4e342df5af9b27","abstract_canon_sha256":"c254c7ffe3e54c1bbb93cb5a3f04ff029ce23d1b54f030aecce190cf33ac7b2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:32.578989Z","signature_b64":"5roXrUh15edgIKbynh5mPNZpghqmJA7XKGu3/Wy6qr5kfBavDEkdFa+cmHand2MVrSCMDogfX2+IDJPD2Mt0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e25a6e76e85a266e5bba897be5d31b4256dbe5115c6ec6ea4ff5d62f8b73d4d","last_reissued_at":"2026-05-18T02:59:32.578427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:32.578427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Achievable Rate-Distortion Region for the Multiple Descriptions Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farhad Shirani, Sandeep Pradhan","submitted_at":"2014-02-10T04:25:54Z","abstract_excerpt":"A multiple-descriptions (MD) coding strategy is proposed and an inner bound to the achievable rate-distortion region is derived. The scheme utilizes linear codes. It is shown in two different MD set-ups that the linear coding scheme achieves a larger rate-distortion region than previously known random coding strategies. Furthermore, it is shown via an example that the best known random coding scheme for the set-up can be improved by including additional randomly generated codebooks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2032","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":"1402.2032","created_at":"2026-05-18T02:59:32.578507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2032v1","created_at":"2026-05-18T02:59:32.578507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2032","created_at":"2026-05-18T02:59:32.578507+00:00"},{"alias_kind":"pith_short_12","alias_value":"PYS2NZ3OQWRG","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PYS2NZ3OQWRGNZN3","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PYS2NZ3O","created_at":"2026-05-18T12:28:43.426989+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/PYS2NZ3OQWRGNZN3VCL34XJRWQ","json":"https://pith.science/pith/PYS2NZ3OQWRGNZN3VCL34XJRWQ.json","graph_json":"https://pith.science/api/pith-number/PYS2NZ3OQWRGNZN3VCL34XJRWQ/graph.json","events_json":"https://pith.science/api/pith-number/PYS2NZ3OQWRGNZN3VCL34XJRWQ/events.json","paper":"https://pith.science/paper/PYS2NZ3O"},"agent_actions":{"view_html":"https://pith.science/pith/PYS2NZ3OQWRGNZN3VCL34XJRWQ","download_json":"https://pith.science/pith/PYS2NZ3OQWRGNZN3VCL34XJRWQ.json","view_paper":"https://pith.science/paper/PYS2NZ3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2032&json=true","fetch_graph":"https://pith.science/api/pith-number/PYS2NZ3OQWRGNZN3VCL34XJRWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/PYS2NZ3OQWRGNZN3VCL34XJRWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PYS2NZ3OQWRGNZN3VCL34XJRWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PYS2NZ3OQWRGNZN3VCL34XJRWQ/action/storage_attestation","attest_author":"https://pith.science/pith/PYS2NZ3OQWRGNZN3VCL34XJRWQ/action/author_attestation","sign_citation":"https://pith.science/pith/PYS2NZ3OQWRGNZN3VCL34XJRWQ/action/citation_signature","submit_replication":"https://pith.science/pith/PYS2NZ3OQWRGNZN3VCL34XJRWQ/action/replication_record"}},"created_at":"2026-05-18T02:59:32.578507+00:00","updated_at":"2026-05-18T02:59:32.578507+00:00"}