{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DXH5Z7FDXFGUUPO2HVRHP6KJOR","short_pith_number":"pith:DXH5Z7FD","canonical_record":{"source":{"id":"2405.03288","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-06T09:05:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2f15f3e180e275620358e7d6524d4344fdf9c1d1c45f603b7a214f07b683c6a2","abstract_canon_sha256":"3d34d3eb18bdea0974465fdfea1b0ff33a42a3c8240b459d8264c8611f3d611a"},"schema_version":"1.0"},"canonical_sha256":"1dcfdcfca3b94d4a3dda3d6277f949744d60c5f549a1a42c7fdb939cb8d5f97d","source":{"kind":"arxiv","id":"2405.03288","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.03288","created_at":"2026-07-05T08:55:08Z"},{"alias_kind":"arxiv_version","alias_value":"2405.03288v3","created_at":"2026-07-05T08:55:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.03288","created_at":"2026-07-05T08:55:08Z"},{"alias_kind":"pith_short_12","alias_value":"DXH5Z7FDXFGU","created_at":"2026-07-05T08:55:08Z"},{"alias_kind":"pith_short_16","alias_value":"DXH5Z7FDXFGUUPO2","created_at":"2026-07-05T08:55:08Z"},{"alias_kind":"pith_short_8","alias_value":"DXH5Z7FD","created_at":"2026-07-05T08:55:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DXH5Z7FDXFGUUPO2HVRHP6KJOR","target":"record","payload":{"canonical_record":{"source":{"id":"2405.03288","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-06T09:05:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2f15f3e180e275620358e7d6524d4344fdf9c1d1c45f603b7a214f07b683c6a2","abstract_canon_sha256":"3d34d3eb18bdea0974465fdfea1b0ff33a42a3c8240b459d8264c8611f3d611a"},"schema_version":"1.0"},"canonical_sha256":"1dcfdcfca3b94d4a3dda3d6277f949744d60c5f549a1a42c7fdb939cb8d5f97d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:55:08.951663Z","signature_b64":"XyRZJ8qN4eK6iY+8ZQqd4jf2rRyQVbOohfXv/ULycKXuRrPiCxOhbjN34VsDKoVUrSnwtFUCBYKYjXbj9HfHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dcfdcfca3b94d4a3dda3d6277f949744d60c5f549a1a42c7fdb939cb8d5f97d","last_reissued_at":"2026-07-05T08:55:08.951187Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:55:08.951187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.03288","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:55:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+9F5ZqBuScFoZM+jVlrTUqTwJKaf09PihPG1sPZppEoK1mww1bUWyIYDj42fAg0WJLm0AWweLb5ORoFW411JAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T15:07:43.419958Z"},"content_sha256":"6a895104b3a19372ba8d5061049deae9cedc27189fbd64a3b99624058778dab2","schema_version":"1.0","event_id":"sha256:6a895104b3a19372ba8d5061049deae9cedc27189fbd64a3b99624058778dab2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DXH5Z7FDXFGUUPO2HVRHP6KJOR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achievability Bounds on Unequal Error Protection Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guiying Yan, Huazi Zhang, Jun Wang, Liuquan Yao, Shuai Yuan, Yuan Li, Zhiming Ma","submitted_at":"2024-05-06T09:05:13Z","abstract_excerpt":"Unequal error protection (UEP) codes can facilitate the transmission of messages with different protection levels. In this paper, we study the achievability bounds on UEP by the generalization of Gilbert-Varshamov (GV) bound. For the first time, we show that under certain conditions, UEP enhances the code rate comparing with time-sharing (TS) strategies asymptotically."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.03288","kind":"arxiv","version":3},"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/2405.03288/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:55:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kZ2Dby0Xf5y8weSdR4Xu0EYkMq8l9ePfHl1d/2qn64kDZVqJZql3SYxqjEsu+GZ/lAFCZrQk4nQIzfF1XlJmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T15:07:43.420346Z"},"content_sha256":"0627cf040982259cf5759106273fe865674560b4409da900612e0281739ade4d","schema_version":"1.0","event_id":"sha256:0627cf040982259cf5759106273fe865674560b4409da900612e0281739ade4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXH5Z7FDXFGUUPO2HVRHP6KJOR/bundle.json","state_url":"https://pith.science/pith/DXH5Z7FDXFGUUPO2HVRHP6KJOR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXH5Z7FDXFGUUPO2HVRHP6KJOR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-08T15:07:43Z","links":{"resolver":"https://pith.science/pith/DXH5Z7FDXFGUUPO2HVRHP6KJOR","bundle":"https://pith.science/pith/DXH5Z7FDXFGUUPO2HVRHP6KJOR/bundle.json","state":"https://pith.science/pith/DXH5Z7FDXFGUUPO2HVRHP6KJOR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXH5Z7FDXFGUUPO2HVRHP6KJOR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DXH5Z7FDXFGUUPO2HVRHP6KJOR","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":"3d34d3eb18bdea0974465fdfea1b0ff33a42a3c8240b459d8264c8611f3d611a","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-06T09:05:13Z","title_canon_sha256":"2f15f3e180e275620358e7d6524d4344fdf9c1d1c45f603b7a214f07b683c6a2"},"schema_version":"1.0","source":{"id":"2405.03288","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.03288","created_at":"2026-07-05T08:55:08Z"},{"alias_kind":"arxiv_version","alias_value":"2405.03288v3","created_at":"2026-07-05T08:55:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.03288","created_at":"2026-07-05T08:55:08Z"},{"alias_kind":"pith_short_12","alias_value":"DXH5Z7FDXFGU","created_at":"2026-07-05T08:55:08Z"},{"alias_kind":"pith_short_16","alias_value":"DXH5Z7FDXFGUUPO2","created_at":"2026-07-05T08:55:08Z"},{"alias_kind":"pith_short_8","alias_value":"DXH5Z7FD","created_at":"2026-07-05T08:55:08Z"}],"graph_snapshots":[{"event_id":"sha256:0627cf040982259cf5759106273fe865674560b4409da900612e0281739ade4d","target":"graph","created_at":"2026-07-05T08:55:08Z","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/2405.03288/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Unequal error protection (UEP) codes can facilitate the transmission of messages with different protection levels. In this paper, we study the achievability bounds on UEP by the generalization of Gilbert-Varshamov (GV) bound. For the first time, we show that under certain conditions, UEP enhances the code rate comparing with time-sharing (TS) strategies asymptotically.","authors_text":"Guiying Yan, Huazi Zhang, Jun Wang, Liuquan Yao, Shuai Yuan, Yuan Li, Zhiming Ma","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-06T09:05:13Z","title":"Achievability Bounds on Unequal Error Protection Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.03288","kind":"arxiv","version":3},"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:6a895104b3a19372ba8d5061049deae9cedc27189fbd64a3b99624058778dab2","target":"record","created_at":"2026-07-05T08:55:08Z","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":"3d34d3eb18bdea0974465fdfea1b0ff33a42a3c8240b459d8264c8611f3d611a","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-05-06T09:05:13Z","title_canon_sha256":"2f15f3e180e275620358e7d6524d4344fdf9c1d1c45f603b7a214f07b683c6a2"},"schema_version":"1.0","source":{"id":"2405.03288","kind":"arxiv","version":3}},"canonical_sha256":"1dcfdcfca3b94d4a3dda3d6277f949744d60c5f549a1a42c7fdb939cb8d5f97d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dcfdcfca3b94d4a3dda3d6277f949744d60c5f549a1a42c7fdb939cb8d5f97d","first_computed_at":"2026-07-05T08:55:08.951187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:55:08.951187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XyRZJ8qN4eK6iY+8ZQqd4jf2rRyQVbOohfXv/ULycKXuRrPiCxOhbjN34VsDKoVUrSnwtFUCBYKYjXbj9HfHBw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:55:08.951663Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.03288","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a895104b3a19372ba8d5061049deae9cedc27189fbd64a3b99624058778dab2","sha256:0627cf040982259cf5759106273fe865674560b4409da900612e0281739ade4d"],"state_sha256":"9d63818cfd7b18e28fbaa41aa66ddceab15709f76ccc59c25d418e2f4dee8504"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OJaLZ37YiN3X6XyRnIgZj79pt6eSZj/RJa9GcwIc80xZ+sy8TjK+cQCa2QKLK7KieyE6iclA1OqPiaam8eRpBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T15:07:43.422642Z","bundle_sha256":"58886966607ec795086a9a578e967109a90d0e554c94dbc5be2046b00847b734"}}