{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WD4C7LW5FBA3OP2GQBN3UBLIYI","short_pith_number":"pith:WD4C7LW5","schema_version":"1.0","canonical_sha256":"b0f82faedd2841b73f46805bba0568c218ce109449aabe86b6d71bef76a2a75f","source":{"kind":"arxiv","id":"2306.17496","version":2},"attestation_state":"computed","paper":{"title":"Performance Analysis for Polar Codes under Successive Cancellation List Decoding with Fixed List Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dong Li, Jindi Liu, Jinnan Piao, Ming Yang, Peng Zeng, Xueting Yu, Zhibo Li","submitted_at":"2023-06-30T09:14:32Z","abstract_excerpt":"In this paper, we first indicate that the block error event of polar codes under successive cancellation list (SCL) decoding is composed of path loss (PL) error event and path selection (PS) error event, where the PL error event is that correct codeword is lost during the SCL decoding and the PS error event is that correct codeword is reserved in the decoded list but not selected as the decoded codeword. Then, we simplify the PL error event by assuming the all-zero codeword is transmitted and derive the probability lower bound via the joint probability density of the log-likelihood ratios of i"},"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":"2306.17496","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-06-30T09:14:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"549708d5baec7b89327f1078549b56b0cb2369a21e30a07c3fd0e961612e0003","abstract_canon_sha256":"ec6e2fd3b618cf9d15f60ac876f4adb4b1031d1120c8cc13ce76667b9cf9c0fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:28:19.790534Z","signature_b64":"9lkOA4zwPyAdvoTYWGFGSgCV5CR/1ImPyLFziBd8kVQag82dfeHiFcrzU6hljVmLbDKufFT63XUmtCM9QYiIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0f82faedd2841b73f46805bba0568c218ce109449aabe86b6d71bef76a2a75f","last_reissued_at":"2026-07-05T06:28:19.790032Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:28:19.790032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance Analysis for Polar Codes under Successive Cancellation List Decoding with Fixed List Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dong Li, Jindi Liu, Jinnan Piao, Ming Yang, Peng Zeng, Xueting Yu, Zhibo Li","submitted_at":"2023-06-30T09:14:32Z","abstract_excerpt":"In this paper, we first indicate that the block error event of polar codes under successive cancellation list (SCL) decoding is composed of path loss (PL) error event and path selection (PS) error event, where the PL error event is that correct codeword is lost during the SCL decoding and the PS error event is that correct codeword is reserved in the decoded list but not selected as the decoded codeword. Then, we simplify the PL error event by assuming the all-zero codeword is transmitted and derive the probability lower bound via the joint probability density of the log-likelihood ratios of i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.17496","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.17496/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2306.17496","created_at":"2026-07-05T06:28:19.790091+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.17496v2","created_at":"2026-07-05T06:28:19.790091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.17496","created_at":"2026-07-05T06:28:19.790091+00:00"},{"alias_kind":"pith_short_12","alias_value":"WD4C7LW5FBA3","created_at":"2026-07-05T06:28:19.790091+00:00"},{"alias_kind":"pith_short_16","alias_value":"WD4C7LW5FBA3OP2G","created_at":"2026-07-05T06:28:19.790091+00:00"},{"alias_kind":"pith_short_8","alias_value":"WD4C7LW5","created_at":"2026-07-05T06:28:19.790091+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25522","citing_title":"A Path-Survival Analytical Framework for SCL Decoding of Polar Codes","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2606.25522","citing_title":"A Path-Survival Analytical Framework for SCL Decoding of Polar Codes","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WD4C7LW5FBA3OP2GQBN3UBLIYI","json":"https://pith.science/pith/WD4C7LW5FBA3OP2GQBN3UBLIYI.json","graph_json":"https://pith.science/api/pith-number/WD4C7LW5FBA3OP2GQBN3UBLIYI/graph.json","events_json":"https://pith.science/api/pith-number/WD4C7LW5FBA3OP2GQBN3UBLIYI/events.json","paper":"https://pith.science/paper/WD4C7LW5"},"agent_actions":{"view_html":"https://pith.science/pith/WD4C7LW5FBA3OP2GQBN3UBLIYI","download_json":"https://pith.science/pith/WD4C7LW5FBA3OP2GQBN3UBLIYI.json","view_paper":"https://pith.science/paper/WD4C7LW5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.17496&json=true","fetch_graph":"https://pith.science/api/pith-number/WD4C7LW5FBA3OP2GQBN3UBLIYI/graph.json","fetch_events":"https://pith.science/api/pith-number/WD4C7LW5FBA3OP2GQBN3UBLIYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WD4C7LW5FBA3OP2GQBN3UBLIYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WD4C7LW5FBA3OP2GQBN3UBLIYI/action/storage_attestation","attest_author":"https://pith.science/pith/WD4C7LW5FBA3OP2GQBN3UBLIYI/action/author_attestation","sign_citation":"https://pith.science/pith/WD4C7LW5FBA3OP2GQBN3UBLIYI/action/citation_signature","submit_replication":"https://pith.science/pith/WD4C7LW5FBA3OP2GQBN3UBLIYI/action/replication_record"}},"created_at":"2026-07-05T06:28:19.790091+00:00","updated_at":"2026-07-05T06:28:19.790091+00:00"}