{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YDJTBD7PKAEREF3NGZ6ABGJWVD","short_pith_number":"pith:YDJTBD7P","schema_version":"1.0","canonical_sha256":"c0d3308fef500912176d367c009936a8e72b005c8b5553c8257422229422e305","source":{"kind":"arxiv","id":"2311.10047","version":3},"attestation_state":"computed","paper":{"title":"Frozen Set Design for Precoded Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Branka Vucetic, Vera Miloslavskaya, Yonghui Li","submitted_at":"2023-11-16T17:43:13Z","abstract_excerpt":"This paper focuses on the frozen set design for precoded polar codes decoded by the successive cancellation list (SCL) algorithm. We propose a novel frozen set design method, whose computational complexity is low due to the use of analytical bounds and constrained frozen set structure. We derive new bounds based on the recently published complexity analysis of SCL decoding with near maximum-likelihood (ML) performance. To predict the ML performance, we employ the state-of-the-art bounds relying on the code weight distribution. The bounds and constrained frozen set structure are incorporated in"},"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":"2311.10047","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-11-16T17:43:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"00da74630db015a8c34c4afef7b5bd371c7a9331d1fbec9b8847a1dda390ad3c","abstract_canon_sha256":"e1766f3902c482e9f77b03bb124ffffadf0d39e572aa576232a3f61f7a892966"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:55:21.096767Z","signature_b64":"FBuc6W/5AK1wmngf/T3J88HFDwyjn9kVG8Zmxx0AOF/iGfm8hOzCjZoHCPqcGDZe0s/xpIEHKO8pntjsnFQMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0d3308fef500912176d367c009936a8e72b005c8b5553c8257422229422e305","last_reissued_at":"2026-07-05T08:55:21.096331Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:55:21.096331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Frozen Set Design for Precoded Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Branka Vucetic, Vera Miloslavskaya, Yonghui Li","submitted_at":"2023-11-16T17:43:13Z","abstract_excerpt":"This paper focuses on the frozen set design for precoded polar codes decoded by the successive cancellation list (SCL) algorithm. We propose a novel frozen set design method, whose computational complexity is low due to the use of analytical bounds and constrained frozen set structure. We derive new bounds based on the recently published complexity analysis of SCL decoding with near maximum-likelihood (ML) performance. To predict the ML performance, we employ the state-of-the-art bounds relying on the code weight distribution. The bounds and constrained frozen set structure are incorporated in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.10047","kind":"arxiv","version":3},"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/2311.10047/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":"2311.10047","created_at":"2026-07-05T08:55:21.096392+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.10047v3","created_at":"2026-07-05T08:55:21.096392+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.10047","created_at":"2026-07-05T08:55:21.096392+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDJTBD7PKAER","created_at":"2026-07-05T08:55:21.096392+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDJTBD7PKAEREF3N","created_at":"2026-07-05T08:55:21.096392+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDJTBD7P","created_at":"2026-07-05T08:55:21.096392+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/YDJTBD7PKAEREF3NGZ6ABGJWVD","json":"https://pith.science/pith/YDJTBD7PKAEREF3NGZ6ABGJWVD.json","graph_json":"https://pith.science/api/pith-number/YDJTBD7PKAEREF3NGZ6ABGJWVD/graph.json","events_json":"https://pith.science/api/pith-number/YDJTBD7PKAEREF3NGZ6ABGJWVD/events.json","paper":"https://pith.science/paper/YDJTBD7P"},"agent_actions":{"view_html":"https://pith.science/pith/YDJTBD7PKAEREF3NGZ6ABGJWVD","download_json":"https://pith.science/pith/YDJTBD7PKAEREF3NGZ6ABGJWVD.json","view_paper":"https://pith.science/paper/YDJTBD7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.10047&json=true","fetch_graph":"https://pith.science/api/pith-number/YDJTBD7PKAEREF3NGZ6ABGJWVD/graph.json","fetch_events":"https://pith.science/api/pith-number/YDJTBD7PKAEREF3NGZ6ABGJWVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDJTBD7PKAEREF3NGZ6ABGJWVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDJTBD7PKAEREF3NGZ6ABGJWVD/action/storage_attestation","attest_author":"https://pith.science/pith/YDJTBD7PKAEREF3NGZ6ABGJWVD/action/author_attestation","sign_citation":"https://pith.science/pith/YDJTBD7PKAEREF3NGZ6ABGJWVD/action/citation_signature","submit_replication":"https://pith.science/pith/YDJTBD7PKAEREF3NGZ6ABGJWVD/action/replication_record"}},"created_at":"2026-07-05T08:55:21.096392+00:00","updated_at":"2026-07-05T08:55:21.096392+00:00"}