{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:T5BR5NT5PZEA7RQGHHK62BNPVR","short_pith_number":"pith:T5BR5NT5","schema_version":"1.0","canonical_sha256":"9f431eb67d7e480fc60639d5ed05afac4361b8f0ffa1932c5879b5b7c42199c8","source":{"kind":"arxiv","id":"2104.08190","version":1},"attestation_state":"computed","paper":{"title":"Autoencoder-Based Unequal Error Protection Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Christian H\\\"ager, Dejan Vukobratovic, Henk Wymeersch, Vukan Ninkovic","submitted_at":"2021-04-16T16:01:01Z","abstract_excerpt":"We present a novel autoencoder-based approach for designing codes that provide unequal error protection (UEP) capabilities. The proposed design is based on a generalization of an autoencoder loss function that accommodates both message-wise and bit-wise UEP scenarios. In both scenarios, the generalized loss function can be adjusted using an associated weight vector to trade off error probabilities corresponding to different importance classes. For message-wise UEP, we compare the proposed autoencoder-based UEP codes with a union of random coset codes. For bit-wise UEP, the proposed codes are c"},"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":"2104.08190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-04-16T16:01:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6dcb9284072806e684da4f2793df44c3b061e36efef8ae9b890d8944dd1cced1","abstract_canon_sha256":"88f55b0510065c50d2c30338e1cd9b0cc0de7f4a9482e384dc87808960ebded4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:32:41.894428Z","signature_b64":"C72IITtWZSCpbfME/PoNfE5c+gT+Rs7l+8ACEYlCwtlrULwFnCXU05L13UfbUf+vor7JTboNLspbG727lJuVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f431eb67d7e480fc60639d5ed05afac4361b8f0ffa1932c5879b5b7c42199c8","last_reissued_at":"2026-07-05T02:32:41.893909Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:32:41.893909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Autoencoder-Based Unequal Error Protection Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Christian H\\\"ager, Dejan Vukobratovic, Henk Wymeersch, Vukan Ninkovic","submitted_at":"2021-04-16T16:01:01Z","abstract_excerpt":"We present a novel autoencoder-based approach for designing codes that provide unequal error protection (UEP) capabilities. The proposed design is based on a generalization of an autoencoder loss function that accommodates both message-wise and bit-wise UEP scenarios. In both scenarios, the generalized loss function can be adjusted using an associated weight vector to trade off error probabilities corresponding to different importance classes. For message-wise UEP, we compare the proposed autoencoder-based UEP codes with a union of random coset codes. For bit-wise UEP, the proposed codes are c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.08190","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.08190/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2104.08190","created_at":"2026-07-05T02:32:41.893967+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.08190v1","created_at":"2026-07-05T02:32:41.893967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.08190","created_at":"2026-07-05T02:32:41.893967+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5BR5NT5PZEA","created_at":"2026-07-05T02:32:41.893967+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5BR5NT5PZEA7RQG","created_at":"2026-07-05T02:32:41.893967+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5BR5NT5","created_at":"2026-07-05T02:32:41.893967+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/T5BR5NT5PZEA7RQGHHK62BNPVR","json":"https://pith.science/pith/T5BR5NT5PZEA7RQGHHK62BNPVR.json","graph_json":"https://pith.science/api/pith-number/T5BR5NT5PZEA7RQGHHK62BNPVR/graph.json","events_json":"https://pith.science/api/pith-number/T5BR5NT5PZEA7RQGHHK62BNPVR/events.json","paper":"https://pith.science/paper/T5BR5NT5"},"agent_actions":{"view_html":"https://pith.science/pith/T5BR5NT5PZEA7RQGHHK62BNPVR","download_json":"https://pith.science/pith/T5BR5NT5PZEA7RQGHHK62BNPVR.json","view_paper":"https://pith.science/paper/T5BR5NT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.08190&json=true","fetch_graph":"https://pith.science/api/pith-number/T5BR5NT5PZEA7RQGHHK62BNPVR/graph.json","fetch_events":"https://pith.science/api/pith-number/T5BR5NT5PZEA7RQGHHK62BNPVR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5BR5NT5PZEA7RQGHHK62BNPVR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5BR5NT5PZEA7RQGHHK62BNPVR/action/storage_attestation","attest_author":"https://pith.science/pith/T5BR5NT5PZEA7RQGHHK62BNPVR/action/author_attestation","sign_citation":"https://pith.science/pith/T5BR5NT5PZEA7RQGHHK62BNPVR/action/citation_signature","submit_replication":"https://pith.science/pith/T5BR5NT5PZEA7RQGHHK62BNPVR/action/replication_record"}},"created_at":"2026-07-05T02:32:41.893967+00:00","updated_at":"2026-07-05T02:32:41.893967+00:00"}