{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LNISLQYUR4JFSD3L3O5JGRIY4R","short_pith_number":"pith:LNISLQYU","canonical_record":{"source":{"id":"1811.09801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-24T09:50:23Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"534fcdbadf56058ef94aeb381494a48446a5cf373c5769b4e3abde7f6eebf88f","abstract_canon_sha256":"e67846d2e4b5f369a6e2866450420f412cdb8c160645cbbc85c2497f34abdd93"},"schema_version":"1.0"},"canonical_sha256":"5b5125c3148f12590f6bdbba934518e45a5e9c9b472248fb45724914dfd92728","source":{"kind":"arxiv","id":"1811.09801","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.09801","created_at":"2026-05-18T00:00:01Z"},{"alias_kind":"arxiv_version","alias_value":"1811.09801v1","created_at":"2026-05-18T00:00:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09801","created_at":"2026-05-18T00:00:01Z"},{"alias_kind":"pith_short_12","alias_value":"LNISLQYUR4JF","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LNISLQYUR4JFSD3L","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LNISLQYU","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LNISLQYUR4JFSD3L3O5JGRIY4R","target":"record","payload":{"canonical_record":{"source":{"id":"1811.09801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-24T09:50:23Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"534fcdbadf56058ef94aeb381494a48446a5cf373c5769b4e3abde7f6eebf88f","abstract_canon_sha256":"e67846d2e4b5f369a6e2866450420f412cdb8c160645cbbc85c2497f34abdd93"},"schema_version":"1.0"},"canonical_sha256":"5b5125c3148f12590f6bdbba934518e45a5e9c9b472248fb45724914dfd92728","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:01.183660Z","signature_b64":"JyXHekdvWuEnGTljIJm/wdyfjXxNqtuowXRjWF/Ri4TLJcKgYs+0Y11Edl1e6u/0uh/+mUW9UGPOFEtElF4iAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b5125c3148f12590f6bdbba934518e45a5e9c9b472248fb45724914dfd92728","last_reissued_at":"2026-05-18T00:00:01.183200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:01.183200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.09801","source_version":1,"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-05-18T00:00:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qlAi6Q3KXh4gy9f3gVxfJ3jv0QtrK3qIZCGaCVOBmMEeqyx3S6lNldAVpoIjUghAWo49pgukrjUhv8Jn8EfAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:15:03.145107Z"},"content_sha256":"939d314144f7b003e9cc1df11665b972a2a1ea29eeecaefae2556d304c2054e4","schema_version":"1.0","event_id":"sha256:939d314144f7b003e9cc1df11665b972a2a1ea29eeecaefae2556d304c2054e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LNISLQYUR4JFSD3L3O5JGRIY4R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polar Decoding on Sparse Graphs with Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"eess.SP","authors_text":"2), (2) National Mobile Communications Research Laboratory, (3) School of Electrical Engineering, Chuan Zhang (1, Israel), Signal-processing (LEADS), Tel-Aviv, Tel-Aviv University, Weihong Xu (1, Xiaohu You (2), Yair Be'ery (3) ((1) Lab of Efficient Architectures for Digital-communication","submitted_at":"2018-11-24T09:50:23Z","abstract_excerpt":"In this paper, we present a sparse neural network decoder (SNND) of polar codes based on belief propagation (BP) and deep learning. At first, the conventional factor graph of polar BP decoding is converted to the bipartite Tanner graph similar to low-density parity-check (LDPC) codes. Then the Tanner graph is unfolded and translated into the graphical representation of deep neural network (DNN). The complex sum-product algorithm (SPA) is modified to min-sum (MS) approximation with low complexity. We dramatically reduce the number of weight by using single weight to parameterize the networks. O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09801","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"},"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-05-18T00:00:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2P5d8nsat50Z0HtlwcbksO5vSi0elHSkBAxC+sjapdYyPoqWRURa6+N08B9obZc14A2cVoXKIzLdesFzeiLRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:15:03.145537Z"},"content_sha256":"7c69415e6a93e771e83f15a460d28c02c31433eec3fb41626c2fa5083084a9ea","schema_version":"1.0","event_id":"sha256:7c69415e6a93e771e83f15a460d28c02c31433eec3fb41626c2fa5083084a9ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LNISLQYUR4JFSD3L3O5JGRIY4R/bundle.json","state_url":"https://pith.science/pith/LNISLQYUR4JFSD3L3O5JGRIY4R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LNISLQYUR4JFSD3L3O5JGRIY4R/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-05-27T18:15:03Z","links":{"resolver":"https://pith.science/pith/LNISLQYUR4JFSD3L3O5JGRIY4R","bundle":"https://pith.science/pith/LNISLQYUR4JFSD3L3O5JGRIY4R/bundle.json","state":"https://pith.science/pith/LNISLQYUR4JFSD3L3O5JGRIY4R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LNISLQYUR4JFSD3L3O5JGRIY4R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LNISLQYUR4JFSD3L3O5JGRIY4R","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":"e67846d2e4b5f369a6e2866450420f412cdb8c160645cbbc85c2497f34abdd93","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-24T09:50:23Z","title_canon_sha256":"534fcdbadf56058ef94aeb381494a48446a5cf373c5769b4e3abde7f6eebf88f"},"schema_version":"1.0","source":{"id":"1811.09801","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.09801","created_at":"2026-05-18T00:00:01Z"},{"alias_kind":"arxiv_version","alias_value":"1811.09801v1","created_at":"2026-05-18T00:00:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09801","created_at":"2026-05-18T00:00:01Z"},{"alias_kind":"pith_short_12","alias_value":"LNISLQYUR4JF","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LNISLQYUR4JFSD3L","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LNISLQYU","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:7c69415e6a93e771e83f15a460d28c02c31433eec3fb41626c2fa5083084a9ea","target":"graph","created_at":"2026-05-18T00:00:01Z","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"},"paper":{"abstract_excerpt":"In this paper, we present a sparse neural network decoder (SNND) of polar codes based on belief propagation (BP) and deep learning. At first, the conventional factor graph of polar BP decoding is converted to the bipartite Tanner graph similar to low-density parity-check (LDPC) codes. Then the Tanner graph is unfolded and translated into the graphical representation of deep neural network (DNN). The complex sum-product algorithm (SPA) is modified to min-sum (MS) approximation with low complexity. We dramatically reduce the number of weight by using single weight to parameterize the networks. O","authors_text":"2), (2) National Mobile Communications Research Laboratory, (3) School of Electrical Engineering, Chuan Zhang (1, Israel), Signal-processing (LEADS), Tel-Aviv, Tel-Aviv University, Weihong Xu (1, Xiaohu You (2), Yair Be'ery (3) ((1) Lab of Efficient Architectures for Digital-communication","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-24T09:50:23Z","title":"Polar Decoding on Sparse Graphs with Deep Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09801","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:939d314144f7b003e9cc1df11665b972a2a1ea29eeecaefae2556d304c2054e4","target":"record","created_at":"2026-05-18T00:00:01Z","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":"e67846d2e4b5f369a6e2866450420f412cdb8c160645cbbc85c2497f34abdd93","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-24T09:50:23Z","title_canon_sha256":"534fcdbadf56058ef94aeb381494a48446a5cf373c5769b4e3abde7f6eebf88f"},"schema_version":"1.0","source":{"id":"1811.09801","kind":"arxiv","version":1}},"canonical_sha256":"5b5125c3148f12590f6bdbba934518e45a5e9c9b472248fb45724914dfd92728","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b5125c3148f12590f6bdbba934518e45a5e9c9b472248fb45724914dfd92728","first_computed_at":"2026-05-18T00:00:01.183200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:01.183200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JyXHekdvWuEnGTljIJm/wdyfjXxNqtuowXRjWF/Ri4TLJcKgYs+0Y11Edl1e6u/0uh/+mUW9UGPOFEtElF4iAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:01.183660Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.09801","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:939d314144f7b003e9cc1df11665b972a2a1ea29eeecaefae2556d304c2054e4","sha256:7c69415e6a93e771e83f15a460d28c02c31433eec3fb41626c2fa5083084a9ea"],"state_sha256":"75a9c946d5e080deec3a4dd6c0312872093477e43b838b43b325c9cfc978cc9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TyBLzC97tW+qziFs17XNEKl+YTyJHEPxjdmwzCJ7UFh6yFXIa5/8Lb7BQyZCeu1cdajRyF0i+MRdoi0Fs5SGDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:15:03.147908Z","bundle_sha256":"2854df86f6e1feb2d3e7362fa784dd81f900c329cf64699a5ac8bef19ae94101"}}