{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HKCHFLQ3VU6EXISHAMYWKZQECG","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":"6250c5fb6e359b5cac19d459fed58200143b71b533bdc0936f1b994cd28a7e6e","cross_cats_sorted":["cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-01T19:55:06Z","title_canon_sha256":"46891d1150e126fbc5a4fab81c1de34ec0cd4cdf123513bad9f961b71f9f2114"},"schema_version":"1.0","source":{"id":"1504.00353","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00353","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00353v2","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00353","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"HKCHFLQ3VU6E","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HKCHFLQ3VU6EXISH","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HKCHFLQ3","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:1c195363bf4ebd63071883a87ed26dcfbf50f804f2169eab87f01dd646137dfc","target":"graph","created_at":"2026-05-18T01:11:18Z","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":"Polar codes are a new class of capacity-achieving error-correcting codes with low encoding and decoding complexity. Their low-complexity decoding algorithms rendering them attractive for use in software-defined radio applications where computational resources are limited. In this work, we present low-latency software polar decoders that exploit modern processor capabilities. We show how adapting the algorithm at various levels can lead to significant improvements in latency and throughput, yielding polar decoders that are suitable for high-performance software-defined radio applications on mod","authors_text":"Camille Leroux, Claude Thibeault, Gabi Sarkis, Pascal Giard, Warren J. Gross","cross_cats":["cs.PF","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-01T19:55:06Z","title":"Low-Latency Software Polar Decoders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00353","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:044e0a251a43aedd87ed806dee7415b45834e8f7eb30850d26303a5236fea503","target":"record","created_at":"2026-05-18T01:11:18Z","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":"6250c5fb6e359b5cac19d459fed58200143b71b533bdc0936f1b994cd28a7e6e","cross_cats_sorted":["cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-01T19:55:06Z","title_canon_sha256":"46891d1150e126fbc5a4fab81c1de34ec0cd4cdf123513bad9f961b71f9f2114"},"schema_version":"1.0","source":{"id":"1504.00353","kind":"arxiv","version":2}},"canonical_sha256":"3a8472ae1bad3c4ba247033165660411a8ebfab3930ff3868143c9317af16502","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a8472ae1bad3c4ba247033165660411a8ebfab3930ff3868143c9317af16502","first_computed_at":"2026-05-18T01:11:18.368905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:18.368905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O/L4zv+SMFiKNiKXMHrN3gf3ehED6ZzPbLOCcb1+7gHLmWSd1QaI6MnMKsiMXOZQCeJ6cUh3ZHNLamwlamDXAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:18.369355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00353","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:044e0a251a43aedd87ed806dee7415b45834e8f7eb30850d26303a5236fea503","sha256:1c195363bf4ebd63071883a87ed26dcfbf50f804f2169eab87f01dd646137dfc"],"state_sha256":"7594007835f95f8c6abb93f90cc589b01fe581e2b2db359246c7d7eb95ec5889"}