{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:T5BR5NT5PZEA7RQGHHK62BNPVR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"88f55b0510065c50d2c30338e1cd9b0cc0de7f4a9482e384dc87808960ebded4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-04-16T16:01:01Z","title_canon_sha256":"6dcb9284072806e684da4f2793df44c3b061e36efef8ae9b890d8944dd1cced1"},"schema_version":"1.0","source":{"id":"2104.08190","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.08190","created_at":"2026-07-05T02:32:41Z"},{"alias_kind":"arxiv_version","alias_value":"2104.08190v1","created_at":"2026-07-05T02:32:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.08190","created_at":"2026-07-05T02:32:41Z"},{"alias_kind":"pith_short_12","alias_value":"T5BR5NT5PZEA","created_at":"2026-07-05T02:32:41Z"},{"alias_kind":"pith_short_16","alias_value":"T5BR5NT5PZEA7RQG","created_at":"2026-07-05T02:32:41Z"},{"alias_kind":"pith_short_8","alias_value":"T5BR5NT5","created_at":"2026-07-05T02:32:41Z"}],"graph_snapshots":[{"event_id":"sha256:0362e2ec90bb99ad05c08237c8490ab7ce990b6b0a41ed8c3aef5dc51441ebec","target":"graph","created_at":"2026-07-05T02:32:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2104.08190/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alexandre Graell i Amat, Christian H\\\"ager, Dejan Vukobratovic, Henk Wymeersch, Vukan Ninkovic","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-04-16T16:01:01Z","title":"Autoencoder-Based Unequal Error Protection Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.08190","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:159b01ac263dd88445239d5d7cead8b996276d5d8b7e5fca72ae804ea70d2ca5","target":"record","created_at":"2026-07-05T02:32:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"88f55b0510065c50d2c30338e1cd9b0cc0de7f4a9482e384dc87808960ebded4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-04-16T16:01:01Z","title_canon_sha256":"6dcb9284072806e684da4f2793df44c3b061e36efef8ae9b890d8944dd1cced1"},"schema_version":"1.0","source":{"id":"2104.08190","kind":"arxiv","version":1}},"canonical_sha256":"9f431eb67d7e480fc60639d5ed05afac4361b8f0ffa1932c5879b5b7c42199c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f431eb67d7e480fc60639d5ed05afac4361b8f0ffa1932c5879b5b7c42199c8","first_computed_at":"2026-07-05T02:32:41.893909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:32:41.893909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C72IITtWZSCpbfME/PoNfE5c+gT+Rs7l+8ACEYlCwtlrULwFnCXU05L13UfbUf+vor7JTboNLspbG727lJuVAg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:32:41.894428Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.08190","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:159b01ac263dd88445239d5d7cead8b996276d5d8b7e5fca72ae804ea70d2ca5","sha256:0362e2ec90bb99ad05c08237c8490ab7ce990b6b0a41ed8c3aef5dc51441ebec"],"state_sha256":"53fe5dc9f68aa8e05a543fdeaa66b18acf59c2a64588a41c23c7b3874839a625"}