{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QKPJ5FUMU3H22U2RT4CTX73P3A","short_pith_number":"pith:QKPJ5FUM","canonical_record":{"source":{"id":"1702.00938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-02-03T08:48:52Z","cross_cats_sorted":[],"title_canon_sha256":"008dd2695772a56b51baea09fac7b5533b2622997df2584650e8ae6d903ea9a1","abstract_canon_sha256":"6bd642241a2b3592c3d08f20ef49aec3f73e33de5187debecf80bc5aba2373bc"},"schema_version":"1.0"},"canonical_sha256":"829e9e968ca6cfad53519f053bff6fd82f9efbcf744db5dbfbc386a4594bce54","source":{"kind":"arxiv","id":"1702.00938","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00938","created_at":"2026-05-18T00:44:51Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00938v1","created_at":"2026-05-18T00:44:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00938","created_at":"2026-05-18T00:44:51Z"},{"alias_kind":"pith_short_12","alias_value":"QKPJ5FUMU3H2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QKPJ5FUMU3H22U2R","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QKPJ5FUM","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QKPJ5FUMU3H22U2RT4CTX73P3A","target":"record","payload":{"canonical_record":{"source":{"id":"1702.00938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-02-03T08:48:52Z","cross_cats_sorted":[],"title_canon_sha256":"008dd2695772a56b51baea09fac7b5533b2622997df2584650e8ae6d903ea9a1","abstract_canon_sha256":"6bd642241a2b3592c3d08f20ef49aec3f73e33de5187debecf80bc5aba2373bc"},"schema_version":"1.0"},"canonical_sha256":"829e9e968ca6cfad53519f053bff6fd82f9efbcf744db5dbfbc386a4594bce54","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:51.637287Z","signature_b64":"YVZd6z8pnSI48XyC59IEJZJT/D0brLJFZcNBC04Bqw1EBNjOVttBjlaOnnL0kC99vNF1hfoAx+wOz+PVrxw2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"829e9e968ca6cfad53519f053bff6fd82f9efbcf744db5dbfbc386a4594bce54","last_reissued_at":"2026-05-18T00:44:51.636789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:51.636789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.00938","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-05-18T00:44:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ARYvoP30I2zyJvcXig+OqovbHdCrbFsNrR80MKyaHSINBwfSIuExlbU0QY1kxwwufX5+IA7eOEEpMClvmf3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:57:34.566692Z"},"content_sha256":"3ded129525aba910fc2e207d953a9c4d8795e309538e7aa837b2a3d1fa523e53","schema_version":"1.0","event_id":"sha256:3ded129525aba910fc2e207d953a9c4d8795e309538e7aa837b2a3d1fa523e53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QKPJ5FUMU3H22U2RT4CTX73P3A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Multi-Gbps Unrolled Hardware List Decoder for a Systematic Polar Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Alexios Balatsoukas-Stimming, Andreas Burg, Claude Thibeault, Pascal Giard, Thomas Christoph M\\\"uller, Warren J. Gross","submitted_at":"2017-02-03T08:48:52Z","abstract_excerpt":"Polar codes are a new class of block codes with an explicit construction that provably achieve the capacity of various communications channels, even with the low-complexity successive-cancellation (SC) decoding algorithm. Yet, the more complex successive-cancellation list (SCL) decoding algorithm is gathering more attention lately as it significantly improves the error-correction performance of short- to moderate-length polar codes, especially when they are concatenated with a cyclic redundancy check code. However, as SCL decoding explores several decoding paths, existing hardware implementati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00938","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":""},"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-05-18T00:44:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LSqdnd+DH5UUTBRa6Qp17X+RCXpTtOyv+UenrHSKmFs4yapppAcv1AmKgYNzD+8feCRdikzPROriaBtBdIHfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:57:34.567384Z"},"content_sha256":"dc74702fe44a2c82c9a10fa95e37c5de789524f898861ecf029849fa76fb5b58","schema_version":"1.0","event_id":"sha256:dc74702fe44a2c82c9a10fa95e37c5de789524f898861ecf029849fa76fb5b58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QKPJ5FUMU3H22U2RT4CTX73P3A/bundle.json","state_url":"https://pith.science/pith/QKPJ5FUMU3H22U2RT4CTX73P3A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QKPJ5FUMU3H22U2RT4CTX73P3A/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-05-26T13:57:34Z","links":{"resolver":"https://pith.science/pith/QKPJ5FUMU3H22U2RT4CTX73P3A","bundle":"https://pith.science/pith/QKPJ5FUMU3H22U2RT4CTX73P3A/bundle.json","state":"https://pith.science/pith/QKPJ5FUMU3H22U2RT4CTX73P3A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QKPJ5FUMU3H22U2RT4CTX73P3A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QKPJ5FUMU3H22U2RT4CTX73P3A","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":"6bd642241a2b3592c3d08f20ef49aec3f73e33de5187debecf80bc5aba2373bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-02-03T08:48:52Z","title_canon_sha256":"008dd2695772a56b51baea09fac7b5533b2622997df2584650e8ae6d903ea9a1"},"schema_version":"1.0","source":{"id":"1702.00938","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00938","created_at":"2026-05-18T00:44:51Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00938v1","created_at":"2026-05-18T00:44:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00938","created_at":"2026-05-18T00:44:51Z"},{"alias_kind":"pith_short_12","alias_value":"QKPJ5FUMU3H2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QKPJ5FUMU3H22U2R","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QKPJ5FUM","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:dc74702fe44a2c82c9a10fa95e37c5de789524f898861ecf029849fa76fb5b58","target":"graph","created_at":"2026-05-18T00:44: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"},"paper":{"abstract_excerpt":"Polar codes are a new class of block codes with an explicit construction that provably achieve the capacity of various communications channels, even with the low-complexity successive-cancellation (SC) decoding algorithm. Yet, the more complex successive-cancellation list (SCL) decoding algorithm is gathering more attention lately as it significantly improves the error-correction performance of short- to moderate-length polar codes, especially when they are concatenated with a cyclic redundancy check code. However, as SCL decoding explores several decoding paths, existing hardware implementati","authors_text":"Alexios Balatsoukas-Stimming, Andreas Burg, Claude Thibeault, Pascal Giard, Thomas Christoph M\\\"uller, Warren J. Gross","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-02-03T08:48:52Z","title":"A Multi-Gbps Unrolled Hardware List Decoder for a Systematic Polar Code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00938","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:3ded129525aba910fc2e207d953a9c4d8795e309538e7aa837b2a3d1fa523e53","target":"record","created_at":"2026-05-18T00:44: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":"6bd642241a2b3592c3d08f20ef49aec3f73e33de5187debecf80bc5aba2373bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-02-03T08:48:52Z","title_canon_sha256":"008dd2695772a56b51baea09fac7b5533b2622997df2584650e8ae6d903ea9a1"},"schema_version":"1.0","source":{"id":"1702.00938","kind":"arxiv","version":1}},"canonical_sha256":"829e9e968ca6cfad53519f053bff6fd82f9efbcf744db5dbfbc386a4594bce54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"829e9e968ca6cfad53519f053bff6fd82f9efbcf744db5dbfbc386a4594bce54","first_computed_at":"2026-05-18T00:44:51.636789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:51.636789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YVZd6z8pnSI48XyC59IEJZJT/D0brLJFZcNBC04Bqw1EBNjOVttBjlaOnnL0kC99vNF1hfoAx+wOz+PVrxw2AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:51.637287Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.00938","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ded129525aba910fc2e207d953a9c4d8795e309538e7aa837b2a3d1fa523e53","sha256:dc74702fe44a2c82c9a10fa95e37c5de789524f898861ecf029849fa76fb5b58"],"state_sha256":"ea44ad77988022142bcdcf9fcc408f7d60586b8c06be6c78bd842296b09f600b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NnuWzijGlUyUqfetD1nmw7+s2Zr8Hbr9WCbQmDBYT+c9rm9LLF/kdHShMKqEacGuB+gzydYaVEuIwAupccBGBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:57:34.571012Z","bundle_sha256":"e125e21a8563b76fd8b0c737685011b9d88fbe2117e4cb157b45ca731d04c172"}}