{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TD6ZTFDCEBODSFS5MXFMNQNHA3","short_pith_number":"pith:TD6ZTFDC","canonical_record":{"source":{"id":"1501.02473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-11T17:20:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"357d4bebe9548a8841442736ad43eba560d1b17b0d0dd059b3683e44559ca2ec","abstract_canon_sha256":"fc1b5363de839ae37e79a22bd8271bc46670c0393cf39cf361e17cea4f02ef76"},"schema_version":"1.0"},"canonical_sha256":"98fd999462205c39165d65cac6c1a706c6d4e26ecf8282dd0cbbd24e66033661","source":{"kind":"arxiv","id":"1501.02473","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02473","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02473v1","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02473","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"TD6ZTFDCEBOD","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TD6ZTFDCEBODSFS5","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TD6ZTFDC","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TD6ZTFDCEBODSFS5MXFMNQNHA3","target":"record","payload":{"canonical_record":{"source":{"id":"1501.02473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-11T17:20:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"357d4bebe9548a8841442736ad43eba560d1b17b0d0dd059b3683e44559ca2ec","abstract_canon_sha256":"fc1b5363de839ae37e79a22bd8271bc46670c0393cf39cf361e17cea4f02ef76"},"schema_version":"1.0"},"canonical_sha256":"98fd999462205c39165d65cac6c1a706c6d4e26ecf8282dd0cbbd24e66033661","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:37.890384Z","signature_b64":"892M1SLlatH6xOhXRF8igOY07QHZvf3EttIxFFMmwW9eY1z0TYMUs4sOwgdBh6DCXuB9NrQo/j7uv3cyYHByAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98fd999462205c39165d65cac6c1a706c6d4e26ecf8282dd0cbbd24e66033661","last_reissued_at":"2026-05-18T02:29:37.890006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:37.890006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.02473","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:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O4YzNw5eeUB1R1qmDepIZIr2qntUDAuEWBnoP3niNXBMlPLx5OpDT0bJ0an8ro1oKdPKXYeiXVZbnfi2lSH3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:55:19.829519Z"},"content_sha256":"6d53f0d48df7f77172fde5dc315f7da1277e8156a3816ee573c47cb12ca8cf8f","schema_version":"1.0","event_id":"sha256:6d53f0d48df7f77172fde5dc315f7da1277e8156a3816ee573c47cb12ca8cf8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TD6ZTFDCEBODSFS5MXFMNQNHA3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Comparative Study of Polar Code Constructions for the AWGN Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emanuele Viterbo, Harish Vangala, Yi Hong","submitted_at":"2015-01-11T17:20:48Z","abstract_excerpt":"We present a comparative study of the performance of various polar code constructions in an additive white Gaussian noise (AWGN) channel. A polar code construction is any algorithm that selects $K$ best among $N$ possible polar bit-channels at the design signal-to-noise-ratio (design-SNR) in terms of bit error rate (BER). Optimal polar code construction is hard and therefore many suboptimal polar code constructions have been proposed at different computational complexities. Polar codes are also non-universal meaning the code changes significantly with the design-SNR. However, it is not known w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02473","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:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2FZRnpNDI6FjhNBEoqJLF75OpuKszRulEUWTJw/lVg5ash1RFUYiKUn0lruUaPonNUL0LMevopIUrqs/PudFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:55:19.830140Z"},"content_sha256":"f23b2d503f1bb0cf4be421f1c9cf1654e92d11bc89eb5814cc9d158910fb89b3","schema_version":"1.0","event_id":"sha256:f23b2d503f1bb0cf4be421f1c9cf1654e92d11bc89eb5814cc9d158910fb89b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TD6ZTFDCEBODSFS5MXFMNQNHA3/bundle.json","state_url":"https://pith.science/pith/TD6ZTFDCEBODSFS5MXFMNQNHA3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TD6ZTFDCEBODSFS5MXFMNQNHA3/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-26T13:55:19Z","links":{"resolver":"https://pith.science/pith/TD6ZTFDCEBODSFS5MXFMNQNHA3","bundle":"https://pith.science/pith/TD6ZTFDCEBODSFS5MXFMNQNHA3/bundle.json","state":"https://pith.science/pith/TD6ZTFDCEBODSFS5MXFMNQNHA3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TD6ZTFDCEBODSFS5MXFMNQNHA3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TD6ZTFDCEBODSFS5MXFMNQNHA3","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":"fc1b5363de839ae37e79a22bd8271bc46670c0393cf39cf361e17cea4f02ef76","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-11T17:20:48Z","title_canon_sha256":"357d4bebe9548a8841442736ad43eba560d1b17b0d0dd059b3683e44559ca2ec"},"schema_version":"1.0","source":{"id":"1501.02473","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02473","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02473v1","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02473","created_at":"2026-05-18T02:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"TD6ZTFDCEBOD","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TD6ZTFDCEBODSFS5","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TD6ZTFDC","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:f23b2d503f1bb0cf4be421f1c9cf1654e92d11bc89eb5814cc9d158910fb89b3","target":"graph","created_at":"2026-05-18T02:29:37Z","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":"We present a comparative study of the performance of various polar code constructions in an additive white Gaussian noise (AWGN) channel. A polar code construction is any algorithm that selects $K$ best among $N$ possible polar bit-channels at the design signal-to-noise-ratio (design-SNR) in terms of bit error rate (BER). Optimal polar code construction is hard and therefore many suboptimal polar code constructions have been proposed at different computational complexities. Polar codes are also non-universal meaning the code changes significantly with the design-SNR. However, it is not known w","authors_text":"Emanuele Viterbo, Harish Vangala, Yi Hong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-11T17:20:48Z","title":"A Comparative Study of Polar Code Constructions for the AWGN Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02473","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:6d53f0d48df7f77172fde5dc315f7da1277e8156a3816ee573c47cb12ca8cf8f","target":"record","created_at":"2026-05-18T02:29:37Z","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":"fc1b5363de839ae37e79a22bd8271bc46670c0393cf39cf361e17cea4f02ef76","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-11T17:20:48Z","title_canon_sha256":"357d4bebe9548a8841442736ad43eba560d1b17b0d0dd059b3683e44559ca2ec"},"schema_version":"1.0","source":{"id":"1501.02473","kind":"arxiv","version":1}},"canonical_sha256":"98fd999462205c39165d65cac6c1a706c6d4e26ecf8282dd0cbbd24e66033661","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98fd999462205c39165d65cac6c1a706c6d4e26ecf8282dd0cbbd24e66033661","first_computed_at":"2026-05-18T02:29:37.890006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:37.890006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"892M1SLlatH6xOhXRF8igOY07QHZvf3EttIxFFMmwW9eY1z0TYMUs4sOwgdBh6DCXuB9NrQo/j7uv3cyYHByAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:37.890384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.02473","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d53f0d48df7f77172fde5dc315f7da1277e8156a3816ee573c47cb12ca8cf8f","sha256:f23b2d503f1bb0cf4be421f1c9cf1654e92d11bc89eb5814cc9d158910fb89b3"],"state_sha256":"5f86f369c5b8bfcbc17f9329a45d7ceb9f95656520b50e91080f4fd33e6f1cd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eeQkiZrPMehzJuLj735PsbTjEWAZLb5fLGWtp34JNj0knyQI+cv5xb9vgAcbA7TfC4q9l/758gxRvLOwo7g0Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:55:19.833491Z","bundle_sha256":"6a2857211ab31544f7cf7b3e39262f06b77991d05aeadbad72d2f7adddf2272b"}}