{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ROEG7QTRNSZACJC34IOMADYA3C","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":"15af9a497b31c37fcb2029ba9ec1e9c0825f50a773e9e0e20702d929788f560b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-08-01T15:36:02Z","title_canon_sha256":"ade8b56e894b9e15e28f5cf2ff800932503f8deb6b980d691e15b0bbdf36f276"},"schema_version":"1.0","source":{"id":"1908.00460","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00460","created_at":"2026-07-04T23:51:00Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00460v1","created_at":"2026-07-04T23:51:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00460","created_at":"2026-07-04T23:51:00Z"},{"alias_kind":"pith_short_12","alias_value":"ROEG7QTRNSZA","created_at":"2026-07-04T23:51:00Z"},{"alias_kind":"pith_short_16","alias_value":"ROEG7QTRNSZACJC3","created_at":"2026-07-04T23:51:00Z"},{"alias_kind":"pith_short_8","alias_value":"ROEG7QTR","created_at":"2026-07-04T23:51:00Z"}],"graph_snapshots":[{"event_id":"sha256:3ab1c6c3b5790d50b855b8e16a2c0b5418a55cf22d441a157cd608f98e118cb1","target":"graph","created_at":"2026-07-04T23:51:00Z","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/1908.00460/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Polar codes have been adopted as the control channel coding scheme in the fifth generation new radio (5G NR) standard due to its capacity-achievable property. Traditional polar decoding algorithms such as successive cancellation (SC) suffer from high latency problem because of their sequential decoding nature. Neural network decoder (NND) has been proved to be a candidate for polar decoder since it is capable of oneshot decoding and parallel computing. Whereas, the bit-errorrate (BER) performance of NND is still inferior to that of SC algorithm. In this paper, we propose a residual neural netw","authors_text":"Dou Li, Hongfei Zhu, Yuping Zhao, Zhiwei Cao","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-08-01T15:36:02Z","title":"Learning to Denoise and Decode: A Novel Residual Neural Network Decoder for Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00460","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:375281e64aba6778fe0960d6dbcb07c9a7ab026ccab4dfb98fbda09e99829042","target":"record","created_at":"2026-07-04T23:51:00Z","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":"15af9a497b31c37fcb2029ba9ec1e9c0825f50a773e9e0e20702d929788f560b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-08-01T15:36:02Z","title_canon_sha256":"ade8b56e894b9e15e28f5cf2ff800932503f8deb6b980d691e15b0bbdf36f276"},"schema_version":"1.0","source":{"id":"1908.00460","kind":"arxiv","version":1}},"canonical_sha256":"8b886fc2716cb201245be21cc00f00d8827dc7f4e9c7cab84520855962d223ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b886fc2716cb201245be21cc00f00d8827dc7f4e9c7cab84520855962d223ce","first_computed_at":"2026-07-04T23:51:00.693656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:00.693656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hB+Qdb9auEkIujl4wOc3XEzTCXArdC0tL5WrdlDmkz1BloEy7z+W29QzNUhfk3aSdG8kH6vNB6rNw4mVOzmgBw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:00.694020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.00460","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:375281e64aba6778fe0960d6dbcb07c9a7ab026ccab4dfb98fbda09e99829042","sha256:3ab1c6c3b5790d50b855b8e16a2c0b5418a55cf22d441a157cd608f98e118cb1"],"state_sha256":"43af5a734bae4f8fb93d41b883b65346bf8731dbc40ef6cf3751539dd6065c08"}