{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HK2H4OV2DVWMNYX6Z23EO4KZCM","short_pith_number":"pith:HK2H4OV2","schema_version":"1.0","canonical_sha256":"3ab47e3aba1d6cc6e2feceb6477159130fff9a7abfb9863a26ec6ce3eee1cdf2","source":{"kind":"arxiv","id":"2605.23124","version":1},"attestation_state":"computed","paper":{"title":"Deep-Learning-Aided Successive Cancellation List Flip Decoding for Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Fu-Siang Liang, Shan Lu, Yeong-Luh Ueng","submitted_at":"2026-05-22T00:48:01Z","abstract_excerpt":"Polar codes are the first error-correcting code proven to achieve channel capacity based on infinite code length. The Successive Cancellation List Flip (SCLF) decoding algorithm was proposed by flipping an erroneous bit during the next decoding attempt. To identify the erroneous bits, the Log-Likelihood Ratio (LLR) is used to indicate the reliability of each decision bit. To improve the accuracy of the erroneous bit prediction, we propose deep-learning-aided (DL-aided) SCLF decoding algorithms. We first offer a stacked LSTM network that contains new features to train our models, which are able"},"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":"2605.23124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-22T00:48:01Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4e5243dc31914789252fd07b7804a328b52ca39d17a9b4b91e7aa27b33ee83f7","abstract_canon_sha256":"790e0765fc95eac48e3cdd8282995bb16843411f63a6122de584106998976222"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:39.425894Z","signature_b64":"EXJiyTK8XIo66OQoqVDpNUiHhibSpE5CNyVaigYp0n5fHNRAzVb/CHXeIWszkXwnH4rtRoCJxHs+IAx8eXhdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ab47e3aba1d6cc6e2feceb6477159130fff9a7abfb9863a26ec6ce3eee1cdf2","last_reissued_at":"2026-05-25T02:01:39.425151Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:39.425151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep-Learning-Aided Successive Cancellation List Flip Decoding for Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Fu-Siang Liang, Shan Lu, Yeong-Luh Ueng","submitted_at":"2026-05-22T00:48:01Z","abstract_excerpt":"Polar codes are the first error-correcting code proven to achieve channel capacity based on infinite code length. The Successive Cancellation List Flip (SCLF) decoding algorithm was proposed by flipping an erroneous bit during the next decoding attempt. To identify the erroneous bits, the Log-Likelihood Ratio (LLR) is used to indicate the reliability of each decision bit. To improve the accuracy of the erroneous bit prediction, we propose deep-learning-aided (DL-aided) SCLF decoding algorithms. We first offer a stacked LSTM network that contains new features to train our models, which are able"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23124","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/2605.23124/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":"2605.23124","created_at":"2026-05-25T02:01:39.425350+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.23124v1","created_at":"2026-05-25T02:01:39.425350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23124","created_at":"2026-05-25T02:01:39.425350+00:00"},{"alias_kind":"pith_short_12","alias_value":"HK2H4OV2DVWM","created_at":"2026-05-25T02:01:39.425350+00:00"},{"alias_kind":"pith_short_16","alias_value":"HK2H4OV2DVWMNYX6","created_at":"2026-05-25T02:01:39.425350+00:00"},{"alias_kind":"pith_short_8","alias_value":"HK2H4OV2","created_at":"2026-05-25T02:01:39.425350+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/HK2H4OV2DVWMNYX6Z23EO4KZCM","json":"https://pith.science/pith/HK2H4OV2DVWMNYX6Z23EO4KZCM.json","graph_json":"https://pith.science/api/pith-number/HK2H4OV2DVWMNYX6Z23EO4KZCM/graph.json","events_json":"https://pith.science/api/pith-number/HK2H4OV2DVWMNYX6Z23EO4KZCM/events.json","paper":"https://pith.science/paper/HK2H4OV2"},"agent_actions":{"view_html":"https://pith.science/pith/HK2H4OV2DVWMNYX6Z23EO4KZCM","download_json":"https://pith.science/pith/HK2H4OV2DVWMNYX6Z23EO4KZCM.json","view_paper":"https://pith.science/paper/HK2H4OV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.23124&json=true","fetch_graph":"https://pith.science/api/pith-number/HK2H4OV2DVWMNYX6Z23EO4KZCM/graph.json","fetch_events":"https://pith.science/api/pith-number/HK2H4OV2DVWMNYX6Z23EO4KZCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HK2H4OV2DVWMNYX6Z23EO4KZCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HK2H4OV2DVWMNYX6Z23EO4KZCM/action/storage_attestation","attest_author":"https://pith.science/pith/HK2H4OV2DVWMNYX6Z23EO4KZCM/action/author_attestation","sign_citation":"https://pith.science/pith/HK2H4OV2DVWMNYX6Z23EO4KZCM/action/citation_signature","submit_replication":"https://pith.science/pith/HK2H4OV2DVWMNYX6Z23EO4KZCM/action/replication_record"}},"created_at":"2026-05-25T02:01:39.425350+00:00","updated_at":"2026-05-25T02:01:39.425350+00:00"}