{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6IGQ5XEFTMZUS6L75MATBDUMWJ","short_pith_number":"pith:6IGQ5XEF","schema_version":"1.0","canonical_sha256":"f20d0edc859b3349797feb01308e8cb26fd0ba18f3d7cdc833c51debc141cfec","source":{"kind":"arxiv","id":"2305.04257","version":1},"attestation_state":"computed","paper":{"title":"Unrolled Architectures for High-Throughput Encoding of Multi-Kernel Polar Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR","math.IT"],"primary_cat":"cs.IT","authors_text":"Elham Abbasi, Hossein Rezaei, Matti Latva-aho, Nandana Rajatheva","submitted_at":"2023-05-07T12:13:16Z","abstract_excerpt":"Over the past decade, polar codes have received significant traction and have been selected as the coding method for the control channel in fifth-generation (5G) wireless communication systems. However, conventional polar codes are reliant solely on binary (2x2) kernels, which restricts their block length to being only powers of 2. In response, multi-kernel (MK) polar codes have been proposed as a viable solution to attain greater code length flexibility. This paper proposes an unrolled architecture for encoding both systematic and non-systematic MK polar codes, capable of high-throughput enco"},"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":"2305.04257","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-05-07T12:13:16Z","cross_cats_sorted":["cs.AR","math.IT"],"title_canon_sha256":"78f090a5eabf61d65bb2d81c3478a02d6c6af070ca9af62797d0453910929afe","abstract_canon_sha256":"894fbc489f5595eeabab702c0f4a87643283cbea073bb367a4d8dd2e64b2eb13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:07:46.438259Z","signature_b64":"blZr95be0ll0ObL1G7Ar4GHn2cubkG1XnyqVM15l1zn40O2GIUbqE+PgPqxGNerSYaDdbMdVxHPHo+S1z8iUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f20d0edc859b3349797feb01308e8cb26fd0ba18f3d7cdc833c51debc141cfec","last_reissued_at":"2026-07-05T06:07:46.437859Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:07:46.437859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unrolled Architectures for High-Throughput Encoding of Multi-Kernel Polar Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR","math.IT"],"primary_cat":"cs.IT","authors_text":"Elham Abbasi, Hossein Rezaei, Matti Latva-aho, Nandana Rajatheva","submitted_at":"2023-05-07T12:13:16Z","abstract_excerpt":"Over the past decade, polar codes have received significant traction and have been selected as the coding method for the control channel in fifth-generation (5G) wireless communication systems. However, conventional polar codes are reliant solely on binary (2x2) kernels, which restricts their block length to being only powers of 2. In response, multi-kernel (MK) polar codes have been proposed as a viable solution to attain greater code length flexibility. This paper proposes an unrolled architecture for encoding both systematic and non-systematic MK polar codes, capable of high-throughput enco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.04257","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.04257/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2305.04257","created_at":"2026-07-05T06:07:46.437918+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.04257v1","created_at":"2026-07-05T06:07:46.437918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.04257","created_at":"2026-07-05T06:07:46.437918+00:00"},{"alias_kind":"pith_short_12","alias_value":"6IGQ5XEFTMZU","created_at":"2026-07-05T06:07:46.437918+00:00"},{"alias_kind":"pith_short_16","alias_value":"6IGQ5XEFTMZUS6L7","created_at":"2026-07-05T06:07:46.437918+00:00"},{"alias_kind":"pith_short_8","alias_value":"6IGQ5XEF","created_at":"2026-07-05T06:07:46.437918+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/6IGQ5XEFTMZUS6L75MATBDUMWJ","json":"https://pith.science/pith/6IGQ5XEFTMZUS6L75MATBDUMWJ.json","graph_json":"https://pith.science/api/pith-number/6IGQ5XEFTMZUS6L75MATBDUMWJ/graph.json","events_json":"https://pith.science/api/pith-number/6IGQ5XEFTMZUS6L75MATBDUMWJ/events.json","paper":"https://pith.science/paper/6IGQ5XEF"},"agent_actions":{"view_html":"https://pith.science/pith/6IGQ5XEFTMZUS6L75MATBDUMWJ","download_json":"https://pith.science/pith/6IGQ5XEFTMZUS6L75MATBDUMWJ.json","view_paper":"https://pith.science/paper/6IGQ5XEF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.04257&json=true","fetch_graph":"https://pith.science/api/pith-number/6IGQ5XEFTMZUS6L75MATBDUMWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/6IGQ5XEFTMZUS6L75MATBDUMWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6IGQ5XEFTMZUS6L75MATBDUMWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6IGQ5XEFTMZUS6L75MATBDUMWJ/action/storage_attestation","attest_author":"https://pith.science/pith/6IGQ5XEFTMZUS6L75MATBDUMWJ/action/author_attestation","sign_citation":"https://pith.science/pith/6IGQ5XEFTMZUS6L75MATBDUMWJ/action/citation_signature","submit_replication":"https://pith.science/pith/6IGQ5XEFTMZUS6L75MATBDUMWJ/action/replication_record"}},"created_at":"2026-07-05T06:07:46.437918+00:00","updated_at":"2026-07-05T06:07:46.437918+00:00"}