{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HK2H4OV2DVWMNYX6Z23EO4KZCM","short_pith_number":"pith:HK2H4OV2","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"},"canonical_sha256":"3ab47e3aba1d6cc6e2feceb6477159130fff9a7abfb9863a26ec6ce3eee1cdf2","source":{"kind":"arxiv","id":"2605.23124","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23124","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23124v1","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23124","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"HK2H4OV2DVWM","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"pith_short_16","alias_value":"HK2H4OV2DVWMNYX6","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"pith_short_8","alias_value":"HK2H4OV2","created_at":"2026-05-25T02:01:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HK2H4OV2DVWMNYX6Z23EO4KZCM","target":"record","payload":{"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"},"canonical_sha256":"3ab47e3aba1d6cc6e2feceb6477159130fff9a7abfb9863a26ec6ce3eee1cdf2","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"},"source_kind":"arxiv","source_id":"2605.23124","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-25T02:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aizy6TUxVPkT4drP+rR7xgrUxZ0XBWqyU2w6oiVAmMMwa//EZ4DwQGmm74TLnJ8qIQjGTlg2o5dhBeuIoHDjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:15:43.504512Z"},"content_sha256":"e888b218f4fb17b7040066011b61f0706ff3256de2f6a1ca2b15df18db6cae5e","schema_version":"1.0","event_id":"sha256:e888b218f4fb17b7040066011b61f0706ff3256de2f6a1ca2b15df18db6cae5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HK2H4OV2DVWMNYX6Z23EO4KZCM","target":"graph","payload":{"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"},"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-25T02:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BluzBtI0z2rs56RmC+FVLHHdOwd4tyoUzClt8ndwqpWD1dcx/Lu6PnT1Htp2/muNl1IGXVXI94i6jPqYTf5hCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:15:43.505309Z"},"content_sha256":"08cae26cb409d9191dce3f2e5fbf0c0a699954a881beafdc243cd5ae0ebe0e31","schema_version":"1.0","event_id":"sha256:08cae26cb409d9191dce3f2e5fbf0c0a699954a881beafdc243cd5ae0ebe0e31"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HK2H4OV2DVWMNYX6Z23EO4KZCM/bundle.json","state_url":"https://pith.science/pith/HK2H4OV2DVWMNYX6Z23EO4KZCM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HK2H4OV2DVWMNYX6Z23EO4KZCM/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-25T23:15:43Z","links":{"resolver":"https://pith.science/pith/HK2H4OV2DVWMNYX6Z23EO4KZCM","bundle":"https://pith.science/pith/HK2H4OV2DVWMNYX6Z23EO4KZCM/bundle.json","state":"https://pith.science/pith/HK2H4OV2DVWMNYX6Z23EO4KZCM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HK2H4OV2DVWMNYX6Z23EO4KZCM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HK2H4OV2DVWMNYX6Z23EO4KZCM","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":"790e0765fc95eac48e3cdd8282995bb16843411f63a6122de584106998976222","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-22T00:48:01Z","title_canon_sha256":"4e5243dc31914789252fd07b7804a328b52ca39d17a9b4b91e7aa27b33ee83f7"},"schema_version":"1.0","source":{"id":"2605.23124","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23124","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23124v1","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23124","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"HK2H4OV2DVWM","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"pith_short_16","alias_value":"HK2H4OV2DVWMNYX6","created_at":"2026-05-25T02:01:39Z"},{"alias_kind":"pith_short_8","alias_value":"HK2H4OV2","created_at":"2026-05-25T02:01:39Z"}],"graph_snapshots":[{"event_id":"sha256:08cae26cb409d9191dce3f2e5fbf0c0a699954a881beafdc243cd5ae0ebe0e31","target":"graph","created_at":"2026-05-25T02:01:39Z","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/2605.23124/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Fu-Siang Liang, Shan Lu, Yeong-Luh Ueng","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-22T00:48:01Z","title":"Deep-Learning-Aided Successive Cancellation List Flip Decoding for Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23124","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:e888b218f4fb17b7040066011b61f0706ff3256de2f6a1ca2b15df18db6cae5e","target":"record","created_at":"2026-05-25T02:01:39Z","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":"790e0765fc95eac48e3cdd8282995bb16843411f63a6122de584106998976222","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2026-05-22T00:48:01Z","title_canon_sha256":"4e5243dc31914789252fd07b7804a328b52ca39d17a9b4b91e7aa27b33ee83f7"},"schema_version":"1.0","source":{"id":"2605.23124","kind":"arxiv","version":1}},"canonical_sha256":"3ab47e3aba1d6cc6e2feceb6477159130fff9a7abfb9863a26ec6ce3eee1cdf2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ab47e3aba1d6cc6e2feceb6477159130fff9a7abfb9863a26ec6ce3eee1cdf2","first_computed_at":"2026-05-25T02:01:39.425151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:39.425151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EXJiyTK8XIo66OQoqVDpNUiHhibSpE5CNyVaigYp0n5fHNRAzVb/CHXeIWszkXwnH4rtRoCJxHs+IAx8eXhdDw==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:39.425894Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.23124","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e888b218f4fb17b7040066011b61f0706ff3256de2f6a1ca2b15df18db6cae5e","sha256:08cae26cb409d9191dce3f2e5fbf0c0a699954a881beafdc243cd5ae0ebe0e31"],"state_sha256":"bb1e1c286171401f2fa3edffb8703b9dcbdaf61cb33a8777391c53054dc63992"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dXFS1Q2z/4ZixRcI6XGHgx67tEvvT51rMSibSQuxEN94wIZhfffthXltmxulBCsXNZpAms7fhBc9j3p6QHAvAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:15:43.509192Z","bundle_sha256":"e0f953bb9aa62667d9406d283f847492a5e455c3673cb3f1bd106062f1888af0"}}