{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:F6W6ZTNIMBEGPF4J2UYK2WMQZP","short_pith_number":"pith:F6W6ZTNI","canonical_record":{"source":{"id":"1501.06091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-24T22:51:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2a6b26ed48f2f6ac124a15c2a44517a4741b5013c0374acae95a35911e9f9546","abstract_canon_sha256":"5d4a38cc2904c6ec94b17896ec1b3d1576f892f6e3eb8d6d904eee8aacbb0d0a"},"schema_version":"1.0"},"canonical_sha256":"2fadeccda86048679789d530ad5990cbfce072c725d3ed6c978eb1b587e94929","source":{"kind":"arxiv","id":"1501.06091","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06091","created_at":"2026-05-18T00:49:52Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06091v2","created_at":"2026-05-18T00:49:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06091","created_at":"2026-05-18T00:49:52Z"},{"alias_kind":"pith_short_12","alias_value":"F6W6ZTNIMBEG","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"F6W6ZTNIMBEGPF4J","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"F6W6ZTNI","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:F6W6ZTNIMBEGPF4J2UYK2WMQZP","target":"record","payload":{"canonical_record":{"source":{"id":"1501.06091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-24T22:51:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2a6b26ed48f2f6ac124a15c2a44517a4741b5013c0374acae95a35911e9f9546","abstract_canon_sha256":"5d4a38cc2904c6ec94b17896ec1b3d1576f892f6e3eb8d6d904eee8aacbb0d0a"},"schema_version":"1.0"},"canonical_sha256":"2fadeccda86048679789d530ad5990cbfce072c725d3ed6c978eb1b587e94929","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:52.745549Z","signature_b64":"6a4pPedcVQHsCWW5WuRiLa6QsS7Gu3C+7Z/AupvlC2oF4gNSPqplJ4smIoy+BOQnYJUxVuR58D1jA4aahxNrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fadeccda86048679789d530ad5990cbfce072c725d3ed6c978eb1b587e94929","last_reissued_at":"2026-05-18T00:49:52.745025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:52.745025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.06091","source_version":2,"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:49:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3dzJIRx1TNysB3bWcHQOwrtrFPrjAtrsLcfC7qVs+CAv1s47LGkRoTs+3/HOA9Wwu3A/vjOslAnhQdC5fJmVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:31:00.615394Z"},"content_sha256":"3bb7fd70a80d960facbb24762e634320c908b7b27a551d7deaeac3c09086d3da","schema_version":"1.0","event_id":"sha256:3bb7fd70a80d960facbb24762e634320c908b7b27a551d7deaeac3c09086d3da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:F6W6ZTNIMBEGPF4J2UYK2WMQZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relaxed Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gennady Feygin, Hessam Mahdavifar, Inyup Kang, Jungwon Lee, Mostafa El-Khamy","submitted_at":"2015-01-24T22:51:54Z","abstract_excerpt":"Polar codes are the latest breakthrough in coding theory, as they are the first family of codes with explicit construction that provably achieve the symmetric capacity of discrete memoryless channels. Ar{\\i}kan's polar encoder and successive cancellation decoder have complexities of $N \\log N$, for code length $N$. Although, the complexity bound of $N \\log N$ is asymptotically favorable, we report in this work methods to further reduce the encoding and decoding complexities of polar coding. The crux is to relax the polarization of certain bit-channels without performance degradation. We consid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06091","kind":"arxiv","version":2},"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:49:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UKbyRDW64vYzKuDO02z0aMxelmKyunK4NiDyLXV7uPtWWxgDuBQI3Hsp0iDFvC6A1ZGY6HXjSW8IYptA10yKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:31:00.616046Z"},"content_sha256":"8c0f1791735fe8ed6f525fa753129e021768207e460ba4431a46b453650ce09d","schema_version":"1.0","event_id":"sha256:8c0f1791735fe8ed6f525fa753129e021768207e460ba4431a46b453650ce09d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F6W6ZTNIMBEGPF4J2UYK2WMQZP/bundle.json","state_url":"https://pith.science/pith/F6W6ZTNIMBEGPF4J2UYK2WMQZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F6W6ZTNIMBEGPF4J2UYK2WMQZP/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-06-02T06:31:00Z","links":{"resolver":"https://pith.science/pith/F6W6ZTNIMBEGPF4J2UYK2WMQZP","bundle":"https://pith.science/pith/F6W6ZTNIMBEGPF4J2UYK2WMQZP/bundle.json","state":"https://pith.science/pith/F6W6ZTNIMBEGPF4J2UYK2WMQZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F6W6ZTNIMBEGPF4J2UYK2WMQZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:F6W6ZTNIMBEGPF4J2UYK2WMQZP","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":"5d4a38cc2904c6ec94b17896ec1b3d1576f892f6e3eb8d6d904eee8aacbb0d0a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-24T22:51:54Z","title_canon_sha256":"2a6b26ed48f2f6ac124a15c2a44517a4741b5013c0374acae95a35911e9f9546"},"schema_version":"1.0","source":{"id":"1501.06091","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06091","created_at":"2026-05-18T00:49:52Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06091v2","created_at":"2026-05-18T00:49:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06091","created_at":"2026-05-18T00:49:52Z"},{"alias_kind":"pith_short_12","alias_value":"F6W6ZTNIMBEG","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"F6W6ZTNIMBEGPF4J","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"F6W6ZTNI","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:8c0f1791735fe8ed6f525fa753129e021768207e460ba4431a46b453650ce09d","target":"graph","created_at":"2026-05-18T00:49:52Z","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":"Polar codes are the latest breakthrough in coding theory, as they are the first family of codes with explicit construction that provably achieve the symmetric capacity of discrete memoryless channels. Ar{\\i}kan's polar encoder and successive cancellation decoder have complexities of $N \\log N$, for code length $N$. Although, the complexity bound of $N \\log N$ is asymptotically favorable, we report in this work methods to further reduce the encoding and decoding complexities of polar coding. The crux is to relax the polarization of certain bit-channels without performance degradation. We consid","authors_text":"Gennady Feygin, Hessam Mahdavifar, Inyup Kang, Jungwon Lee, Mostafa El-Khamy","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-24T22:51:54Z","title":"Relaxed Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06091","kind":"arxiv","version":2},"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:3bb7fd70a80d960facbb24762e634320c908b7b27a551d7deaeac3c09086d3da","target":"record","created_at":"2026-05-18T00:49:52Z","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":"5d4a38cc2904c6ec94b17896ec1b3d1576f892f6e3eb8d6d904eee8aacbb0d0a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-24T22:51:54Z","title_canon_sha256":"2a6b26ed48f2f6ac124a15c2a44517a4741b5013c0374acae95a35911e9f9546"},"schema_version":"1.0","source":{"id":"1501.06091","kind":"arxiv","version":2}},"canonical_sha256":"2fadeccda86048679789d530ad5990cbfce072c725d3ed6c978eb1b587e94929","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fadeccda86048679789d530ad5990cbfce072c725d3ed6c978eb1b587e94929","first_computed_at":"2026-05-18T00:49:52.745025Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:52.745025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6a4pPedcVQHsCWW5WuRiLa6QsS7Gu3C+7Z/AupvlC2oF4gNSPqplJ4smIoy+BOQnYJUxVuR58D1jA4aahxNrAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:52.745549Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.06091","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bb7fd70a80d960facbb24762e634320c908b7b27a551d7deaeac3c09086d3da","sha256:8c0f1791735fe8ed6f525fa753129e021768207e460ba4431a46b453650ce09d"],"state_sha256":"0718e3e497e845e1d7cea40e5700019b131a41e63b340a4300b632633fd1b325"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t60w9EYGx6Rw19+A8ld1kKvo1Y8qgQk6uA72/crhA2iy6ihISl2Aoto0OUItyiFaJPpmULotuQ9gj9xTTvI5Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:31:00.619152Z","bundle_sha256":"59553f7db23552f1e8b36a79974eeaeb4d0e21a3351bbddcb0da9c53cc3515ac"}}