{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:SBDSNGHOF6YNZW3LBHB35JEUUR","short_pith_number":"pith:SBDSNGHO","canonical_record":{"source":{"id":"2301.10445","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-01-25T07:45:51Z","cross_cats_sorted":["cs.AR","cs.SY","eess.SY","math.IT"],"title_canon_sha256":"a978bcd3e0105f4ec7a8f4cbd6ec08834758b63237a69aeaa29098452293a2cb","abstract_canon_sha256":"7c4f795ea0e57373eff103d1ade522238cd350dc5a3da110bd14838f6e967ca1"},"schema_version":"1.0"},"canonical_sha256":"90472698ee2fb0dcdb6b09c3bea494a44cd547bb9127d5116ef5ef2b307ccca3","source":{"kind":"arxiv","id":"2301.10445","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.10445","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"arxiv_version","alias_value":"2301.10445v1","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.10445","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"pith_short_12","alias_value":"SBDSNGHOF6YN","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"pith_short_16","alias_value":"SBDSNGHOF6YNZW3L","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"pith_short_8","alias_value":"SBDSNGHO","created_at":"2026-07-05T05:35:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:SBDSNGHOF6YNZW3LBHB35JEUUR","target":"record","payload":{"canonical_record":{"source":{"id":"2301.10445","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-01-25T07:45:51Z","cross_cats_sorted":["cs.AR","cs.SY","eess.SY","math.IT"],"title_canon_sha256":"a978bcd3e0105f4ec7a8f4cbd6ec08834758b63237a69aeaa29098452293a2cb","abstract_canon_sha256":"7c4f795ea0e57373eff103d1ade522238cd350dc5a3da110bd14838f6e967ca1"},"schema_version":"1.0"},"canonical_sha256":"90472698ee2fb0dcdb6b09c3bea494a44cd547bb9127d5116ef5ef2b307ccca3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:35:51.207580Z","signature_b64":"lxsR5kYHZmGDjAyrBxbXwCGy3NZj21orSr87uvEQvNHnBvNxnB70sP+/HaNXUPufHlavGbb+FmLluMJ3vtGACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90472698ee2fb0dcdb6b09c3bea494a44cd547bb9127d5116ef5ef2b307ccca3","last_reissued_at":"2026-07-05T05:35:51.207177Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:35:51.207177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.10445","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-07-05T05:35:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k9sVC2XCJJEx9fMshO6csJGtlgBQNzFsOP2LuSKPQq+AV5iXS6HQT+GeUxty0R57BNGfdhe2Hsz8WltQUkSzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:28:35.842981Z"},"content_sha256":"4a30be56320fbf1c4111353df4d24e58482917ee5b16e026f1757b596d77243f","schema_version":"1.0","event_id":"sha256:4a30be56320fbf1c4111353df4d24e58482917ee5b16e026f1757b596d77243f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:SBDSNGHOF6YNZW3LBHB35JEUUR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Throughput Rate-Flexible Combinational Decoders for Multi-Kernel Polar Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR","cs.SY","eess.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"Hossein Rezaei, Matti Latva-aho, Nandana Rajatheva","submitted_at":"2023-01-25T07:45:51Z","abstract_excerpt":"Polar codes have received growing attention in the past decade and have been selected as the coding scheme for the control channel in the fifth generation (5G) wireless communication systems. However, the conventional polar codes have only been constructed by binary (2x2) kernel which poses block length limitation to powers of 2. To attain more flexible block lengths, multi-kernel polar codes are proposed. In this paper, a combinational architecture for multi-kernel polar codes with high throughput is proposed based on successive cancellation decoding algorithm. The proposed scheme can decode "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.10445","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/2301.10445/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"},"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-07-05T05:35:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mco+DViLHrWVRDvMhuoPH7hr7NwbqfAfkJzgQYN1bhhpWBJf7FSK80xcTCwAgUWGkesICk9SnNe7FTa7U+L0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:28:35.843369Z"},"content_sha256":"58a1ece214dff215c76c0589f15f4b558c30d1daa0c7e0027c80f70b47964f61","schema_version":"1.0","event_id":"sha256:58a1ece214dff215c76c0589f15f4b558c30d1daa0c7e0027c80f70b47964f61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBDSNGHOF6YNZW3LBHB35JEUUR/bundle.json","state_url":"https://pith.science/pith/SBDSNGHOF6YNZW3LBHB35JEUUR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBDSNGHOF6YNZW3LBHB35JEUUR/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-07-06T20:28:35Z","links":{"resolver":"https://pith.science/pith/SBDSNGHOF6YNZW3LBHB35JEUUR","bundle":"https://pith.science/pith/SBDSNGHOF6YNZW3LBHB35JEUUR/bundle.json","state":"https://pith.science/pith/SBDSNGHOF6YNZW3LBHB35JEUUR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBDSNGHOF6YNZW3LBHB35JEUUR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:SBDSNGHOF6YNZW3LBHB35JEUUR","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":"7c4f795ea0e57373eff103d1ade522238cd350dc5a3da110bd14838f6e967ca1","cross_cats_sorted":["cs.AR","cs.SY","eess.SY","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-01-25T07:45:51Z","title_canon_sha256":"a978bcd3e0105f4ec7a8f4cbd6ec08834758b63237a69aeaa29098452293a2cb"},"schema_version":"1.0","source":{"id":"2301.10445","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.10445","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"arxiv_version","alias_value":"2301.10445v1","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.10445","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"pith_short_12","alias_value":"SBDSNGHOF6YN","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"pith_short_16","alias_value":"SBDSNGHOF6YNZW3L","created_at":"2026-07-05T05:35:51Z"},{"alias_kind":"pith_short_8","alias_value":"SBDSNGHO","created_at":"2026-07-05T05:35:51Z"}],"graph_snapshots":[{"event_id":"sha256:58a1ece214dff215c76c0589f15f4b558c30d1daa0c7e0027c80f70b47964f61","target":"graph","created_at":"2026-07-05T05:35:51Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.10445/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Polar codes have received growing attention in the past decade and have been selected as the coding scheme for the control channel in the fifth generation (5G) wireless communication systems. However, the conventional polar codes have only been constructed by binary (2x2) kernel which poses block length limitation to powers of 2. To attain more flexible block lengths, multi-kernel polar codes are proposed. In this paper, a combinational architecture for multi-kernel polar codes with high throughput is proposed based on successive cancellation decoding algorithm. The proposed scheme can decode ","authors_text":"Hossein Rezaei, Matti Latva-aho, Nandana Rajatheva","cross_cats":["cs.AR","cs.SY","eess.SY","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-01-25T07:45:51Z","title":"High-Throughput Rate-Flexible Combinational Decoders for Multi-Kernel Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.10445","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:4a30be56320fbf1c4111353df4d24e58482917ee5b16e026f1757b596d77243f","target":"record","created_at":"2026-07-05T05:35:51Z","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":"7c4f795ea0e57373eff103d1ade522238cd350dc5a3da110bd14838f6e967ca1","cross_cats_sorted":["cs.AR","cs.SY","eess.SY","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-01-25T07:45:51Z","title_canon_sha256":"a978bcd3e0105f4ec7a8f4cbd6ec08834758b63237a69aeaa29098452293a2cb"},"schema_version":"1.0","source":{"id":"2301.10445","kind":"arxiv","version":1}},"canonical_sha256":"90472698ee2fb0dcdb6b09c3bea494a44cd547bb9127d5116ef5ef2b307ccca3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90472698ee2fb0dcdb6b09c3bea494a44cd547bb9127d5116ef5ef2b307ccca3","first_computed_at":"2026-07-05T05:35:51.207177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:35:51.207177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lxsR5kYHZmGDjAyrBxbXwCGy3NZj21orSr87uvEQvNHnBvNxnB70sP+/HaNXUPufHlavGbb+FmLluMJ3vtGACg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:35:51.207580Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.10445","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a30be56320fbf1c4111353df4d24e58482917ee5b16e026f1757b596d77243f","sha256:58a1ece214dff215c76c0589f15f4b558c30d1daa0c7e0027c80f70b47964f61"],"state_sha256":"adfec3d68ccd7b0aed7dbf8972845423afb57ee48312b85f9a40f8edf12d17b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0N87tfmSPuGb4Lw5tyfzWkAmQzQpi1dbulo0qwWzIwcGoEYioca4SNlxIoPphzak3HAQr+2X5n4ICks3v1IBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:28:35.845646Z","bundle_sha256":"cb745a2c466bc0a49fd2c8fd472028d88d951715893f1b7ba8afe5d518d45b3a"}}