{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:HLO46IYXBFE2XX67QKHSUZZP3W","short_pith_number":"pith:HLO46IYX","canonical_record":{"source":{"id":"1011.2919","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2010-11-12T14:38:52Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"8514e8bf6315e2a0daed8911e5f7733b656915d44dd31ff136025af2cb8e2722","abstract_canon_sha256":"da89b93d98d7cd82f99930316e6054f7a10dd83f0b90e33008cca3014465cc50"},"schema_version":"1.0"},"canonical_sha256":"3addcf23170949abdfdf828f2a672fddb93e03223195e64f38e0220edb60e7df","source":{"kind":"arxiv","id":"1011.2919","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2919","created_at":"2026-05-18T02:23:36Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2919v1","created_at":"2026-05-18T02:23:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2919","created_at":"2026-05-18T02:23:36Z"},{"alias_kind":"pith_short_12","alias_value":"HLO46IYXBFE2","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HLO46IYXBFE2XX67","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HLO46IYX","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:HLO46IYXBFE2XX67QKHSUZZP3W","target":"record","payload":{"canonical_record":{"source":{"id":"1011.2919","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2010-11-12T14:38:52Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"8514e8bf6315e2a0daed8911e5f7733b656915d44dd31ff136025af2cb8e2722","abstract_canon_sha256":"da89b93d98d7cd82f99930316e6054f7a10dd83f0b90e33008cca3014465cc50"},"schema_version":"1.0"},"canonical_sha256":"3addcf23170949abdfdf828f2a672fddb93e03223195e64f38e0220edb60e7df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:36.903967Z","signature_b64":"q7PWYDsGU/3/P5+v2Mx6U3qd0SRlqbEUjB9oxWxsi4DJcqFOn4NL35GmL304giUnltSqKkM7ONlILv5KtDEwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3addcf23170949abdfdf828f2a672fddb93e03223195e64f38e0220edb60e7df","last_reissued_at":"2026-05-18T02:23:36.903414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:36.903414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.2919","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-18T02:23:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GV7z/Nc/p+KyAWt22/48P0H9rmQR6WDMQq2FTuMSUzTixFn/BlEMgzJs5nGaPmao2QK8DRx4s/b4SOeQLT+GBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:48:41.145658Z"},"content_sha256":"a5a5c5accebcc826782ab60f571dceaf0821d5af2db139acbac10feb3822664e","schema_version":"1.0","event_id":"sha256:a5a5c5accebcc826782ab60f571dceaf0821d5af2db139acbac10feb3822664e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:HLO46IYXBFE2XX67QKHSUZZP3W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hardware architectures for Successive Cancellation 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":"Alexander Vardy, Camille Leroux, Ido Tal, Warren J. Gross","submitted_at":"2010-11-12T14:38:52Z","abstract_excerpt":"The recently-discovered polar codes are widely seen as a major breakthrough in coding theory. These codes achieve the capacity of many important channels under successive cancellation decoding. Motivated by the rapid progress in the theory of polar codes, we propose a family of architectures for efficient hardware implementation of successive cancellation decoders. We show that such decoders can be implemented with O(n) processing elements and O(n) memory elements, while providing constant throughput. We also propose a technique for overlapping the decoding of several consecutive codewords, th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2919","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-18T02:23:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g1v6JXBmOKaAKOzemL7dxQtuFE0C/vKwSCwYAmJ3tmamg2q9z6z7paVt3OT9iYw0Tp/AZlrUe6x4jvn/hdxnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:48:41.146010Z"},"content_sha256":"89312ce3b109d31178d6a7813e5226eaafc7a7ef89178a1a239630c70a535dbb","schema_version":"1.0","event_id":"sha256:89312ce3b109d31178d6a7813e5226eaafc7a7ef89178a1a239630c70a535dbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HLO46IYXBFE2XX67QKHSUZZP3W/bundle.json","state_url":"https://pith.science/pith/HLO46IYXBFE2XX67QKHSUZZP3W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HLO46IYXBFE2XX67QKHSUZZP3W/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-06-06T15:48:41Z","links":{"resolver":"https://pith.science/pith/HLO46IYXBFE2XX67QKHSUZZP3W","bundle":"https://pith.science/pith/HLO46IYXBFE2XX67QKHSUZZP3W/bundle.json","state":"https://pith.science/pith/HLO46IYXBFE2XX67QKHSUZZP3W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HLO46IYXBFE2XX67QKHSUZZP3W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:HLO46IYXBFE2XX67QKHSUZZP3W","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":"da89b93d98d7cd82f99930316e6054f7a10dd83f0b90e33008cca3014465cc50","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2010-11-12T14:38:52Z","title_canon_sha256":"8514e8bf6315e2a0daed8911e5f7733b656915d44dd31ff136025af2cb8e2722"},"schema_version":"1.0","source":{"id":"1011.2919","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2919","created_at":"2026-05-18T02:23:36Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2919v1","created_at":"2026-05-18T02:23:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2919","created_at":"2026-05-18T02:23:36Z"},{"alias_kind":"pith_short_12","alias_value":"HLO46IYXBFE2","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HLO46IYXBFE2XX67","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HLO46IYX","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:89312ce3b109d31178d6a7813e5226eaafc7a7ef89178a1a239630c70a535dbb","target":"graph","created_at":"2026-05-18T02:23:36Z","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":"The recently-discovered polar codes are widely seen as a major breakthrough in coding theory. These codes achieve the capacity of many important channels under successive cancellation decoding. Motivated by the rapid progress in the theory of polar codes, we propose a family of architectures for efficient hardware implementation of successive cancellation decoders. We show that such decoders can be implemented with O(n) processing elements and O(n) memory elements, while providing constant throughput. We also propose a technique for overlapping the decoding of several consecutive codewords, th","authors_text":"Alexander Vardy, Camille Leroux, Ido Tal, 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":"2010-11-12T14:38:52Z","title":"Hardware architectures for Successive Cancellation Decoding of Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2919","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:a5a5c5accebcc826782ab60f571dceaf0821d5af2db139acbac10feb3822664e","target":"record","created_at":"2026-05-18T02:23:36Z","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":"da89b93d98d7cd82f99930316e6054f7a10dd83f0b90e33008cca3014465cc50","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2010-11-12T14:38:52Z","title_canon_sha256":"8514e8bf6315e2a0daed8911e5f7733b656915d44dd31ff136025af2cb8e2722"},"schema_version":"1.0","source":{"id":"1011.2919","kind":"arxiv","version":1}},"canonical_sha256":"3addcf23170949abdfdf828f2a672fddb93e03223195e64f38e0220edb60e7df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3addcf23170949abdfdf828f2a672fddb93e03223195e64f38e0220edb60e7df","first_computed_at":"2026-05-18T02:23:36.903414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:36.903414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q7PWYDsGU/3/P5+v2Mx6U3qd0SRlqbEUjB9oxWxsi4DJcqFOn4NL35GmL304giUnltSqKkM7ONlILv5KtDEwAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:36.903967Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.2919","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5a5c5accebcc826782ab60f571dceaf0821d5af2db139acbac10feb3822664e","sha256:89312ce3b109d31178d6a7813e5226eaafc7a7ef89178a1a239630c70a535dbb"],"state_sha256":"bead912ea894498cdb885efa5af6e1a6db5ef4e64b21f84ea225dfd8cf8762db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PAnK/K9rx/8Y4yRoL5w3c5FQfcz4Q3rFjgz2UCz7o2AHpYmZW40/0pTOWnEYNq8Ee5v99AFU+zKOytS2/OOtAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:48:41.148042Z","bundle_sha256":"9bb8ef2ddc0a4403d1ac762c4dec73ab287a36746e0c88dd6871db329e90a874"}}