{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:K6VOYKM5DLCXVRRSOT5CAZWHR2","short_pith_number":"pith:K6VOYKM5","schema_version":"1.0","canonical_sha256":"57aaec299d1ac57ac63274fa2066c78eab3ce2f06b5b7c838b0cf785b17d37c5","source":{"kind":"arxiv","id":"1002.2971","version":1},"attestation_state":"computed","paper":{"title":"Erasure Multiple Descriptions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aaron B. Wagner, Ebad Ahmed","submitted_at":"2010-02-15T22:24:51Z","abstract_excerpt":"We consider a binary erasure version of the n-channel multiple descriptions problem with symmetric descriptions, i.e., the rates of the n descriptions are the same and the distortion constraint depends only on the number of messages received. We consider the case where there is no excess rate for every k out of n descriptions. Our goal is to characterize the achievable distortions D_1, D_2,...,D_n. We measure the fidelity of reconstruction using two distortion criteria: an average-case distortion criterion, under which distortion is measured by taking the average of the per-letter distortion o"},"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":"1002.2971","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-15T22:24:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"34dad332d65db684b09104affe74a3073f0033cc93b7698989a0e4992215a7a4","abstract_canon_sha256":"46dedc406ed276789ff506d2fdcb1dde367e4cdc3282b6ba6ac1f1138864bb8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.055924Z","signature_b64":"oOlumqrT/sFdN0WdAijglLPW5uRLI0eUPRdRA367p4OwCmrHaUgyiFu9ODRh7jy98sJpceEFjSdSD4Uokv9+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57aaec299d1ac57ac63274fa2066c78eab3ce2f06b5b7c838b0cf785b17d37c5","last_reissued_at":"2026-05-18T00:59:11.055216Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.055216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Erasure Multiple Descriptions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aaron B. Wagner, Ebad Ahmed","submitted_at":"2010-02-15T22:24:51Z","abstract_excerpt":"We consider a binary erasure version of the n-channel multiple descriptions problem with symmetric descriptions, i.e., the rates of the n descriptions are the same and the distortion constraint depends only on the number of messages received. We consider the case where there is no excess rate for every k out of n descriptions. Our goal is to characterize the achievable distortions D_1, D_2,...,D_n. We measure the fidelity of reconstruction using two distortion criteria: an average-case distortion criterion, under which distortion is measured by taking the average of the per-letter distortion o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.2971","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":"1002.2971","created_at":"2026-05-18T00:59:11.055332+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.2971v1","created_at":"2026-05-18T00:59:11.055332+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.2971","created_at":"2026-05-18T00:59:11.055332+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6VOYKM5DLCX","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6VOYKM5DLCXVRRS","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6VOYKM5","created_at":"2026-05-18T12:26:09.077623+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/K6VOYKM5DLCXVRRSOT5CAZWHR2","json":"https://pith.science/pith/K6VOYKM5DLCXVRRSOT5CAZWHR2.json","graph_json":"https://pith.science/api/pith-number/K6VOYKM5DLCXVRRSOT5CAZWHR2/graph.json","events_json":"https://pith.science/api/pith-number/K6VOYKM5DLCXVRRSOT5CAZWHR2/events.json","paper":"https://pith.science/paper/K6VOYKM5"},"agent_actions":{"view_html":"https://pith.science/pith/K6VOYKM5DLCXVRRSOT5CAZWHR2","download_json":"https://pith.science/pith/K6VOYKM5DLCXVRRSOT5CAZWHR2.json","view_paper":"https://pith.science/paper/K6VOYKM5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.2971&json=true","fetch_graph":"https://pith.science/api/pith-number/K6VOYKM5DLCXVRRSOT5CAZWHR2/graph.json","fetch_events":"https://pith.science/api/pith-number/K6VOYKM5DLCXVRRSOT5CAZWHR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6VOYKM5DLCXVRRSOT5CAZWHR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6VOYKM5DLCXVRRSOT5CAZWHR2/action/storage_attestation","attest_author":"https://pith.science/pith/K6VOYKM5DLCXVRRSOT5CAZWHR2/action/author_attestation","sign_citation":"https://pith.science/pith/K6VOYKM5DLCXVRRSOT5CAZWHR2/action/citation_signature","submit_replication":"https://pith.science/pith/K6VOYKM5DLCXVRRSOT5CAZWHR2/action/replication_record"}},"created_at":"2026-05-18T00:59:11.055332+00:00","updated_at":"2026-05-18T00:59:11.055332+00:00"}