{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZKXTSNFJPROEYULSQ2ZVMUFSZQ","short_pith_number":"pith:ZKXTSNFJ","canonical_record":{"source":{"id":"1412.5501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-17T17:48:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fcc799468d4650e488d39c31575a1ab5167e5937db917868bf8dfa13763ecbcb","abstract_canon_sha256":"94d1dc97bec1e708a61534fee8f705c255626b4555e0c8a289f7bc07fd818e92"},"schema_version":"1.0"},"canonical_sha256":"caaf3934a97c5c4c517286b35650b2cc17a33b6df3ec99f3b4c36b301f2f15af","source":{"kind":"arxiv","id":"1412.5501","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5501","created_at":"2026-05-18T02:31:02Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5501v1","created_at":"2026-05-18T02:31:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5501","created_at":"2026-05-18T02:31:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZKXTSNFJPROE","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZKXTSNFJPROEYULS","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZKXTSNFJ","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZKXTSNFJPROEYULSQ2ZVMUFSZQ","target":"record","payload":{"canonical_record":{"source":{"id":"1412.5501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-17T17:48:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fcc799468d4650e488d39c31575a1ab5167e5937db917868bf8dfa13763ecbcb","abstract_canon_sha256":"94d1dc97bec1e708a61534fee8f705c255626b4555e0c8a289f7bc07fd818e92"},"schema_version":"1.0"},"canonical_sha256":"caaf3934a97c5c4c517286b35650b2cc17a33b6df3ec99f3b4c36b301f2f15af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:02.851433Z","signature_b64":"+2VIZ40RdlXEFFTmhSyj8+tn8psKRVDro3mAJNTIWOVnpJAq6M+lVcZczPHkpSHtO+a6Gw+DdU6AM9BHcWJlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"caaf3934a97c5c4c517286b35650b2cc17a33b6df3ec99f3b4c36b301f2f15af","last_reissued_at":"2026-05-18T02:31:02.850959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:02.850959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.5501","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-18T02:31:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"15sQblPH1POj0i/Du/HC1sWeScj69IDRFo3PRNMHuMPs/jHozlY4MMvWpIdISHUqgclv87n1XbqsM7Aa3fPzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:46:43.825744Z"},"content_sha256":"9bea5b1519f2eb3db13aaddb37ada6fe227d0444444d422c4a41cef129d79f59","schema_version":"1.0","event_id":"sha256:9bea5b1519f2eb3db13aaddb37ada6fe227d0444444d422c4a41cef129d79f59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZKXTSNFJPROEYULSQ2ZVMUFSZQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Low-Complexity Improved Successive Cancellation Decoder for Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexios Balatsoukas-Stimming, Andreas Burg, Orion Afisiadis","submitted_at":"2014-12-17T17:48:18Z","abstract_excerpt":"Under successive cancellation (SC) decoding, polar codes are inferior to other codes of similar blocklength in terms of frame error rate. While more sophisticated decoding algorithms such as list- or stack-decoding partially mitigate this performance loss, they suffer from an increase in complexity. In this paper, we describe a new flavor of the SC decoder, called the SC flip decoder. Our algorithm preserves the low memory requirements of the basic SC decoder and adjusts the required decoding effort to the signal quality. In the waterfall region, its average computational complexity is almost "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5501","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-18T02:31:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"STVyNSIfQynyXWPNozQdVE56JP7WFWs+cI/OtEBEcWZLkAQ7wu/RD03AUXfP6XZEPLk1C6r56d1n8vU821o6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:46:43.826144Z"},"content_sha256":"9d8e0696f111379f266cbaa7c25b0bde172bc5852938b2a4d1271c2dbb1c076c","schema_version":"1.0","event_id":"sha256:9d8e0696f111379f266cbaa7c25b0bde172bc5852938b2a4d1271c2dbb1c076c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZKXTSNFJPROEYULSQ2ZVMUFSZQ/bundle.json","state_url":"https://pith.science/pith/ZKXTSNFJPROEYULSQ2ZVMUFSZQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZKXTSNFJPROEYULSQ2ZVMUFSZQ/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-27T06:46:43Z","links":{"resolver":"https://pith.science/pith/ZKXTSNFJPROEYULSQ2ZVMUFSZQ","bundle":"https://pith.science/pith/ZKXTSNFJPROEYULSQ2ZVMUFSZQ/bundle.json","state":"https://pith.science/pith/ZKXTSNFJPROEYULSQ2ZVMUFSZQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZKXTSNFJPROEYULSQ2ZVMUFSZQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZKXTSNFJPROEYULSQ2ZVMUFSZQ","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":"94d1dc97bec1e708a61534fee8f705c255626b4555e0c8a289f7bc07fd818e92","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-17T17:48:18Z","title_canon_sha256":"fcc799468d4650e488d39c31575a1ab5167e5937db917868bf8dfa13763ecbcb"},"schema_version":"1.0","source":{"id":"1412.5501","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5501","created_at":"2026-05-18T02:31:02Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5501v1","created_at":"2026-05-18T02:31:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5501","created_at":"2026-05-18T02:31:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZKXTSNFJPROE","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZKXTSNFJPROEYULS","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZKXTSNFJ","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:9d8e0696f111379f266cbaa7c25b0bde172bc5852938b2a4d1271c2dbb1c076c","target":"graph","created_at":"2026-05-18T02:31:02Z","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":"Under successive cancellation (SC) decoding, polar codes are inferior to other codes of similar blocklength in terms of frame error rate. While more sophisticated decoding algorithms such as list- or stack-decoding partially mitigate this performance loss, they suffer from an increase in complexity. In this paper, we describe a new flavor of the SC decoder, called the SC flip decoder. Our algorithm preserves the low memory requirements of the basic SC decoder and adjusts the required decoding effort to the signal quality. In the waterfall region, its average computational complexity is almost ","authors_text":"Alexios Balatsoukas-Stimming, Andreas Burg, Orion Afisiadis","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-17T17:48:18Z","title":"A Low-Complexity Improved Successive Cancellation Decoder for Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5501","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:9bea5b1519f2eb3db13aaddb37ada6fe227d0444444d422c4a41cef129d79f59","target":"record","created_at":"2026-05-18T02:31:02Z","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":"94d1dc97bec1e708a61534fee8f705c255626b4555e0c8a289f7bc07fd818e92","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-17T17:48:18Z","title_canon_sha256":"fcc799468d4650e488d39c31575a1ab5167e5937db917868bf8dfa13763ecbcb"},"schema_version":"1.0","source":{"id":"1412.5501","kind":"arxiv","version":1}},"canonical_sha256":"caaf3934a97c5c4c517286b35650b2cc17a33b6df3ec99f3b4c36b301f2f15af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"caaf3934a97c5c4c517286b35650b2cc17a33b6df3ec99f3b4c36b301f2f15af","first_computed_at":"2026-05-18T02:31:02.850959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:02.850959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+2VIZ40RdlXEFFTmhSyj8+tn8psKRVDro3mAJNTIWOVnpJAq6M+lVcZczPHkpSHtO+a6Gw+DdU6AM9BHcWJlBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:02.851433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.5501","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bea5b1519f2eb3db13aaddb37ada6fe227d0444444d422c4a41cef129d79f59","sha256:9d8e0696f111379f266cbaa7c25b0bde172bc5852938b2a4d1271c2dbb1c076c"],"state_sha256":"13913ee4daa548e8fe6be0b7989152051b967485dcc743a70b428823651c53bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M/oEsIef5mZbys+pNDu2CTwqS5HIE1DpfVCw6bpKA45ZmOYxxgmg3grdeiAkkTtSuqqZF/+P7sCalp4H80boDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:46:43.828539Z","bundle_sha256":"4d4ab3ac8c0840a2ed64cd56ebb02629f891b0bf6731577bd32f88cab764ff99"}}