{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:L3CWMJ2ZHWVSSTSW4P3JRXFU5U","short_pith_number":"pith:L3CWMJ2Z","schema_version":"1.0","canonical_sha256":"5ec56627593dab294e56e3f698dcb4ed21c4b91dd5acfbcea97a41c0a718245b","source":{"kind":"arxiv","id":"2111.02851","version":1},"attestation_state":"computed","paper":{"title":"A Dynamic Programming Method to Construct Polar Codes with Improved Performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guodong Li, Min Ye, Sihuang Hu","submitted_at":"2021-11-04T13:25:23Z","abstract_excerpt":"In the standard polar code construction, the message vector $(U_0,U_1,\\dots,U_{n-1})$ is divided into information bits and frozen bits according to the reliability of each $U_i$ given $(U_0,U_1,\\dots,U_{i-1})$ and all the channel outputs. While this reliability function is the most suitable measure to choose information bits under the Successive Cancellation (SC) decoder, there is a mismatch between this reliability function and the Successive Cancellation List (SCL) decoder because the SCL decoder also makes use of the information from the future frozen bits.\n  We propose a Dynamic Programmin"},"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":"2111.02851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-11-04T13:25:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"31011412cdd324afbad3203fc731eecbb8f07bbfd58defbc03f7895ca68433ae","abstract_canon_sha256":"18c053e019da2f6d01d1b8f62a56dbca17f0b1b8a8ae4506f0af51e3b0d8e703"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:29:09.856513Z","signature_b64":"RyFMjPKao6VJySF+d1wkO2Io8jFi2Ng9DGWetOyaTVh57FapzIUNtYMHBW9piHNWysumkGk+odgTwfdHwfugCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ec56627593dab294e56e3f698dcb4ed21c4b91dd5acfbcea97a41c0a718245b","last_reissued_at":"2026-07-05T03:29:09.856135Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:29:09.856135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Dynamic Programming Method to Construct Polar Codes with Improved Performance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guodong Li, Min Ye, Sihuang Hu","submitted_at":"2021-11-04T13:25:23Z","abstract_excerpt":"In the standard polar code construction, the message vector $(U_0,U_1,\\dots,U_{n-1})$ is divided into information bits and frozen bits according to the reliability of each $U_i$ given $(U_0,U_1,\\dots,U_{i-1})$ and all the channel outputs. While this reliability function is the most suitable measure to choose information bits under the Successive Cancellation (SC) decoder, there is a mismatch between this reliability function and the Successive Cancellation List (SCL) decoder because the SCL decoder also makes use of the information from the future frozen bits.\n  We propose a Dynamic Programmin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.02851","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.02851/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":"2111.02851","created_at":"2026-07-05T03:29:09.856207+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.02851v1","created_at":"2026-07-05T03:29:09.856207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.02851","created_at":"2026-07-05T03:29:09.856207+00:00"},{"alias_kind":"pith_short_12","alias_value":"L3CWMJ2ZHWVS","created_at":"2026-07-05T03:29:09.856207+00:00"},{"alias_kind":"pith_short_16","alias_value":"L3CWMJ2ZHWVSSTSW","created_at":"2026-07-05T03:29:09.856207+00:00"},{"alias_kind":"pith_short_8","alias_value":"L3CWMJ2Z","created_at":"2026-07-05T03:29:09.856207+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/L3CWMJ2ZHWVSSTSW4P3JRXFU5U","json":"https://pith.science/pith/L3CWMJ2ZHWVSSTSW4P3JRXFU5U.json","graph_json":"https://pith.science/api/pith-number/L3CWMJ2ZHWVSSTSW4P3JRXFU5U/graph.json","events_json":"https://pith.science/api/pith-number/L3CWMJ2ZHWVSSTSW4P3JRXFU5U/events.json","paper":"https://pith.science/paper/L3CWMJ2Z"},"agent_actions":{"view_html":"https://pith.science/pith/L3CWMJ2ZHWVSSTSW4P3JRXFU5U","download_json":"https://pith.science/pith/L3CWMJ2ZHWVSSTSW4P3JRXFU5U.json","view_paper":"https://pith.science/paper/L3CWMJ2Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.02851&json=true","fetch_graph":"https://pith.science/api/pith-number/L3CWMJ2ZHWVSSTSW4P3JRXFU5U/graph.json","fetch_events":"https://pith.science/api/pith-number/L3CWMJ2ZHWVSSTSW4P3JRXFU5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L3CWMJ2ZHWVSSTSW4P3JRXFU5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L3CWMJ2ZHWVSSTSW4P3JRXFU5U/action/storage_attestation","attest_author":"https://pith.science/pith/L3CWMJ2ZHWVSSTSW4P3JRXFU5U/action/author_attestation","sign_citation":"https://pith.science/pith/L3CWMJ2ZHWVSSTSW4P3JRXFU5U/action/citation_signature","submit_replication":"https://pith.science/pith/L3CWMJ2ZHWVSSTSW4P3JRXFU5U/action/replication_record"}},"created_at":"2026-07-05T03:29:09.856207+00:00","updated_at":"2026-07-05T03:29:09.856207+00:00"}