{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:7AAHMF7VICEP5SZPAKUYQ35YU6","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":"34442a00f6b679be67c61ec600d5de168c6fc73c3350f41f32d27c68e5190e07","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-04-26T07:20:44Z","title_canon_sha256":"7de6bcb3c4c02f4e0f3033955925d2dfd33cab598f5ab4a967b3b8b35324edc4"},"schema_version":"1.0","source":{"id":"2204.12115","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.12115","created_at":"2026-07-05T05:17:10Z"},{"alias_kind":"arxiv_version","alias_value":"2204.12115v3","created_at":"2026-07-05T05:17:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.12115","created_at":"2026-07-05T05:17:10Z"},{"alias_kind":"pith_short_12","alias_value":"7AAHMF7VICEP","created_at":"2026-07-05T05:17:10Z"},{"alias_kind":"pith_short_16","alias_value":"7AAHMF7VICEP5SZP","created_at":"2026-07-05T05:17:10Z"},{"alias_kind":"pith_short_8","alias_value":"7AAHMF7V","created_at":"2026-07-05T05:17:10Z"}],"graph_snapshots":[{"event_id":"sha256:04ba0b2eebf5cb6073b34ff25f6996f70626090d1f0741b8fa218264efba8d80","target":"graph","created_at":"2026-07-05T05:17:10Z","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/2204.12115/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Due to the sequential nature of the successive-cancellation (SC) algorithm, the decoding of polar codes suffers from significant decoding latencies. Fast SC decoding is able to speed up the SC decoding process, by implementing parallel decoders at the intermediate levels of the SC decoding tree for some special nodes with specific information and frozen bit patterns. To further improve the parallelism of SC decoding, this paper present a new class of special nodes composed of a sequence of rate one or single-parity-check (SR1/SPC) nodes, which can be easily found especially in high-rate polar ","authors_text":"Ming Lei, Ming-Min Zhao, Min-Jian Zhao, Yang Lu","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-04-26T07:20:44Z","title":"Fast Successive-Cancellation Decoding of Polar Codes with Sequence Nodes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.12115","kind":"arxiv","version":3},"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:c46eeb98a4d7345a5621db43f8fb3a67ec7d51584590e3ce239c95b21fc1a636","target":"record","created_at":"2026-07-05T05:17:10Z","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":"34442a00f6b679be67c61ec600d5de168c6fc73c3350f41f32d27c68e5190e07","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-04-26T07:20:44Z","title_canon_sha256":"7de6bcb3c4c02f4e0f3033955925d2dfd33cab598f5ab4a967b3b8b35324edc4"},"schema_version":"1.0","source":{"id":"2204.12115","kind":"arxiv","version":3}},"canonical_sha256":"f8007617f54088fecb2f02a9886fb8a7adc8613c8386f40ddeb8a69b8612c1bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8007617f54088fecb2f02a9886fb8a7adc8613c8386f40ddeb8a69b8612c1bf","first_computed_at":"2026-07-05T05:17:10.652717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:17:10.652717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rW/QBk9VXkTghq/njtJBth+czQ7OTuZ9OARiQ7YRRmbpJHDzbT+iwP7OCS1Ojq2v6ZxblDdx2CUrjcgrNp1zBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:17:10.653087Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.12115","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c46eeb98a4d7345a5621db43f8fb3a67ec7d51584590e3ce239c95b21fc1a636","sha256:04ba0b2eebf5cb6073b34ff25f6996f70626090d1f0741b8fa218264efba8d80"],"state_sha256":"c12c9cafdf3a93823d59a1b40b6ca6054102f90b477377e544707f1c0e3713d7"}