{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FQVGHMVT74DOXVD2WWNBFVIVT2","short_pith_number":"pith:FQVGHMVT","schema_version":"1.0","canonical_sha256":"2c2a63b2b3ff06ebd47ab59a12d5159e9bad305ca8bc96b93b254c4cffff0937","source":{"kind":"arxiv","id":"2305.16950","version":1},"attestation_state":"computed","paper":{"title":"Implementation-Efficient Finite Alphabet Decoding of Polar Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gerhard Bauch, Philipp Mohr, Syed Aizaz Ali Shah","submitted_at":"2023-05-26T14:01:30Z","abstract_excerpt":"An implementation-efficient finite alphabet decoder for polar codes relying on coarsely quantized messages and low-complexity operations is proposed. Typically, finite alphabet decoding performs concatenated compression operations on the received channel messages to aggregate compact reliability information for error correction. These compression operations or mappings can be considered as lookup tables. For polar codes, the finite alphabet decoder design boils down to constructing lookup tables for the upper and lower branches of the building blocks within the code structure. A key challenge "},"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.16950","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-05-26T14:01:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0d8911a65f4386971b57a04a4a516b0a0bfe7ab2d89d968a87010cd40ec74dba","abstract_canon_sha256":"a6b845885b7c3134f4e5f580b3c62259e7283196c5f002f16f01aa3aae909d2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:14:19.441560Z","signature_b64":"ooHHb2Q9izvA9G83kaiMq4/1kqxCGaHxnyQz61pifcBwmHFaEgt1BhsosUNg0DmOwChiVWhijrsA7NsltkCoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c2a63b2b3ff06ebd47ab59a12d5159e9bad305ca8bc96b93b254c4cffff0937","last_reissued_at":"2026-07-05T06:14:19.441185Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:14:19.441185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Implementation-Efficient Finite Alphabet Decoding of Polar Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gerhard Bauch, Philipp Mohr, Syed Aizaz Ali Shah","submitted_at":"2023-05-26T14:01:30Z","abstract_excerpt":"An implementation-efficient finite alphabet decoder for polar codes relying on coarsely quantized messages and low-complexity operations is proposed. Typically, finite alphabet decoding performs concatenated compression operations on the received channel messages to aggregate compact reliability information for error correction. These compression operations or mappings can be considered as lookup tables. For polar codes, the finite alphabet decoder design boils down to constructing lookup tables for the upper and lower branches of the building blocks within the code structure. A key challenge "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.16950","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.16950/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.16950","created_at":"2026-07-05T06:14:19.441232+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.16950v1","created_at":"2026-07-05T06:14:19.441232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.16950","created_at":"2026-07-05T06:14:19.441232+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQVGHMVT74DO","created_at":"2026-07-05T06:14:19.441232+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQVGHMVT74DOXVD2","created_at":"2026-07-05T06:14:19.441232+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQVGHMVT","created_at":"2026-07-05T06:14:19.441232+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/FQVGHMVT74DOXVD2WWNBFVIVT2","json":"https://pith.science/pith/FQVGHMVT74DOXVD2WWNBFVIVT2.json","graph_json":"https://pith.science/api/pith-number/FQVGHMVT74DOXVD2WWNBFVIVT2/graph.json","events_json":"https://pith.science/api/pith-number/FQVGHMVT74DOXVD2WWNBFVIVT2/events.json","paper":"https://pith.science/paper/FQVGHMVT"},"agent_actions":{"view_html":"https://pith.science/pith/FQVGHMVT74DOXVD2WWNBFVIVT2","download_json":"https://pith.science/pith/FQVGHMVT74DOXVD2WWNBFVIVT2.json","view_paper":"https://pith.science/paper/FQVGHMVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.16950&json=true","fetch_graph":"https://pith.science/api/pith-number/FQVGHMVT74DOXVD2WWNBFVIVT2/graph.json","fetch_events":"https://pith.science/api/pith-number/FQVGHMVT74DOXVD2WWNBFVIVT2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQVGHMVT74DOXVD2WWNBFVIVT2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQVGHMVT74DOXVD2WWNBFVIVT2/action/storage_attestation","attest_author":"https://pith.science/pith/FQVGHMVT74DOXVD2WWNBFVIVT2/action/author_attestation","sign_citation":"https://pith.science/pith/FQVGHMVT74DOXVD2WWNBFVIVT2/action/citation_signature","submit_replication":"https://pith.science/pith/FQVGHMVT74DOXVD2WWNBFVIVT2/action/replication_record"}},"created_at":"2026-07-05T06:14:19.441232+00:00","updated_at":"2026-07-05T06:14:19.441232+00:00"}