{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RUVHNQIMM5WRPWVEZ3QZVO4FM2","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":"63184b133a12ab2a216a029946c18da4d1bcb2033af6a6b60d4398811ed21185","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-08-31T08:03:19Z","title_canon_sha256":"cd2df737a4c91214e3b00dff6c803baef2eab1c255639a1059c2a7ff0321185e"},"schema_version":"1.0","source":{"id":"1708.09603","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09603","created_at":"2026-05-18T00:36:08Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09603v2","created_at":"2026-05-18T00:36:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09603","created_at":"2026-05-18T00:36:08Z"},{"alias_kind":"pith_short_12","alias_value":"RUVHNQIMM5WR","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RUVHNQIMM5WRPWVE","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RUVHNQIM","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:fa4c3277c49cc99091d0a83056f12c92f876daaadc27b57ac5ca53ab8cf4e367","target":"graph","created_at":"2026-05-18T00:36:08Z","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"},"paper":{"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","authors_text":"Alexios Balatsoukas-Stimming, Andrea Bonetti, Andreas Burg, Claude Thibeault, Pascal Giard, Philippe Flatresse, Thomas Christoph M\\\"uller, Warren J. Gross","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-08-31T08:03:19Z","title":"PolarBear: A 28-nm FD-SOI ASIC for Decoding of Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09603","kind":"arxiv","version":2},"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:c67ae4ecb2b468a7b99a7641b68509a2af647425b120b9d22a6f0fd9c117a212","target":"record","created_at":"2026-05-18T00:36:08Z","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":"63184b133a12ab2a216a029946c18da4d1bcb2033af6a6b60d4398811ed21185","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-08-31T08:03:19Z","title_canon_sha256":"cd2df737a4c91214e3b00dff6c803baef2eab1c255639a1059c2a7ff0321185e"},"schema_version":"1.0","source":{"id":"1708.09603","kind":"arxiv","version":2}},"canonical_sha256":"8d2a76c10c676d17daa4cee19abb8566bb49447bd7f728ea6ae9f3432807da64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d2a76c10c676d17daa4cee19abb8566bb49447bd7f728ea6ae9f3432807da64","first_computed_at":"2026-05-18T00:36:08.146600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:08.146600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DdqL5vL64BZLVnVY4/yjbfCzBRUexn+0pKuH2Dygk55WKCdnj0yQKq+BPAJxVbZHbLW9i5JYr5JVEMWej7EECw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:08.147304Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09603","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c67ae4ecb2b468a7b99a7641b68509a2af647425b120b9d22a6f0fd9c117a212","sha256:fa4c3277c49cc99091d0a83056f12c92f876daaadc27b57ac5ca53ab8cf4e367"],"state_sha256":"15d70bce28b822dc0b317c3abfb9609ac0f311485a244cb9ae7316303df7c445"}