{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:M6ZNB3XOQSYGQTCF44MEJJCCT3","short_pith_number":"pith:M6ZNB3XO","canonical_record":{"source":{"id":"1209.4444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-20T08:03:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b07cb0400143cdca6ca6576009fc32565b41bcff54a3a2efda0ea3594c2103e0","abstract_canon_sha256":"7f8f4347dcc6a0958c93f728027d726fb7cc81e9e9323e4583216799e8f5bcd7"},"schema_version":"1.0"},"canonical_sha256":"67b2d0eeee84b0684c45e71844a4429efbb4d57784161a5f1230ed727793fe62","source":{"kind":"arxiv","id":"1209.4444","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4444","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4444v1","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4444","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"pith_short_12","alias_value":"M6ZNB3XOQSYG","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"M6ZNB3XOQSYGQTCF","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"M6ZNB3XO","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:M6ZNB3XOQSYGQTCF44MEJJCCT3","target":"record","payload":{"canonical_record":{"source":{"id":"1209.4444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-20T08:03:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b07cb0400143cdca6ca6576009fc32565b41bcff54a3a2efda0ea3594c2103e0","abstract_canon_sha256":"7f8f4347dcc6a0958c93f728027d726fb7cc81e9e9323e4583216799e8f5bcd7"},"schema_version":"1.0"},"canonical_sha256":"67b2d0eeee84b0684c45e71844a4429efbb4d57784161a5f1230ed727793fe62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:11.711079Z","signature_b64":"8uTUHdsyveamSOn4KH040CdSov2A/xgwyAIehv50avGy1DCqCmZKyKlJGpG72QT79lutxRJbwdUH9wMHJXBKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67b2d0eeee84b0684c45e71844a4429efbb4d57784161a5f1230ed727793fe62","last_reissued_at":"2026-05-18T03:45:11.710596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:11.710596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.4444","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-18T03:45:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FcF2RuSNe3dHUIe2j2y7DtDS0XqsnJX/++g/hO/2pQHydtQBEpca/NPsRkHTtUvxuvgOEBmr6QAaswNUsvkPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:00:00.266171Z"},"content_sha256":"c9fc3783e1b931d94929f04f4a3a29cd9a3489bb9e5725940eb63bb44dbc7ee1","schema_version":"1.0","event_id":"sha256:c9fc3783e1b931d94929f04f4a3a29cd9a3489bb9e5725940eb63bb44dbc7ee1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:M6ZNB3XOQSYGQTCF44MEJJCCT3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Construction of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emre Telatar, Ido Tal, Ramtin Pedarsani, S. Hamed Hassani","submitted_at":"2012-09-20T08:03:20Z","abstract_excerpt":"We consider the problem of efficiently constructing polar codes over binary memoryless symmetric (BMS) channels. The complexity of designing polar codes via an exact evaluation of the polarized channels to find which ones are \"good\" appears to be exponential in the block length. In \\cite{TV11}, Tal and Vardy show that if instead the evaluation if performed approximately, the construction has only linear complexity. In this paper, we follow this approach and present a framework where the algorithms of \\cite{TV11} and new related algorithms can be analyzed for complexity and accuracy. We provide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4444","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-18T03:45:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Y3cNLfAa8bUj3LjeaPpun0AGOQjxKBBWq+mzHfwGlSzBFUNJCu1aehH7tryvFHePSwZk1YgRGHks4BQ8DaiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:00:00.266647Z"},"content_sha256":"28b935e3af2a28b64ce01b785f2e5c0f09ca4fafe03f427c459504acf9848a0a","schema_version":"1.0","event_id":"sha256:28b935e3af2a28b64ce01b785f2e5c0f09ca4fafe03f427c459504acf9848a0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6ZNB3XOQSYGQTCF44MEJJCCT3/bundle.json","state_url":"https://pith.science/pith/M6ZNB3XOQSYGQTCF44MEJJCCT3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6ZNB3XOQSYGQTCF44MEJJCCT3/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-22T00:00:00Z","links":{"resolver":"https://pith.science/pith/M6ZNB3XOQSYGQTCF44MEJJCCT3","bundle":"https://pith.science/pith/M6ZNB3XOQSYGQTCF44MEJJCCT3/bundle.json","state":"https://pith.science/pith/M6ZNB3XOQSYGQTCF44MEJJCCT3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6ZNB3XOQSYGQTCF44MEJJCCT3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:M6ZNB3XOQSYGQTCF44MEJJCCT3","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":"7f8f4347dcc6a0958c93f728027d726fb7cc81e9e9323e4583216799e8f5bcd7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-20T08:03:20Z","title_canon_sha256":"b07cb0400143cdca6ca6576009fc32565b41bcff54a3a2efda0ea3594c2103e0"},"schema_version":"1.0","source":{"id":"1209.4444","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4444","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4444v1","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4444","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"pith_short_12","alias_value":"M6ZNB3XOQSYG","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"M6ZNB3XOQSYGQTCF","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"M6ZNB3XO","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:28b935e3af2a28b64ce01b785f2e5c0f09ca4fafe03f427c459504acf9848a0a","target":"graph","created_at":"2026-05-18T03:45:11Z","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 consider the problem of efficiently constructing polar codes over binary memoryless symmetric (BMS) channels. The complexity of designing polar codes via an exact evaluation of the polarized channels to find which ones are \"good\" appears to be exponential in the block length. In \\cite{TV11}, Tal and Vardy show that if instead the evaluation if performed approximately, the construction has only linear complexity. In this paper, we follow this approach and present a framework where the algorithms of \\cite{TV11} and new related algorithms can be analyzed for complexity and accuracy. We provide","authors_text":"Emre Telatar, Ido Tal, Ramtin Pedarsani, S. Hamed Hassani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-20T08:03:20Z","title":"On the Construction of Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4444","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:c9fc3783e1b931d94929f04f4a3a29cd9a3489bb9e5725940eb63bb44dbc7ee1","target":"record","created_at":"2026-05-18T03:45:11Z","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":"7f8f4347dcc6a0958c93f728027d726fb7cc81e9e9323e4583216799e8f5bcd7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-20T08:03:20Z","title_canon_sha256":"b07cb0400143cdca6ca6576009fc32565b41bcff54a3a2efda0ea3594c2103e0"},"schema_version":"1.0","source":{"id":"1209.4444","kind":"arxiv","version":1}},"canonical_sha256":"67b2d0eeee84b0684c45e71844a4429efbb4d57784161a5f1230ed727793fe62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67b2d0eeee84b0684c45e71844a4429efbb4d57784161a5f1230ed727793fe62","first_computed_at":"2026-05-18T03:45:11.710596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:11.710596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8uTUHdsyveamSOn4KH040CdSov2A/xgwyAIehv50avGy1DCqCmZKyKlJGpG72QT79lutxRJbwdUH9wMHJXBKCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:11.711079Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.4444","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9fc3783e1b931d94929f04f4a3a29cd9a3489bb9e5725940eb63bb44dbc7ee1","sha256:28b935e3af2a28b64ce01b785f2e5c0f09ca4fafe03f427c459504acf9848a0a"],"state_sha256":"8383b8395508cd4ac4b8d15c0d574905684b6d8e9a82046f4611616f59a01750"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wosLZ2K3TAQznlryvSA5qk4ENVceRDy+zE4gCVDteL+BLmoYy5gKgS2rpkwlFKEIQyaVFzsBgnk5VTdIAjjCCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T00:00:00.269028Z","bundle_sha256":"1899aaacfa6965368660f50d3e9b55986ff31231f031babdba33c780192a9301"}}