{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:T7TY4Z7MSSO3X2G3QLHLVKAEUG","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":"d762d708891a151f58c0d61b3c6c5be1dba88a3cc9579fb883b0c401477b639b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-10-19T11:27:27Z","title_canon_sha256":"0fc7c065e7ae6c5e6f16046b4b465ccc7fe680a1ace9101ce720762583ba327f"},"schema_version":"1.0","source":{"id":"2410.15071","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.15071","created_at":"2026-07-05T09:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"2410.15071v2","created_at":"2026-07-05T09:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.15071","created_at":"2026-07-05T09:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"T7TY4Z7MSSO3","created_at":"2026-07-05T09:53:06Z"},{"alias_kind":"pith_short_16","alias_value":"T7TY4Z7MSSO3X2G3","created_at":"2026-07-05T09:53:06Z"},{"alias_kind":"pith_short_8","alias_value":"T7TY4Z7M","created_at":"2026-07-05T09:53:06Z"}],"graph_snapshots":[{"event_id":"sha256:e6e5dd2e651e136b592dae25a6137eb007d4b02765d4be59652d7fd42d599ae0","target":"graph","created_at":"2026-07-05T09:53:06Z","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/2410.15071/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The soft-output successive cancellation list (SOSCL) decoder provides a methodology for estimating the a-posteriori probability log-likelihood ratios by only leveraging the conventional SCL decoder for polar codes. However, the sequential nature of SCL decoding leads to a high decoding latency for the SO-SCL decoder. In this paper, we propose a soft-output fast SCL (SO-FSCL) decoder by incorporating node-based fast decoding into the SO-SCL framework. Simulation results demonstrate that the proposed SO-FSCL decoder significantly reduces the decoding latency without loss of performance compared ","authors_text":"Li Shen, Wenjun Zhang, Xiaohu You, Xiqi Gao, Yin Xu, Yongpeng Wu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-10-19T11:27:27Z","title":"Soft-Output Fast Successive-Cancellation List Decoder for Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.15071","kind":"arxiv","version":2},"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:5e825a2e2e14b8e704094e09fe576259a72c5d19bdca2d298c5dfe02dd58191c","target":"record","created_at":"2026-07-05T09:53:06Z","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":"d762d708891a151f58c0d61b3c6c5be1dba88a3cc9579fb883b0c401477b639b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-10-19T11:27:27Z","title_canon_sha256":"0fc7c065e7ae6c5e6f16046b4b465ccc7fe680a1ace9101ce720762583ba327f"},"schema_version":"1.0","source":{"id":"2410.15071","kind":"arxiv","version":2}},"canonical_sha256":"9fe78e67ec949dbbe8db82cebaa804a18f52b632df96b07d8e3502561d9b9ead","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fe78e67ec949dbbe8db82cebaa804a18f52b632df96b07d8e3502561d9b9ead","first_computed_at":"2026-07-05T09:53:06.481052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:53:06.481052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E1IavV6TYf4UY0PJuI52zL9Nk2IZT+OJJZcAo6R3mxaz8hYvW91JfI/JYIXn+PMraEy4BpgEgvjAhZUEKwKFBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:53:06.481580Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.15071","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e825a2e2e14b8e704094e09fe576259a72c5d19bdca2d298c5dfe02dd58191c","sha256:e6e5dd2e651e136b592dae25a6137eb007d4b02765d4be59652d7fd42d599ae0"],"state_sha256":"dab3b15e7b5d2c971debab2ccf39bac5479adfbbe0eab98cda292de4395ef790"}