{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:THUNGWBVJHWC5JU7GJOYJFOEVG","short_pith_number":"pith:THUNGWBV","canonical_record":{"source":{"id":"1702.06901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-22T17:20:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e3a952eed0e1c1cb8a15ff9651281029803bba2864319db746007ed20318e839","abstract_canon_sha256":"05ada97addb0e9562f05b4f3c0b8140dd7c66d6eba4f4c33985a1ca8b26e6275"},"schema_version":"1.0"},"canonical_sha256":"99e8d3583549ec2ea69f325d8495c4a98f45a35730267ced0be5a947a8a4c704","source":{"kind":"arxiv","id":"1702.06901","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06901","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06901v1","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06901","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"pith_short_12","alias_value":"THUNGWBVJHWC","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"THUNGWBVJHWC5JU7","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"THUNGWBV","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:THUNGWBVJHWC5JU7GJOYJFOEVG","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-22T17:20:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e3a952eed0e1c1cb8a15ff9651281029803bba2864319db746007ed20318e839","abstract_canon_sha256":"05ada97addb0e9562f05b4f3c0b8140dd7c66d6eba4f4c33985a1ca8b26e6275"},"schema_version":"1.0"},"canonical_sha256":"99e8d3583549ec2ea69f325d8495c4a98f45a35730267ced0be5a947a8a4c704","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:10.172697Z","signature_b64":"kuNp7vO3vQ/OUDULwQrB+G1+py58DvwVLW4yM20sVS0KQeqd4+VHwBpBOmYB6fc/AT+qZksXYZF9zbGopwSsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99e8d3583549ec2ea69f325d8495c4a98f45a35730267ced0be5a947a8a4c704","last_reissued_at":"2026-05-18T00:50:10.172005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:10.172005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06901","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:50:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M5QGvaaS1qik/aDdeBXS7poHl2eWxlbElxICfbU0q7+0ySFmKzekyi4sNgb+iWm19cyF/x1ubQNk1zMyHskZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:07:40.736592Z"},"content_sha256":"00e6148343a5722198cbf22ec50ad7256ee210205708182898016fe935beb616","schema_version":"1.0","event_id":"sha256:00e6148343a5722198cbf22ec50ad7256ee210205708182898016fe935beb616"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:THUNGWBVJHWC5JU7GJOYJFOEVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling Deep Learning-based Decoding of Polar Codes via Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jakob Hoydis, Sebastian Cammerer, Stephan ten Brink, Tobias Gruber","submitted_at":"2017-02-22T17:20:13Z","abstract_excerpt":"The training complexity of deep learning-based channel decoders scales exponentially with the codebook size and therefore with the number of information bits. Thus, neural network decoding (NND) is currently only feasible for very short block lengths. In this work, we show that the conventional iterative decoding algorithm for polar codes can be enhanced when sub-blocks of the decoder are replaced by neural network (NN) based components. Thus, we partition the encoding graph into smaller sub-blocks and train them individually, closely approaching maximum a posteriori (MAP) performance per sub-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06901","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:50:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hartR2GahVgE5RZWNCzyV6ukKRF9zvH3d9Z3UL0Hxj9iifjh+Wa3z+9TjS168UZHgz6mphOWxTfDClXiquwJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:07:40.737255Z"},"content_sha256":"52cfecc62aac9c0efbda62f0e39f461ae7e45bcdad921291c3f4e375db25eed9","schema_version":"1.0","event_id":"sha256:52cfecc62aac9c0efbda62f0e39f461ae7e45bcdad921291c3f4e375db25eed9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THUNGWBVJHWC5JU7GJOYJFOEVG/bundle.json","state_url":"https://pith.science/pith/THUNGWBVJHWC5JU7GJOYJFOEVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THUNGWBVJHWC5JU7GJOYJFOEVG/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-26T00:07:40Z","links":{"resolver":"https://pith.science/pith/THUNGWBVJHWC5JU7GJOYJFOEVG","bundle":"https://pith.science/pith/THUNGWBVJHWC5JU7GJOYJFOEVG/bundle.json","state":"https://pith.science/pith/THUNGWBVJHWC5JU7GJOYJFOEVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THUNGWBVJHWC5JU7GJOYJFOEVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:THUNGWBVJHWC5JU7GJOYJFOEVG","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":"05ada97addb0e9562f05b4f3c0b8140dd7c66d6eba4f4c33985a1ca8b26e6275","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-22T17:20:13Z","title_canon_sha256":"e3a952eed0e1c1cb8a15ff9651281029803bba2864319db746007ed20318e839"},"schema_version":"1.0","source":{"id":"1702.06901","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06901","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06901v1","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06901","created_at":"2026-05-18T00:50:10Z"},{"alias_kind":"pith_short_12","alias_value":"THUNGWBVJHWC","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"THUNGWBVJHWC5JU7","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"THUNGWBV","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:52cfecc62aac9c0efbda62f0e39f461ae7e45bcdad921291c3f4e375db25eed9","target":"graph","created_at":"2026-05-18T00:50:10Z","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":"The training complexity of deep learning-based channel decoders scales exponentially with the codebook size and therefore with the number of information bits. Thus, neural network decoding (NND) is currently only feasible for very short block lengths. In this work, we show that the conventional iterative decoding algorithm for polar codes can be enhanced when sub-blocks of the decoder are replaced by neural network (NN) based components. Thus, we partition the encoding graph into smaller sub-blocks and train them individually, closely approaching maximum a posteriori (MAP) performance per sub-","authors_text":"Jakob Hoydis, Sebastian Cammerer, Stephan ten Brink, Tobias Gruber","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-22T17:20:13Z","title":"Scaling Deep Learning-based Decoding of Polar Codes via Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06901","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:00e6148343a5722198cbf22ec50ad7256ee210205708182898016fe935beb616","target":"record","created_at":"2026-05-18T00:50:10Z","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":"05ada97addb0e9562f05b4f3c0b8140dd7c66d6eba4f4c33985a1ca8b26e6275","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-22T17:20:13Z","title_canon_sha256":"e3a952eed0e1c1cb8a15ff9651281029803bba2864319db746007ed20318e839"},"schema_version":"1.0","source":{"id":"1702.06901","kind":"arxiv","version":1}},"canonical_sha256":"99e8d3583549ec2ea69f325d8495c4a98f45a35730267ced0be5a947a8a4c704","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99e8d3583549ec2ea69f325d8495c4a98f45a35730267ced0be5a947a8a4c704","first_computed_at":"2026-05-18T00:50:10.172005Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:10.172005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kuNp7vO3vQ/OUDULwQrB+G1+py58DvwVLW4yM20sVS0KQeqd4+VHwBpBOmYB6fc/AT+qZksXYZF9zbGopwSsBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:10.172697Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06901","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00e6148343a5722198cbf22ec50ad7256ee210205708182898016fe935beb616","sha256:52cfecc62aac9c0efbda62f0e39f461ae7e45bcdad921291c3f4e375db25eed9"],"state_sha256":"8f2925ada746daa2b6d491220351a289cf8899cfe154c73571a75eca473767ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvivGzrOFPv4KN1f17A4SwRujiQoTKoHqYJos5tmMnLIH7jNcte9z2VBY6cx7yp5gppT/Tcfrtf2altZhblNBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:07:40.740991Z","bundle_sha256":"affcc454fed9a45f27afae1f5bda526027fbf45c72c13cda3e6947500fc6a90a"}}