{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:L3CWMJ2ZHWVSSTSW4P3JRXFU5U","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"18c053e019da2f6d01d1b8f62a56dbca17f0b1b8a8ae4506f0af51e3b0d8e703","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-11-04T13:25:23Z","title_canon_sha256":"31011412cdd324afbad3203fc731eecbb8f07bbfd58defbc03f7895ca68433ae"},"schema_version":"1.0","source":{"id":"2111.02851","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.02851","created_at":"2026-07-05T03:29:09Z"},{"alias_kind":"arxiv_version","alias_value":"2111.02851v1","created_at":"2026-07-05T03:29:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.02851","created_at":"2026-07-05T03:29:09Z"},{"alias_kind":"pith_short_12","alias_value":"L3CWMJ2ZHWVS","created_at":"2026-07-05T03:29:09Z"},{"alias_kind":"pith_short_16","alias_value":"L3CWMJ2ZHWVSSTSW","created_at":"2026-07-05T03:29:09Z"},{"alias_kind":"pith_short_8","alias_value":"L3CWMJ2Z","created_at":"2026-07-05T03:29:09Z"}],"graph_snapshots":[{"event_id":"sha256:1b67ea6160746e20ce7edda9a3627491bb113005d1f7731b9ac72c9ebefbe7e1","target":"graph","created_at":"2026-07-05T03:29:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.02851/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Guodong Li, Min Ye, Sihuang Hu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-11-04T13:25:23Z","title":"A Dynamic Programming Method to Construct Polar Codes with Improved Performance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.02851","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:33f96f8e6b4230ebbf39cbb9fa23f2159fe4fd40707d11f9556138471648d6b7","target":"record","created_at":"2026-07-05T03:29:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"18c053e019da2f6d01d1b8f62a56dbca17f0b1b8a8ae4506f0af51e3b0d8e703","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-11-04T13:25:23Z","title_canon_sha256":"31011412cdd324afbad3203fc731eecbb8f07bbfd58defbc03f7895ca68433ae"},"schema_version":"1.0","source":{"id":"2111.02851","kind":"arxiv","version":1}},"canonical_sha256":"5ec56627593dab294e56e3f698dcb4ed21c4b91dd5acfbcea97a41c0a718245b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ec56627593dab294e56e3f698dcb4ed21c4b91dd5acfbcea97a41c0a718245b","first_computed_at":"2026-07-05T03:29:09.856135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:29:09.856135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RyFMjPKao6VJySF+d1wkO2Io8jFi2Ng9DGWetOyaTVh57FapzIUNtYMHBW9piHNWysumkGk+odgTwfdHwfugCg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:29:09.856513Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.02851","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33f96f8e6b4230ebbf39cbb9fa23f2159fe4fd40707d11f9556138471648d6b7","sha256:1b67ea6160746e20ce7edda9a3627491bb113005d1f7731b9ac72c9ebefbe7e1"],"state_sha256":"26b98db346c7507cbf15b6dba3552bef5cd93fca4542b115135d11671c74f167"}