{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WV6ECNH3NSCQUOEG2GKVQGK73A","short_pith_number":"pith:WV6ECNH3","schema_version":"1.0","canonical_sha256":"b57c4134fb6c850a3886d19558195fd80a8fd89d1d558d7e5cd9f64ea472cfb5","source":{"kind":"arxiv","id":"1707.09753","version":2},"attestation_state":"computed","paper":{"title":"Polar Code Construction for List Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Georg B\\\"ocherer, Onurcan \\.I\\c{s}can, Peihong Yuan, Ronald B\\\"ohnke, Tobias Prinz, Wen Xu","submitted_at":"2017-07-31T08:18:13Z","abstract_excerpt":"A heuristic construction of polar codes for successive cancellation list (SCL) decoding with a given list size is proposed to balance the trade-off between performance measured in frame error rate (FER) and decoding complexity. Furthermore, a construction based on dynamically frozen bits with constraints among the \"low weight bits\" (LWB) is presented. Simulation results show that the LWB-polar codes outperform the CRC-polar codes and the eBCH-polar codes under SCL decoding."},"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":"1707.09753","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-31T08:18:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7d7018e305ac40c125e0c1f3eb70be94913d0a800e4539caa5b223a3f82a75cb","abstract_canon_sha256":"3b798dd08cbd07469e720f58f756771b4c9d29fb52e6ca09b842725726192164"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:04.272955Z","signature_b64":"DRwqkqv6QukUp8MGsnIfXscFN3CI0ygsB7ziSJtd81A5luLpG566sFPZu1ndJ//H8Uj87vnwnq3NHqGlYX+zBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b57c4134fb6c850a3886d19558195fd80a8fd89d1d558d7e5cd9f64ea472cfb5","last_reissued_at":"2026-05-18T00:09:04.272265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:04.272265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polar Code Construction for List Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Georg B\\\"ocherer, Onurcan \\.I\\c{s}can, Peihong Yuan, Ronald B\\\"ohnke, Tobias Prinz, Wen Xu","submitted_at":"2017-07-31T08:18:13Z","abstract_excerpt":"A heuristic construction of polar codes for successive cancellation list (SCL) decoding with a given list size is proposed to balance the trade-off between performance measured in frame error rate (FER) and decoding complexity. Furthermore, a construction based on dynamically frozen bits with constraints among the \"low weight bits\" (LWB) is presented. Simulation results show that the LWB-polar codes outperform the CRC-polar codes and the eBCH-polar codes under SCL decoding."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09753","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":"1707.09753","created_at":"2026-05-18T00:09:04.272372+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.09753v2","created_at":"2026-05-18T00:09:04.272372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09753","created_at":"2026-05-18T00:09:04.272372+00:00"},{"alias_kind":"pith_short_12","alias_value":"WV6ECNH3NSCQ","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WV6ECNH3NSCQUOEG","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WV6ECNH3","created_at":"2026-05-18T12:31:53.515858+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/WV6ECNH3NSCQUOEG2GKVQGK73A","json":"https://pith.science/pith/WV6ECNH3NSCQUOEG2GKVQGK73A.json","graph_json":"https://pith.science/api/pith-number/WV6ECNH3NSCQUOEG2GKVQGK73A/graph.json","events_json":"https://pith.science/api/pith-number/WV6ECNH3NSCQUOEG2GKVQGK73A/events.json","paper":"https://pith.science/paper/WV6ECNH3"},"agent_actions":{"view_html":"https://pith.science/pith/WV6ECNH3NSCQUOEG2GKVQGK73A","download_json":"https://pith.science/pith/WV6ECNH3NSCQUOEG2GKVQGK73A.json","view_paper":"https://pith.science/paper/WV6ECNH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.09753&json=true","fetch_graph":"https://pith.science/api/pith-number/WV6ECNH3NSCQUOEG2GKVQGK73A/graph.json","fetch_events":"https://pith.science/api/pith-number/WV6ECNH3NSCQUOEG2GKVQGK73A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WV6ECNH3NSCQUOEG2GKVQGK73A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WV6ECNH3NSCQUOEG2GKVQGK73A/action/storage_attestation","attest_author":"https://pith.science/pith/WV6ECNH3NSCQUOEG2GKVQGK73A/action/author_attestation","sign_citation":"https://pith.science/pith/WV6ECNH3NSCQUOEG2GKVQGK73A/action/citation_signature","submit_replication":"https://pith.science/pith/WV6ECNH3NSCQUOEG2GKVQGK73A/action/replication_record"}},"created_at":"2026-05-18T00:09:04.272372+00:00","updated_at":"2026-05-18T00:09:04.272372+00:00"}