{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RUVHNQIMM5WRPWVEZ3QZVO4FM2","short_pith_number":"pith:RUVHNQIM","schema_version":"1.0","canonical_sha256":"8d2a76c10c676d17daa4cee19abb8566bb49447bd7f728ea6ae9f3432807da64","source":{"kind":"arxiv","id":"1708.09603","version":2},"attestation_state":"computed","paper":{"title":"PolarBear: A 28-nm FD-SOI ASIC for Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.AR","authors_text":"Alexios Balatsoukas-Stimming, Andrea Bonetti, Andreas Burg, Claude Thibeault, Pascal Giard, Philippe Flatresse, Thomas Christoph M\\\"uller, Warren J. Gross","submitted_at":"2017-08-31T08:03:19Z","abstract_excerpt":"Polar codes are a recently proposed class of block codes that provably achieve the capacity of various communication channels. They received a lot of attention as they can do so with low-complexity encoding and decoding algorithms, and they have an explicit construction. Their recent inclusion in a 5G communication standard will only spur more research. However, only a couple of ASICs featuring decoders for polar codes were fabricated, and none of them implements a list-based decoding algorithm. In this paper, we present ASIC measurement results for a fabricated 28 nm CMOS chip that implements"},"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":"1708.09603","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-08-31T08:03:19Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"cd2df737a4c91214e3b00dff6c803baef2eab1c255639a1059c2a7ff0321185e","abstract_canon_sha256":"63184b133a12ab2a216a029946c18da4d1bcb2033af6a6b60d4398811ed21185"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:08.147304Z","signature_b64":"DdqL5vL64BZLVnVY4/yjbfCzBRUexn+0pKuH2Dygk55WKCdnj0yQKq+BPAJxVbZHbLW9i5JYr5JVEMWej7EECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d2a76c10c676d17daa4cee19abb8566bb49447bd7f728ea6ae9f3432807da64","last_reissued_at":"2026-05-18T00:36:08.146600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:08.146600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PolarBear: A 28-nm FD-SOI ASIC for Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.AR","authors_text":"Alexios Balatsoukas-Stimming, Andrea Bonetti, Andreas Burg, Claude Thibeault, Pascal Giard, Philippe Flatresse, Thomas Christoph M\\\"uller, Warren J. Gross","submitted_at":"2017-08-31T08:03:19Z","abstract_excerpt":"Polar codes are a recently proposed class of block codes that provably achieve the capacity of various communication channels. They received a lot of attention as they can do so with low-complexity encoding and decoding algorithms, and they have an explicit construction. Their recent inclusion in a 5G communication standard will only spur more research. However, only a couple of ASICs featuring decoders for polar codes were fabricated, and none of them implements a list-based decoding algorithm. In this paper, we present ASIC measurement results for a fabricated 28 nm CMOS chip that implements"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09603","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":"1708.09603","created_at":"2026-05-18T00:36:08.146711+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.09603v2","created_at":"2026-05-18T00:36:08.146711+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09603","created_at":"2026-05-18T00:36:08.146711+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUVHNQIMM5WR","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUVHNQIMM5WRPWVE","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUVHNQIM","created_at":"2026-05-18T12:31:43.269735+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/RUVHNQIMM5WRPWVEZ3QZVO4FM2","json":"https://pith.science/pith/RUVHNQIMM5WRPWVEZ3QZVO4FM2.json","graph_json":"https://pith.science/api/pith-number/RUVHNQIMM5WRPWVEZ3QZVO4FM2/graph.json","events_json":"https://pith.science/api/pith-number/RUVHNQIMM5WRPWVEZ3QZVO4FM2/events.json","paper":"https://pith.science/paper/RUVHNQIM"},"agent_actions":{"view_html":"https://pith.science/pith/RUVHNQIMM5WRPWVEZ3QZVO4FM2","download_json":"https://pith.science/pith/RUVHNQIMM5WRPWVEZ3QZVO4FM2.json","view_paper":"https://pith.science/paper/RUVHNQIM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.09603&json=true","fetch_graph":"https://pith.science/api/pith-number/RUVHNQIMM5WRPWVEZ3QZVO4FM2/graph.json","fetch_events":"https://pith.science/api/pith-number/RUVHNQIMM5WRPWVEZ3QZVO4FM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUVHNQIMM5WRPWVEZ3QZVO4FM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUVHNQIMM5WRPWVEZ3QZVO4FM2/action/storage_attestation","attest_author":"https://pith.science/pith/RUVHNQIMM5WRPWVEZ3QZVO4FM2/action/author_attestation","sign_citation":"https://pith.science/pith/RUVHNQIMM5WRPWVEZ3QZVO4FM2/action/citation_signature","submit_replication":"https://pith.science/pith/RUVHNQIMM5WRPWVEZ3QZVO4FM2/action/replication_record"}},"created_at":"2026-05-18T00:36:08.146711+00:00","updated_at":"2026-05-18T00:36:08.146711+00:00"}