{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:C4CGZJQI5URL7HRVYT2FTOV7IR","short_pith_number":"pith:C4CGZJQI","schema_version":"1.0","canonical_sha256":"17046ca608ed22bf9e35c4f459babf4469cca96ed430f4149e87732083917983","source":{"kind":"arxiv","id":"1405.0891","version":1},"attestation_state":"computed","paper":{"title":"Unequal Message Protection: Asymptotic and Non-Asymptotic Tradeoffs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Stark C. Draper, Vincent Y. F. Tan, Yanina Y. Shkel","submitted_at":"2014-05-05T13:17:21Z","abstract_excerpt":"We study a form of unequal error protection that we term \"unequal message protection\" (UMP). The message set of a UMP code is a union of $m$ disjoint message classes. Each class has its own error protection requirement, with some classes needing better error protection than others. We analyze the tradeoff between rates of message classes and the levels of error protection of these codes. We demonstrate that there is a clear performance loss compared to homogeneous (classical) codes with equivalent parameters. This is in sharp contrast to previous literature that considers UMP codes. To obtain "},"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":"1405.0891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-05T13:17:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3ed7f259b94cc34d19724a20fb21b61b719a65477d75eabe71b87c82f8041ec0","abstract_canon_sha256":"ad54cb31df5bdca5cd1f03760f22ce255f8857f1b0d013044c6f391d02067820"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:40.468649Z","signature_b64":"JsfcmtHKVVjUTtbh1K33WwLJ5rizyP0VieshDfes0KOZB6/STT+z/I8JZyV+p/dkOlHsGpUJP1tGgZ8yFZh2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17046ca608ed22bf9e35c4f459babf4469cca96ed430f4149e87732083917983","last_reissued_at":"2026-05-18T02:52:40.468220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:40.468220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unequal Message Protection: Asymptotic and Non-Asymptotic Tradeoffs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Stark C. Draper, Vincent Y. F. Tan, Yanina Y. Shkel","submitted_at":"2014-05-05T13:17:21Z","abstract_excerpt":"We study a form of unequal error protection that we term \"unequal message protection\" (UMP). The message set of a UMP code is a union of $m$ disjoint message classes. Each class has its own error protection requirement, with some classes needing better error protection than others. We analyze the tradeoff between rates of message classes and the levels of error protection of these codes. We demonstrate that there is a clear performance loss compared to homogeneous (classical) codes with equivalent parameters. This is in sharp contrast to previous literature that considers UMP codes. To obtain "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0891","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":"1405.0891","created_at":"2026-05-18T02:52:40.468281+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.0891v1","created_at":"2026-05-18T02:52:40.468281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0891","created_at":"2026-05-18T02:52:40.468281+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4CGZJQI5URL","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4CGZJQI5URL7HRV","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4CGZJQI","created_at":"2026-05-18T12:28:22.404517+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/C4CGZJQI5URL7HRVYT2FTOV7IR","json":"https://pith.science/pith/C4CGZJQI5URL7HRVYT2FTOV7IR.json","graph_json":"https://pith.science/api/pith-number/C4CGZJQI5URL7HRVYT2FTOV7IR/graph.json","events_json":"https://pith.science/api/pith-number/C4CGZJQI5URL7HRVYT2FTOV7IR/events.json","paper":"https://pith.science/paper/C4CGZJQI"},"agent_actions":{"view_html":"https://pith.science/pith/C4CGZJQI5URL7HRVYT2FTOV7IR","download_json":"https://pith.science/pith/C4CGZJQI5URL7HRVYT2FTOV7IR.json","view_paper":"https://pith.science/paper/C4CGZJQI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.0891&json=true","fetch_graph":"https://pith.science/api/pith-number/C4CGZJQI5URL7HRVYT2FTOV7IR/graph.json","fetch_events":"https://pith.science/api/pith-number/C4CGZJQI5URL7HRVYT2FTOV7IR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4CGZJQI5URL7HRVYT2FTOV7IR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4CGZJQI5URL7HRVYT2FTOV7IR/action/storage_attestation","attest_author":"https://pith.science/pith/C4CGZJQI5URL7HRVYT2FTOV7IR/action/author_attestation","sign_citation":"https://pith.science/pith/C4CGZJQI5URL7HRVYT2FTOV7IR/action/citation_signature","submit_replication":"https://pith.science/pith/C4CGZJQI5URL7HRVYT2FTOV7IR/action/replication_record"}},"created_at":"2026-05-18T02:52:40.468281+00:00","updated_at":"2026-05-18T02:52:40.468281+00:00"}