{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:H3BEQDLHHZQKYJVALN73OJFLEP","short_pith_number":"pith:H3BEQDLH","canonical_record":{"source":{"id":"1207.4343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-18T11:17:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2f50bda98c39e7e74ee7ccc582598fb6b8484f9622c3c64327b9ac3420a2e2e3","abstract_canon_sha256":"e8568989bb664ac5e82323541d84a525697f46e1032339f736dbbb31c774ac4b"},"schema_version":"1.0"},"canonical_sha256":"3ec2480d673e60ac26a05b7fb724ab23c8f5254cf4dc677ed6d15c5bc1e1db85","source":{"kind":"arxiv","id":"1207.4343","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4343","created_at":"2026-05-18T03:50:46Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4343v1","created_at":"2026-05-18T03:50:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4343","created_at":"2026-05-18T03:50:46Z"},{"alias_kind":"pith_short_12","alias_value":"H3BEQDLHHZQK","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"H3BEQDLHHZQKYJVA","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"H3BEQDLH","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:H3BEQDLHHZQKYJVALN73OJFLEP","target":"record","payload":{"canonical_record":{"source":{"id":"1207.4343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-18T11:17:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2f50bda98c39e7e74ee7ccc582598fb6b8484f9622c3c64327b9ac3420a2e2e3","abstract_canon_sha256":"e8568989bb664ac5e82323541d84a525697f46e1032339f736dbbb31c774ac4b"},"schema_version":"1.0"},"canonical_sha256":"3ec2480d673e60ac26a05b7fb724ab23c8f5254cf4dc677ed6d15c5bc1e1db85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:46.953984Z","signature_b64":"Nvn8/qOv+GjJanP5oqq+GCQCtRnaAx4izPNmhUXOkdKCOrPB0u4tYFlUweD3KSznL8OIgJZqu1+jJmy1hwruCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ec2480d673e60ac26a05b7fb724ab23c8f5254cf4dc677ed6d15c5bc1e1db85","last_reissued_at":"2026-05-18T03:50:46.953390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:46.953390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.4343","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:50:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zGIGs8ewEIUB0dA46PZOYo0CBA3KQovg0oJoD9aqRGpPOlWCFmeJZl8Vxhdrj/iMAQu/pH14D+KIlaxtRdoaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:03:07.247123Z"},"content_sha256":"0df63e372d737eb7916ee45909d5ddecb6b491097902bfb118ccc8b4cf7e6d26","schema_version":"1.0","event_id":"sha256:0df63e372d737eb7916ee45909d5ddecb6b491097902bfb118ccc8b4cf7e6d26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:H3BEQDLHHZQKYJVALN73OJFLEP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction and analysis of polar and concatenated polar codes: practical approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gregory Bonik, Nickolai Zamarashkin, Sergei Goreinov","submitted_at":"2012-07-18T11:17:39Z","abstract_excerpt":"We consider two problems related to polar codes. First is the problem of polar codes construction and analysis of their performance without Monte-Carlo method. The formulas proposed are the same as those in [Mori-Tanaka], yet we believe that our approach is original and has clear advantages. The resulting computational procedure is presented in a fast algorithm form which can be easily implemented on a computer. Secondly, we present an original method of construction of concatenated codes based on polar codes. We give an algorithm for construction of such codes and present numerical experiment"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4343","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:50:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P7P0CPYd2m2PQH4yT3HX8gBT4QLZzA6zZzo972UzeKh6+J05HF+UFge5tYips6mLn2OV3VcTs2sKjZfbowwRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:03:07.247483Z"},"content_sha256":"8ba48028c728220b4e880c154182c0b2c22ea9378f9cf24ce67bffe3fe006c5a","schema_version":"1.0","event_id":"sha256:8ba48028c728220b4e880c154182c0b2c22ea9378f9cf24ce67bffe3fe006c5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H3BEQDLHHZQKYJVALN73OJFLEP/bundle.json","state_url":"https://pith.science/pith/H3BEQDLHHZQKYJVALN73OJFLEP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H3BEQDLHHZQKYJVALN73OJFLEP/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-21T21:03:07Z","links":{"resolver":"https://pith.science/pith/H3BEQDLHHZQKYJVALN73OJFLEP","bundle":"https://pith.science/pith/H3BEQDLHHZQKYJVALN73OJFLEP/bundle.json","state":"https://pith.science/pith/H3BEQDLHHZQKYJVALN73OJFLEP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H3BEQDLHHZQKYJVALN73OJFLEP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:H3BEQDLHHZQKYJVALN73OJFLEP","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":"e8568989bb664ac5e82323541d84a525697f46e1032339f736dbbb31c774ac4b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-18T11:17:39Z","title_canon_sha256":"2f50bda98c39e7e74ee7ccc582598fb6b8484f9622c3c64327b9ac3420a2e2e3"},"schema_version":"1.0","source":{"id":"1207.4343","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.4343","created_at":"2026-05-18T03:50:46Z"},{"alias_kind":"arxiv_version","alias_value":"1207.4343v1","created_at":"2026-05-18T03:50:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4343","created_at":"2026-05-18T03:50:46Z"},{"alias_kind":"pith_short_12","alias_value":"H3BEQDLHHZQK","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"H3BEQDLHHZQKYJVA","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"H3BEQDLH","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:8ba48028c728220b4e880c154182c0b2c22ea9378f9cf24ce67bffe3fe006c5a","target":"graph","created_at":"2026-05-18T03:50:46Z","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 two problems related to polar codes. First is the problem of polar codes construction and analysis of their performance without Monte-Carlo method. The formulas proposed are the same as those in [Mori-Tanaka], yet we believe that our approach is original and has clear advantages. The resulting computational procedure is presented in a fast algorithm form which can be easily implemented on a computer. Secondly, we present an original method of construction of concatenated codes based on polar codes. We give an algorithm for construction of such codes and present numerical experiment","authors_text":"Gregory Bonik, Nickolai Zamarashkin, Sergei Goreinov","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-18T11:17:39Z","title":"Construction and analysis of polar and concatenated polar codes: practical approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4343","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:0df63e372d737eb7916ee45909d5ddecb6b491097902bfb118ccc8b4cf7e6d26","target":"record","created_at":"2026-05-18T03:50:46Z","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":"e8568989bb664ac5e82323541d84a525697f46e1032339f736dbbb31c774ac4b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-18T11:17:39Z","title_canon_sha256":"2f50bda98c39e7e74ee7ccc582598fb6b8484f9622c3c64327b9ac3420a2e2e3"},"schema_version":"1.0","source":{"id":"1207.4343","kind":"arxiv","version":1}},"canonical_sha256":"3ec2480d673e60ac26a05b7fb724ab23c8f5254cf4dc677ed6d15c5bc1e1db85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ec2480d673e60ac26a05b7fb724ab23c8f5254cf4dc677ed6d15c5bc1e1db85","first_computed_at":"2026-05-18T03:50:46.953390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:46.953390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nvn8/qOv+GjJanP5oqq+GCQCtRnaAx4izPNmhUXOkdKCOrPB0u4tYFlUweD3KSznL8OIgJZqu1+jJmy1hwruCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:46.953984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.4343","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0df63e372d737eb7916ee45909d5ddecb6b491097902bfb118ccc8b4cf7e6d26","sha256:8ba48028c728220b4e880c154182c0b2c22ea9378f9cf24ce67bffe3fe006c5a"],"state_sha256":"786eb1af5a58e8bc65029325911dd53bdc00b793fa336afd7c7df60c13c09a93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Km736cV0atajeSi2VNhJ+t44Vs6XZMFtfnWlwf5UAwftRv8L/msPWZwZG+Ec2XwKxnUx8enk+dneRTkIOdnuAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T21:03:07.249524Z","bundle_sha256":"e8bbae7329e42def625e0904fa7eda0e8f39952f600ced717a4abfce02dd4e4d"}}