{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LMSAOFZZRDQRFDA5UIL6QOYAJO","short_pith_number":"pith:LMSAOFZZ","canonical_record":{"source":{"id":"1306.3529","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-14T23:38:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d87ce91099900b51cb3a86f395cc74f46aad2712ec56dd08a4262dca1d4e52bf","abstract_canon_sha256":"7d82782456deb0d95fdde0ffd14223decdc7cf931247eb26857a9436b3ac6431"},"schema_version":"1.0"},"canonical_sha256":"5b2407173988e1128c1da217e83b004b87bb1eed8b0591cf1b12439b8f3deae2","source":{"kind":"arxiv","id":"1306.3529","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3529","created_at":"2026-05-18T01:49:16Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3529v1","created_at":"2026-05-18T01:49:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3529","created_at":"2026-05-18T01:49:16Z"},{"alias_kind":"pith_short_12","alias_value":"LMSAOFZZRDQR","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LMSAOFZZRDQRFDA5","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LMSAOFZZ","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LMSAOFZZRDQRFDA5UIL6QOYAJO","target":"record","payload":{"canonical_record":{"source":{"id":"1306.3529","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-14T23:38:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d87ce91099900b51cb3a86f395cc74f46aad2712ec56dd08a4262dca1d4e52bf","abstract_canon_sha256":"7d82782456deb0d95fdde0ffd14223decdc7cf931247eb26857a9436b3ac6431"},"schema_version":"1.0"},"canonical_sha256":"5b2407173988e1128c1da217e83b004b87bb1eed8b0591cf1b12439b8f3deae2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:49:16.685199Z","signature_b64":"CjMO86B2Rctzr+kqXf+JnPmNdHTr8RDHQMDrmEDwjBm+fyNrzZu4UzjQvj3v7mTY4OPnSDUUrRcR/lishsTyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b2407173988e1128c1da217e83b004b87bb1eed8b0591cf1b12439b8f3deae2","last_reissued_at":"2026-05-18T01:49:16.684669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:49:16.684669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.3529","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-18T01:49:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eyuaVSjlTtPPGySECddDYa5msLb+QR8NdslmztLhytcz9xXNhHOqVUmjFK6/iIG9GbSLGMA7SoXHX9nklMbQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:40:06.031027Z"},"content_sha256":"1e11aea72f1a4565e8c375d627a7322c1cd1b3e4030fd6131fa8d389d1d58677","schema_version":"1.0","event_id":"sha256:1e11aea72f1a4565e8c375d627a7322c1cd1b3e4030fd6131fa8d389d1d58677"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LMSAOFZZRDQRFDA5UIL6QOYAJO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Successive-Cancellation Hardware Decoder for Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre J. Raymond, Warren J. Gross","submitted_at":"2013-06-14T23:38:58Z","abstract_excerpt":"Polar codes, discovered by Ar{\\i}kan, are the first error-correcting codes with an explicit construction to provably achieve channel capacity, asymptotically. However, their error-correction performance at finite lengths tends to be lower than existing capacity-approaching schemes. Using the successive-cancellation algorithm, polar decoders can be designed for very long codes, with low hardware complexity, leveraging the regular structure of such codes. We present an architecture and an implementation of a scalable hardware decoder based on this algorithm. This design is shown to scale to code"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3529","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-18T01:49:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n9xXtWkV/sq16hIUq/jwbZSfASBLD1Rm3yfghPIBgzBnYRvyteC/DC0xV6aElag+TANObxZyvU0fuRdd2wjEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:40:06.031519Z"},"content_sha256":"d7f8bfdc5f29668bddd7250a3c08b84c454438fa2c55343ab80fcb772d58c672","schema_version":"1.0","event_id":"sha256:d7f8bfdc5f29668bddd7250a3c08b84c454438fa2c55343ab80fcb772d58c672"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMSAOFZZRDQRFDA5UIL6QOYAJO/bundle.json","state_url":"https://pith.science/pith/LMSAOFZZRDQRFDA5UIL6QOYAJO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMSAOFZZRDQRFDA5UIL6QOYAJO/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-27T14:40:06Z","links":{"resolver":"https://pith.science/pith/LMSAOFZZRDQRFDA5UIL6QOYAJO","bundle":"https://pith.science/pith/LMSAOFZZRDQRFDA5UIL6QOYAJO/bundle.json","state":"https://pith.science/pith/LMSAOFZZRDQRFDA5UIL6QOYAJO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMSAOFZZRDQRFDA5UIL6QOYAJO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LMSAOFZZRDQRFDA5UIL6QOYAJO","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":"7d82782456deb0d95fdde0ffd14223decdc7cf931247eb26857a9436b3ac6431","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-14T23:38:58Z","title_canon_sha256":"d87ce91099900b51cb3a86f395cc74f46aad2712ec56dd08a4262dca1d4e52bf"},"schema_version":"1.0","source":{"id":"1306.3529","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3529","created_at":"2026-05-18T01:49:16Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3529v1","created_at":"2026-05-18T01:49:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3529","created_at":"2026-05-18T01:49:16Z"},{"alias_kind":"pith_short_12","alias_value":"LMSAOFZZRDQR","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LMSAOFZZRDQRFDA5","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LMSAOFZZ","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:d7f8bfdc5f29668bddd7250a3c08b84c454438fa2c55343ab80fcb772d58c672","target":"graph","created_at":"2026-05-18T01:49:16Z","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, discovered by Ar{\\i}kan, are the first error-correcting codes with an explicit construction to provably achieve channel capacity, asymptotically. However, their error-correction performance at finite lengths tends to be lower than existing capacity-approaching schemes. Using the successive-cancellation algorithm, polar decoders can be designed for very long codes, with low hardware complexity, leveraging the regular structure of such codes. We present an architecture and an implementation of a scalable hardware decoder based on this algorithm. This design is shown to scale to code","authors_text":"Alexandre J. Raymond, Warren J. Gross","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-14T23:38:58Z","title":"Scalable Successive-Cancellation Hardware Decoder for Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3529","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:1e11aea72f1a4565e8c375d627a7322c1cd1b3e4030fd6131fa8d389d1d58677","target":"record","created_at":"2026-05-18T01:49:16Z","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":"7d82782456deb0d95fdde0ffd14223decdc7cf931247eb26857a9436b3ac6431","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-14T23:38:58Z","title_canon_sha256":"d87ce91099900b51cb3a86f395cc74f46aad2712ec56dd08a4262dca1d4e52bf"},"schema_version":"1.0","source":{"id":"1306.3529","kind":"arxiv","version":1}},"canonical_sha256":"5b2407173988e1128c1da217e83b004b87bb1eed8b0591cf1b12439b8f3deae2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b2407173988e1128c1da217e83b004b87bb1eed8b0591cf1b12439b8f3deae2","first_computed_at":"2026-05-18T01:49:16.684669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:49:16.684669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CjMO86B2Rctzr+kqXf+JnPmNdHTr8RDHQMDrmEDwjBm+fyNrzZu4UzjQvj3v7mTY4OPnSDUUrRcR/lishsTyAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:49:16.685199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.3529","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e11aea72f1a4565e8c375d627a7322c1cd1b3e4030fd6131fa8d389d1d58677","sha256:d7f8bfdc5f29668bddd7250a3c08b84c454438fa2c55343ab80fcb772d58c672"],"state_sha256":"6a678cbeea9b4d0be3490919d017ba99489de2f76769c9d2e1cf70468fcfc82b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pcr29b5470e7BN+4lp3B2p2Gura8OBaq+x9ny2y4hLgqmfkVY9YzNepNlWEs4zeITmxE+Y+xSzxh40J57JHVCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:40:06.035182Z","bundle_sha256":"c5d4a4f1b8faabf932afafa6bf54fca0ddd7f5803a53f18ecaeb4b4481332927"}}