{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:L743LN3JH7XKKAUI5NKSEIESRV","short_pith_number":"pith:L743LN3J","schema_version":"1.0","canonical_sha256":"5ff9b5b7693feea50288eb552220928d59d8874309c00df400d5a4fcf6ee5267","source":{"kind":"arxiv","id":"1907.11563","version":1},"attestation_state":"computed","paper":{"title":"Neural Dynamic Successive Cancellation Flip Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Furkan Ercan, Nghia Doan, Seyyed Ali Hashemi, Thibaud Tonnellier, Warren Gross","submitted_at":"2019-07-26T13:15:57Z","abstract_excerpt":"Dynamic successive cancellation flip (DSCF) decoding of polar codes is a powerful algorithm that can achieve the error correction performance of successive cancellation list (SCL) decoding, with a complexity that is close to that of successive cancellation (SC) decoding at practical signal-to-noise ratio (SNR) regimes. However, DSCF decoding requires costly transcendental computations which adversely affect its implementation complexity. In this paper, we first show that a direct application of common approximation schemes on the conventional DSCF decoding results in significant error-correcti"},"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":"1907.11563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-26T13:15:57Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"afb99e492cbb7d481139479c805dfdff4f05468dea2e31cddb5176b0b353b25f","abstract_canon_sha256":"f41a701efab56b864d9940b4999f8c817770bc6310ac8d81269c29e34ccafeac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:28.675434Z","signature_b64":"2RXo8USPfatUbrnKvTTy44hNSvpgFzGxm/8haVE5XU5zMAwj8gPDobUchebEktRKsr10b5y31us4mxR7Jz9jDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ff9b5b7693feea50288eb552220928d59d8874309c00df400d5a4fcf6ee5267","last_reissued_at":"2026-05-17T23:39:28.674779Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:28.674779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Dynamic Successive Cancellation Flip Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Furkan Ercan, Nghia Doan, Seyyed Ali Hashemi, Thibaud Tonnellier, Warren Gross","submitted_at":"2019-07-26T13:15:57Z","abstract_excerpt":"Dynamic successive cancellation flip (DSCF) decoding of polar codes is a powerful algorithm that can achieve the error correction performance of successive cancellation list (SCL) decoding, with a complexity that is close to that of successive cancellation (SC) decoding at practical signal-to-noise ratio (SNR) regimes. However, DSCF decoding requires costly transcendental computations which adversely affect its implementation complexity. In this paper, we first show that a direct application of common approximation schemes on the conventional DSCF decoding results in significant error-correcti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11563","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":""},"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":"1907.11563","created_at":"2026-05-17T23:39:28.674875+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.11563v1","created_at":"2026-05-17T23:39:28.674875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11563","created_at":"2026-05-17T23:39:28.674875+00:00"},{"alias_kind":"pith_short_12","alias_value":"L743LN3JH7XK","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"L743LN3JH7XKKAUI","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"L743LN3J","created_at":"2026-05-18T12:33:21.387695+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/L743LN3JH7XKKAUI5NKSEIESRV","json":"https://pith.science/pith/L743LN3JH7XKKAUI5NKSEIESRV.json","graph_json":"https://pith.science/api/pith-number/L743LN3JH7XKKAUI5NKSEIESRV/graph.json","events_json":"https://pith.science/api/pith-number/L743LN3JH7XKKAUI5NKSEIESRV/events.json","paper":"https://pith.science/paper/L743LN3J"},"agent_actions":{"view_html":"https://pith.science/pith/L743LN3JH7XKKAUI5NKSEIESRV","download_json":"https://pith.science/pith/L743LN3JH7XKKAUI5NKSEIESRV.json","view_paper":"https://pith.science/paper/L743LN3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.11563&json=true","fetch_graph":"https://pith.science/api/pith-number/L743LN3JH7XKKAUI5NKSEIESRV/graph.json","fetch_events":"https://pith.science/api/pith-number/L743LN3JH7XKKAUI5NKSEIESRV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L743LN3JH7XKKAUI5NKSEIESRV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L743LN3JH7XKKAUI5NKSEIESRV/action/storage_attestation","attest_author":"https://pith.science/pith/L743LN3JH7XKKAUI5NKSEIESRV/action/author_attestation","sign_citation":"https://pith.science/pith/L743LN3JH7XKKAUI5NKSEIESRV/action/citation_signature","submit_replication":"https://pith.science/pith/L743LN3JH7XKKAUI5NKSEIESRV/action/replication_record"}},"created_at":"2026-05-17T23:39:28.674875+00:00","updated_at":"2026-05-17T23:39:28.674875+00:00"}