{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NFJYC2ETN5WXFMRUUSBN3WYD3Z","short_pith_number":"pith:NFJYC2ET","schema_version":"1.0","canonical_sha256":"69538168936f6d72b234a482dddb03de55322a250c61d527ea473d9e17ab0bf1","source":{"kind":"arxiv","id":"1307.2352","version":2},"attestation_state":"computed","paper":{"title":"Polar Codes with Dynamic Frozen Symbols and Their Decoding by Directed Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Peter Trifonov, Vera Miloslavskaya","submitted_at":"2013-07-09T07:19:30Z","abstract_excerpt":"A novel construction of polar codes with dynamic frozen symbols is proposed. The proposed codes are subcodes of extended BCH codes, which ensure sufficiently high minimum distance. Furthermore, a decoding algorithm is proposed, which employs estimates of the not-yet-processed bit channel error probabilities to perform directed search in code tree, reducing thus the total number of iterations."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1307.2352","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-09T07:19:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9c23b3e78a8bc208f70b2a04ca4498f38195fa84dbac4bfbf5e3c96447fac5e5","abstract_canon_sha256":"4a3ec0908092fdb204c897f9a427765a31816b6d333fd81768cb5c55bebc9d0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:41.944563Z","signature_b64":"7ezla+X/Cu3ZpsMIMnqejPxT55t3awPnYQ8tUuBabwHMlqTXaMMCVyas007XrKv2hmq8zFLyFQdn2Xv8rjBdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69538168936f6d72b234a482dddb03de55322a250c61d527ea473d9e17ab0bf1","last_reissued_at":"2026-05-18T03:18:41.943737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:41.943737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polar Codes with Dynamic Frozen Symbols and Their Decoding by Directed Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Peter Trifonov, Vera Miloslavskaya","submitted_at":"2013-07-09T07:19:30Z","abstract_excerpt":"A novel construction of polar codes with dynamic frozen symbols is proposed. The proposed codes are subcodes of extended BCH codes, which ensure sufficiently high minimum distance. Furthermore, a decoding algorithm is proposed, which employs estimates of the not-yet-processed bit channel error probabilities to perform directed search in code tree, reducing thus the total number of iterations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2352","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.2352","created_at":"2026-05-18T03:18:41.943902+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2352v2","created_at":"2026-05-18T03:18:41.943902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2352","created_at":"2026-05-18T03:18:41.943902+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFJYC2ETN5WX","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFJYC2ETN5WXFMRU","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFJYC2ET","created_at":"2026-05-18T12:27:52.871228+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NFJYC2ETN5WXFMRUUSBN3WYD3Z","json":"https://pith.science/pith/NFJYC2ETN5WXFMRUUSBN3WYD3Z.json","graph_json":"https://pith.science/api/pith-number/NFJYC2ETN5WXFMRUUSBN3WYD3Z/graph.json","events_json":"https://pith.science/api/pith-number/NFJYC2ETN5WXFMRUUSBN3WYD3Z/events.json","paper":"https://pith.science/paper/NFJYC2ET"},"agent_actions":{"view_html":"https://pith.science/pith/NFJYC2ETN5WXFMRUUSBN3WYD3Z","download_json":"https://pith.science/pith/NFJYC2ETN5WXFMRUUSBN3WYD3Z.json","view_paper":"https://pith.science/paper/NFJYC2ET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2352&json=true","fetch_graph":"https://pith.science/api/pith-number/NFJYC2ETN5WXFMRUUSBN3WYD3Z/graph.json","fetch_events":"https://pith.science/api/pith-number/NFJYC2ETN5WXFMRUUSBN3WYD3Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFJYC2ETN5WXFMRUUSBN3WYD3Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFJYC2ETN5WXFMRUUSBN3WYD3Z/action/storage_attestation","attest_author":"https://pith.science/pith/NFJYC2ETN5WXFMRUUSBN3WYD3Z/action/author_attestation","sign_citation":"https://pith.science/pith/NFJYC2ETN5WXFMRUUSBN3WYD3Z/action/citation_signature","submit_replication":"https://pith.science/pith/NFJYC2ETN5WXFMRUUSBN3WYD3Z/action/replication_record"}},"created_at":"2026-05-18T03:18:41.943902+00:00","updated_at":"2026-05-18T03:18:41.943902+00:00"}