{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HIESEG3JKD6IGGOQHIGK46TAE2","short_pith_number":"pith:HIESEG3J","schema_version":"1.0","canonical_sha256":"3a09221b6950fc8319d03a0cae7a6026aeaab90880d9c19b524cf44105e83f2f","source":{"kind":"arxiv","id":"1506.02955","version":1},"attestation_state":"computed","paper":{"title":"A Decision-Aided Parallel SC-List Decoder for Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bin Li, Hui Shen, Kai Chen","submitted_at":"2015-06-09T15:19:00Z","abstract_excerpt":"In this paper, we propose a decision-aided scheme for parallel SC-List decoding of polar codes. At the parallel SC-List decoder, each survival path is extended based on multiple information bits, therefore the number of split paths becomes very large and the sorting to find the top L paths becomes very complex. We propose a decision-aided scheme to reduce the number of split paths and thus reduce the sorting complexity."},"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.02955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-09T15:19:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3e6fdb65865a9f1469cc359115f8df4aeb5f46d1e36c1d179cd9068b0254fe49","abstract_canon_sha256":"33ae1a477e0cc594a42914fcdf181cb92dfe84f44469d6079cf8669b7207f564"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:40.417766Z","signature_b64":"zDadG4PVVHgpewZNhN3KWhtcIh4qAdRcz61nO9CXzl0htsJ5iVz+LblSKQGgE5MbSJEMNM2QT3WL2vLcpJmLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a09221b6950fc8319d03a0cae7a6026aeaab90880d9c19b524cf44105e83f2f","last_reissued_at":"2026-05-18T01:55:40.417071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:40.417071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Decision-Aided Parallel SC-List Decoder for Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bin Li, Hui Shen, Kai Chen","submitted_at":"2015-06-09T15:19:00Z","abstract_excerpt":"In this paper, we propose a decision-aided scheme for parallel SC-List decoding of polar codes. At the parallel SC-List decoder, each survival path is extended based on multiple information bits, therefore the number of split paths becomes very large and the sorting to find the top L paths becomes very complex. We propose a decision-aided scheme to reduce the number of split paths and thus reduce the sorting complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02955","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.02955","created_at":"2026-05-18T01:55:40.417198+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02955v1","created_at":"2026-05-18T01:55:40.417198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02955","created_at":"2026-05-18T01:55:40.417198+00:00"},{"alias_kind":"pith_short_12","alias_value":"HIESEG3JKD6I","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HIESEG3JKD6IGGOQ","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HIESEG3J","created_at":"2026-05-18T12:29:25.134429+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/HIESEG3JKD6IGGOQHIGK46TAE2","json":"https://pith.science/pith/HIESEG3JKD6IGGOQHIGK46TAE2.json","graph_json":"https://pith.science/api/pith-number/HIESEG3JKD6IGGOQHIGK46TAE2/graph.json","events_json":"https://pith.science/api/pith-number/HIESEG3JKD6IGGOQHIGK46TAE2/events.json","paper":"https://pith.science/paper/HIESEG3J"},"agent_actions":{"view_html":"https://pith.science/pith/HIESEG3JKD6IGGOQHIGK46TAE2","download_json":"https://pith.science/pith/HIESEG3JKD6IGGOQHIGK46TAE2.json","view_paper":"https://pith.science/paper/HIESEG3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02955&json=true","fetch_graph":"https://pith.science/api/pith-number/HIESEG3JKD6IGGOQHIGK46TAE2/graph.json","fetch_events":"https://pith.science/api/pith-number/HIESEG3JKD6IGGOQHIGK46TAE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HIESEG3JKD6IGGOQHIGK46TAE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HIESEG3JKD6IGGOQHIGK46TAE2/action/storage_attestation","attest_author":"https://pith.science/pith/HIESEG3JKD6IGGOQHIGK46TAE2/action/author_attestation","sign_citation":"https://pith.science/pith/HIESEG3JKD6IGGOQHIGK46TAE2/action/citation_signature","submit_replication":"https://pith.science/pith/HIESEG3JKD6IGGOQHIGK46TAE2/action/replication_record"}},"created_at":"2026-05-18T01:55:40.417198+00:00","updated_at":"2026-05-18T01:55:40.417198+00:00"}