{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4N6Q2YBRG5DZPPR7WSN5VOYAPF","short_pith_number":"pith:4N6Q2YBR","schema_version":"1.0","canonical_sha256":"e37d0d6031374797be3fb49bdabb007964ca1c51e69f4342c9f5741fad1f585e","source":{"kind":"arxiv","id":"1506.05896","version":1},"attestation_state":"computed","paper":{"title":"A hybrid partial sum computation unit architecture for list decoders of polar codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Lin, Zhiyuan Yan","submitted_at":"2015-06-19T07:50:34Z","abstract_excerpt":"Although the successive cancelation (SC) algorithm works well for very long polar codes, its error performance for shorter polar codes is much worse. Several SC based list decoding algorithms have been proposed to improve the error performances of both long and short polar codes. A significant step of SC based list decoding algorithms is the updating of partial sums for all decoding paths. In this paper, we first proposed a lazy copy partial sum computation algorithm for SC based list decoding algorithms. Instead of copying partial sums directly, our lazy copy algorithm copies indices of parti"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1506.05896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-19T07:50:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"858e01ca18906edbf06b0be821736b28d2f7662bd2e72dc3024a1d337bbbeaf9","abstract_canon_sha256":"fe8b68ed53f8cf0920dbdef5db55c8474354a499d096f2fd8ffb59ffa29907ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:42:46.950684Z","signature_b64":"9jX3YV/QHqJ8nAMewbznJnYl+NyAGxzoWMMXdItn3jlbm9BD/hkVQXrTXTZMFab1QfVlZaYJJde3KG9sbWA1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e37d0d6031374797be3fb49bdabb007964ca1c51e69f4342c9f5741fad1f585e","last_reissued_at":"2026-05-18T01:42:46.950007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:42:46.950007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A hybrid partial sum computation unit architecture for list decoders of polar codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Lin, Zhiyuan Yan","submitted_at":"2015-06-19T07:50:34Z","abstract_excerpt":"Although the successive cancelation (SC) algorithm works well for very long polar codes, its error performance for shorter polar codes is much worse. Several SC based list decoding algorithms have been proposed to improve the error performances of both long and short polar codes. A significant step of SC based list decoding algorithms is the updating of partial sums for all decoding paths. In this paper, we first proposed a lazy copy partial sum computation algorithm for SC based list decoding algorithms. Instead of copying partial sums directly, our lazy copy algorithm copies indices of parti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05896","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.05896","created_at":"2026-05-18T01:42:46.950124+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.05896v1","created_at":"2026-05-18T01:42:46.950124+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05896","created_at":"2026-05-18T01:42:46.950124+00:00"},{"alias_kind":"pith_short_12","alias_value":"4N6Q2YBRG5DZ","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4N6Q2YBRG5DZPPR7","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4N6Q2YBR","created_at":"2026-05-18T12:29:05.191682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4N6Q2YBRG5DZPPR7WSN5VOYAPF","json":"https://pith.science/pith/4N6Q2YBRG5DZPPR7WSN5VOYAPF.json","graph_json":"https://pith.science/api/pith-number/4N6Q2YBRG5DZPPR7WSN5VOYAPF/graph.json","events_json":"https://pith.science/api/pith-number/4N6Q2YBRG5DZPPR7WSN5VOYAPF/events.json","paper":"https://pith.science/paper/4N6Q2YBR"},"agent_actions":{"view_html":"https://pith.science/pith/4N6Q2YBRG5DZPPR7WSN5VOYAPF","download_json":"https://pith.science/pith/4N6Q2YBRG5DZPPR7WSN5VOYAPF.json","view_paper":"https://pith.science/paper/4N6Q2YBR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.05896&json=true","fetch_graph":"https://pith.science/api/pith-number/4N6Q2YBRG5DZPPR7WSN5VOYAPF/graph.json","fetch_events":"https://pith.science/api/pith-number/4N6Q2YBRG5DZPPR7WSN5VOYAPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4N6Q2YBRG5DZPPR7WSN5VOYAPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4N6Q2YBRG5DZPPR7WSN5VOYAPF/action/storage_attestation","attest_author":"https://pith.science/pith/4N6Q2YBRG5DZPPR7WSN5VOYAPF/action/author_attestation","sign_citation":"https://pith.science/pith/4N6Q2YBRG5DZPPR7WSN5VOYAPF/action/citation_signature","submit_replication":"https://pith.science/pith/4N6Q2YBRG5DZPPR7WSN5VOYAPF/action/replication_record"}},"created_at":"2026-05-18T01:42:46.950124+00:00","updated_at":"2026-05-18T01:42:46.950124+00:00"}