{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:566FFNEBSZ7O3QSLI3FO5HCRQO","short_pith_number":"pith:566FFNEB","schema_version":"1.0","canonical_sha256":"efbc52b481967eedc24b46caee9c5183a5f78652ec5eed32b5e5bd63f421c2f4","source":{"kind":"arxiv","id":"1902.08394","version":2},"attestation_state":"computed","paper":{"title":"Learning to Flip Successive Cancellation Decoding of Polar Codes with LSTM Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Huazi Zhang, Jun Wang, Lingchen Huang, Rong Li, Shengchen Dai, Xianbin Wang, Yourui Huangfu","submitted_at":"2019-02-22T08:26:29Z","abstract_excerpt":"The key to successive cancellation (SC) flip decoding of polar codes is to accurately identify the first error bit. The optimal flipping strategy is considered difficult due to lack of an analytical solution. Alternatively, we propose a deep learning aided SC flip algorithm. Specifically, before each SC decoding attempt, a long short-term memory (LSTM) network is exploited to either (i) locate the first error bit, or (ii) undo a previous `wrong' flip. In each SC attempt, the sequence of log likelihood ratios (LLRs) derived in the previous SC attempt is exploited to decide which action to take."},"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":"1902.08394","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-22T08:26:29Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"4498e1cf7a08ccc97a51e2088adeab1dc67862847c1a751218f4efdf51112bf3","abstract_canon_sha256":"ccb203138091989b92e8a865e8d3c1c54498a00848dc869e587b127a3167a2db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:50.689608Z","signature_b64":"OUsqeT0d3f8yQW5ku6ji15vEH7BrXPnijANfQvOa68HtLGQr566udHYLAZHl2Mv5l2m65nIX5AFtvRK6rQtGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efbc52b481967eedc24b46caee9c5183a5f78652ec5eed32b5e5bd63f421c2f4","last_reissued_at":"2026-05-17T23:52:50.688839Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:50.688839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Flip Successive Cancellation Decoding of Polar Codes with LSTM Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Huazi Zhang, Jun Wang, Lingchen Huang, Rong Li, Shengchen Dai, Xianbin Wang, Yourui Huangfu","submitted_at":"2019-02-22T08:26:29Z","abstract_excerpt":"The key to successive cancellation (SC) flip decoding of polar codes is to accurately identify the first error bit. The optimal flipping strategy is considered difficult due to lack of an analytical solution. Alternatively, we propose a deep learning aided SC flip algorithm. Specifically, before each SC decoding attempt, a long short-term memory (LSTM) network is exploited to either (i) locate the first error bit, or (ii) undo a previous `wrong' flip. In each SC attempt, the sequence of log likelihood ratios (LLRs) derived in the previous SC attempt is exploited to decide which action to take."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08394","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":""},"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":"1902.08394","created_at":"2026-05-17T23:52:50.688959+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08394v2","created_at":"2026-05-17T23:52:50.688959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08394","created_at":"2026-05-17T23:52:50.688959+00:00"},{"alias_kind":"pith_short_12","alias_value":"566FFNEBSZ7O","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"566FFNEBSZ7O3QSL","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"566FFNEB","created_at":"2026-05-18T12:33:10.108867+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/566FFNEBSZ7O3QSLI3FO5HCRQO","json":"https://pith.science/pith/566FFNEBSZ7O3QSLI3FO5HCRQO.json","graph_json":"https://pith.science/api/pith-number/566FFNEBSZ7O3QSLI3FO5HCRQO/graph.json","events_json":"https://pith.science/api/pith-number/566FFNEBSZ7O3QSLI3FO5HCRQO/events.json","paper":"https://pith.science/paper/566FFNEB"},"agent_actions":{"view_html":"https://pith.science/pith/566FFNEBSZ7O3QSLI3FO5HCRQO","download_json":"https://pith.science/pith/566FFNEBSZ7O3QSLI3FO5HCRQO.json","view_paper":"https://pith.science/paper/566FFNEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08394&json=true","fetch_graph":"https://pith.science/api/pith-number/566FFNEBSZ7O3QSLI3FO5HCRQO/graph.json","fetch_events":"https://pith.science/api/pith-number/566FFNEBSZ7O3QSLI3FO5HCRQO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/566FFNEBSZ7O3QSLI3FO5HCRQO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/566FFNEBSZ7O3QSLI3FO5HCRQO/action/storage_attestation","attest_author":"https://pith.science/pith/566FFNEBSZ7O3QSLI3FO5HCRQO/action/author_attestation","sign_citation":"https://pith.science/pith/566FFNEBSZ7O3QSLI3FO5HCRQO/action/citation_signature","submit_replication":"https://pith.science/pith/566FFNEBSZ7O3QSLI3FO5HCRQO/action/replication_record"}},"created_at":"2026-05-17T23:52:50.688959+00:00","updated_at":"2026-05-17T23:52:50.688959+00:00"}