{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:D7MY3TEQY6ZK3CP2DVUFWP6BN4","short_pith_number":"pith:D7MY3TEQ","canonical_record":{"source":{"id":"1511.00577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-19T00:52:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7856991223b9e0a5b0c5549526a2cd182d2f7c98715e887ea4db982f5f9c85ba","abstract_canon_sha256":"d3cd709c07feaf62a519d6a99780750d02452d950921f9e5f4a1fb82f3c9a5a8"},"schema_version":"1.0"},"canonical_sha256":"1fd98dcc90c7b2ad89fa1d685b3fc16f111e07fdee87db03cbed3db5dd2e8a5a","source":{"kind":"arxiv","id":"1511.00577","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.00577","created_at":"2026-05-18T01:28:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.00577v1","created_at":"2026-05-18T01:28:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00577","created_at":"2026-05-18T01:28:11Z"},{"alias_kind":"pith_short_12","alias_value":"D7MY3TEQY6ZK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D7MY3TEQY6ZK3CP2","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D7MY3TEQ","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:D7MY3TEQY6ZK3CP2DVUFWP6BN4","target":"record","payload":{"canonical_record":{"source":{"id":"1511.00577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-19T00:52:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7856991223b9e0a5b0c5549526a2cd182d2f7c98715e887ea4db982f5f9c85ba","abstract_canon_sha256":"d3cd709c07feaf62a519d6a99780750d02452d950921f9e5f4a1fb82f3c9a5a8"},"schema_version":"1.0"},"canonical_sha256":"1fd98dcc90c7b2ad89fa1d685b3fc16f111e07fdee87db03cbed3db5dd2e8a5a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:11.934278Z","signature_b64":"ingUf5K4sSsZ4R5L+Z1WwTD8ON+dVq4mS1mi4BewN3aE9OQjJ5t4ZO+a2V3PbYLXnchKpRqiHqh03yVIbVsICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fd98dcc90c7b2ad89fa1d685b3fc16f111e07fdee87db03cbed3db5dd2e8a5a","last_reissued_at":"2026-05-18T01:28:11.933649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:11.933649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.00577","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:28:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RmpxHx12r9DIELyJGrzxkEaQeacgMV8214BDWD84Q0ZPU4ajGyhaXfKurzd372GOqEmCuVVVWj3MWUPVvbinBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:36:24.389677Z"},"content_sha256":"ce563cb6ba45e37048447e70a4997ecc385ff3305850ce282868fd7d6a8cf801","schema_version":"1.0","event_id":"sha256:ce563cb6ba45e37048447e70a4997ecc385ff3305850ce282868fd7d6a8cf801"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:D7MY3TEQY6ZK3CP2DVUFWP6BN4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Overlapped List Successive Cancellation Approach for Hardware Efficient Polar Code Decoder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gwan Choi, Jingwei Xu, Tiben Che","submitted_at":"2015-10-19T00:52:04Z","abstract_excerpt":"This paper presents an efficient hardware design approach for list successive cancellation (LSC) decoding of polar codes. By applying path-overlapping scheme, the l instances of (l > 1) successive cancellation (SC) decoder for LSC with list size l can be cut down to only one. This results in a dramatic reduction of the hardware complexity without any decoding performance loss. We also develop novel approaches to reduce the latencyassociated with the pipeline scheme. Simulation results show that with proposed design approach the hardware efficiency is increased significantly over the recently p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00577","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:28:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P2i+v8wdRONYpWX/1eZH02r34S9lo1JoX4Z5Djf2NU2kbal7jeKy5M73pvKQvLUlmUfKuqz04p4ZMsnMBCXfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:36:24.390351Z"},"content_sha256":"9095a845c436275756f4b210621c66bedbd57f7247710a9663d6f6efcd49ee5e","schema_version":"1.0","event_id":"sha256:9095a845c436275756f4b210621c66bedbd57f7247710a9663d6f6efcd49ee5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D7MY3TEQY6ZK3CP2DVUFWP6BN4/bundle.json","state_url":"https://pith.science/pith/D7MY3TEQY6ZK3CP2DVUFWP6BN4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D7MY3TEQY6ZK3CP2DVUFWP6BN4/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-26T16:36:24Z","links":{"resolver":"https://pith.science/pith/D7MY3TEQY6ZK3CP2DVUFWP6BN4","bundle":"https://pith.science/pith/D7MY3TEQY6ZK3CP2DVUFWP6BN4/bundle.json","state":"https://pith.science/pith/D7MY3TEQY6ZK3CP2DVUFWP6BN4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D7MY3TEQY6ZK3CP2DVUFWP6BN4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:D7MY3TEQY6ZK3CP2DVUFWP6BN4","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":"d3cd709c07feaf62a519d6a99780750d02452d950921f9e5f4a1fb82f3c9a5a8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-19T00:52:04Z","title_canon_sha256":"7856991223b9e0a5b0c5549526a2cd182d2f7c98715e887ea4db982f5f9c85ba"},"schema_version":"1.0","source":{"id":"1511.00577","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.00577","created_at":"2026-05-18T01:28:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.00577v1","created_at":"2026-05-18T01:28:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00577","created_at":"2026-05-18T01:28:11Z"},{"alias_kind":"pith_short_12","alias_value":"D7MY3TEQY6ZK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D7MY3TEQY6ZK3CP2","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D7MY3TEQ","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:9095a845c436275756f4b210621c66bedbd57f7247710a9663d6f6efcd49ee5e","target":"graph","created_at":"2026-05-18T01:28:11Z","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":"This paper presents an efficient hardware design approach for list successive cancellation (LSC) decoding of polar codes. By applying path-overlapping scheme, the l instances of (l > 1) successive cancellation (SC) decoder for LSC with list size l can be cut down to only one. This results in a dramatic reduction of the hardware complexity without any decoding performance loss. We also develop novel approaches to reduce the latencyassociated with the pipeline scheme. Simulation results show that with proposed design approach the hardware efficiency is increased significantly over the recently p","authors_text":"Gwan Choi, Jingwei Xu, Tiben Che","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-19T00:52:04Z","title":"Overlapped List Successive Cancellation Approach for Hardware Efficient Polar Code Decoder"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00577","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:ce563cb6ba45e37048447e70a4997ecc385ff3305850ce282868fd7d6a8cf801","target":"record","created_at":"2026-05-18T01:28:11Z","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":"d3cd709c07feaf62a519d6a99780750d02452d950921f9e5f4a1fb82f3c9a5a8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-19T00:52:04Z","title_canon_sha256":"7856991223b9e0a5b0c5549526a2cd182d2f7c98715e887ea4db982f5f9c85ba"},"schema_version":"1.0","source":{"id":"1511.00577","kind":"arxiv","version":1}},"canonical_sha256":"1fd98dcc90c7b2ad89fa1d685b3fc16f111e07fdee87db03cbed3db5dd2e8a5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1fd98dcc90c7b2ad89fa1d685b3fc16f111e07fdee87db03cbed3db5dd2e8a5a","first_computed_at":"2026-05-18T01:28:11.933649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:11.933649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ingUf5K4sSsZ4R5L+Z1WwTD8ON+dVq4mS1mi4BewN3aE9OQjJ5t4ZO+a2V3PbYLXnchKpRqiHqh03yVIbVsICw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:11.934278Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.00577","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce563cb6ba45e37048447e70a4997ecc385ff3305850ce282868fd7d6a8cf801","sha256:9095a845c436275756f4b210621c66bedbd57f7247710a9663d6f6efcd49ee5e"],"state_sha256":"ca4a90e493f5d3c1965cacf9dccf796d3d0f630157289ef2c265312efc6e1d6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7XWYQhTJAcHpxLAu5Dc9Lvdd/Wf64PLKyp3Iwj4LFnnlOqrEQVWwVxZLRrLAyO4o9oPmx34nBP25+SKrLOu4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:36:24.394250Z","bundle_sha256":"93546f4e90f2792d1a1dd0e560dbe0f0f54e8fe5e4e439b7a93ed2e5914791d6"}}