{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:L743LN3JH7XKKAUI5NKSEIESRV","short_pith_number":"pith:L743LN3J","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"},"canonical_sha256":"5ff9b5b7693feea50288eb552220928d59d8874309c00df400d5a4fcf6ee5267","source":{"kind":"arxiv","id":"1907.11563","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11563","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11563v1","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11563","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"pith_short_12","alias_value":"L743LN3JH7XK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"L743LN3JH7XKKAUI","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"L743LN3J","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:L743LN3JH7XKKAUI5NKSEIESRV","target":"record","payload":{"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"},"canonical_sha256":"5ff9b5b7693feea50288eb552220928d59d8874309c00df400d5a4fcf6ee5267","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"},"source_kind":"arxiv","source_id":"1907.11563","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ufFbC5R3Jk9xemhR9ewKrv+46Xp56p4IQx4+CnU4dqjfwpJjHD6DdVO5LvJFjmxbT0Sq/gyzW5BAAOtjCzZMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:26:36.397261Z"},"content_sha256":"8ad55b908a284c7c24f66ef1eb089b2c87f0fe23dfc47b6b3c17a8e9e62475ab","schema_version":"1.0","event_id":"sha256:8ad55b908a284c7c24f66ef1eb089b2c87f0fe23dfc47b6b3c17a8e9e62475ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:L743LN3JH7XKKAUI5NKSEIESRV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7q2dzbhNhZ+sBsrj2ZzoJXU9lDTxzK2mcromSkmoCn4Ac1eWiXwJkqwQPnOIfd19HiVlPLfaF6E+AliOH/QUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:26:36.397871Z"},"content_sha256":"f33e63834c6d5aab46916930d69ac45d837bc6a4900a25c41b1f5958bb43591e","schema_version":"1.0","event_id":"sha256:f33e63834c6d5aab46916930d69ac45d837bc6a4900a25c41b1f5958bb43591e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L743LN3JH7XKKAUI5NKSEIESRV/bundle.json","state_url":"https://pith.science/pith/L743LN3JH7XKKAUI5NKSEIESRV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L743LN3JH7XKKAUI5NKSEIESRV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T12:26:36Z","links":{"resolver":"https://pith.science/pith/L743LN3JH7XKKAUI5NKSEIESRV","bundle":"https://pith.science/pith/L743LN3JH7XKKAUI5NKSEIESRV/bundle.json","state":"https://pith.science/pith/L743LN3JH7XKKAUI5NKSEIESRV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L743LN3JH7XKKAUI5NKSEIESRV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:L743LN3JH7XKKAUI5NKSEIESRV","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":"f41a701efab56b864d9940b4999f8c817770bc6310ac8d81269c29e34ccafeac","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-26T13:15:57Z","title_canon_sha256":"afb99e492cbb7d481139479c805dfdff4f05468dea2e31cddb5176b0b353b25f"},"schema_version":"1.0","source":{"id":"1907.11563","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11563","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11563v1","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11563","created_at":"2026-05-17T23:39:28Z"},{"alias_kind":"pith_short_12","alias_value":"L743LN3JH7XK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"L743LN3JH7XKKAUI","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"L743LN3J","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:f33e63834c6d5aab46916930d69ac45d837bc6a4900a25c41b1f5958bb43591e","target":"graph","created_at":"2026-05-17T23:39:28Z","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"},"paper":{"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","authors_text":"Furkan Ercan, Nghia Doan, Seyyed Ali Hashemi, Thibaud Tonnellier, Warren Gross","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-26T13:15:57Z","title":"Neural Dynamic Successive Cancellation Flip Decoding of Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11563","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:8ad55b908a284c7c24f66ef1eb089b2c87f0fe23dfc47b6b3c17a8e9e62475ab","target":"record","created_at":"2026-05-17T23:39:28Z","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":"f41a701efab56b864d9940b4999f8c817770bc6310ac8d81269c29e34ccafeac","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-26T13:15:57Z","title_canon_sha256":"afb99e492cbb7d481139479c805dfdff4f05468dea2e31cddb5176b0b353b25f"},"schema_version":"1.0","source":{"id":"1907.11563","kind":"arxiv","version":1}},"canonical_sha256":"5ff9b5b7693feea50288eb552220928d59d8874309c00df400d5a4fcf6ee5267","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ff9b5b7693feea50288eb552220928d59d8874309c00df400d5a4fcf6ee5267","first_computed_at":"2026-05-17T23:39:28.674779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:28.674779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2RXo8USPfatUbrnKvTTy44hNSvpgFzGxm/8haVE5XU5zMAwj8gPDobUchebEktRKsr10b5y31us4mxR7Jz9jDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:28.675434Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.11563","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ad55b908a284c7c24f66ef1eb089b2c87f0fe23dfc47b6b3c17a8e9e62475ab","sha256:f33e63834c6d5aab46916930d69ac45d837bc6a4900a25c41b1f5958bb43591e"],"state_sha256":"cdd372c043beda21b7b7cd5e9ccc715771b16973c0bb8888454ea0c0aa3cb4a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zEqhqDNiekCllWvv3JFAGp6qxc9pQ44znlkGorASBEJInNDTlZ3H6DyCOe8yWQzTaA5QnQQtz8XwLbdM/dLDAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:26:36.401396Z","bundle_sha256":"dc3785b7664b43c700b1193e8960b96ed3a1a4242a0895de53f39de0b8060c69"}}