{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NUNNOAUZFCPO7SXKQFUUOZARXG","short_pith_number":"pith:NUNNOAUZ","canonical_record":{"source":{"id":"1701.08126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-27T17:39:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"15dd6fd02f93a1c5928f5260147483e0ca29d63c40b3a1bf68f26117083a7afb","abstract_canon_sha256":"7466066fd7b0a02d51057c224aadb7e96b189bac9d7654cc8957708aa4dab500"},"schema_version":"1.0"},"canonical_sha256":"6d1ad70299289eefcaea8169476411b98c3a0ea9c2da4445a85951874b969b58","source":{"kind":"arxiv","id":"1701.08126","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08126","created_at":"2026-05-18T00:51:58Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08126v1","created_at":"2026-05-18T00:51:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08126","created_at":"2026-05-18T00:51:58Z"},{"alias_kind":"pith_short_12","alias_value":"NUNNOAUZFCPO","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NUNNOAUZFCPO7SXK","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NUNNOAUZ","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NUNNOAUZFCPO7SXKQFUUOZARXG","target":"record","payload":{"canonical_record":{"source":{"id":"1701.08126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-27T17:39:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"15dd6fd02f93a1c5928f5260147483e0ca29d63c40b3a1bf68f26117083a7afb","abstract_canon_sha256":"7466066fd7b0a02d51057c224aadb7e96b189bac9d7654cc8957708aa4dab500"},"schema_version":"1.0"},"canonical_sha256":"6d1ad70299289eefcaea8169476411b98c3a0ea9c2da4445a85951874b969b58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:58.784772Z","signature_b64":"+lK4h+/bxHFYTUrIVfbXVq3x6J9cV+gfGtQdNNDpBkOqevudjg8Hnka0Op0cW6barWwDjk7xx6xJAJFSdiKjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d1ad70299289eefcaea8169476411b98c3a0ea9c2da4445a85951874b969b58","last_reissued_at":"2026-05-18T00:51:58.784229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:58.784229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.08126","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-18T00:51:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5GzCZjby9/zg1cmqyFB7ysbDmjKsKptRrdGtPUao9+cMJWgikn/VEEroU7xrM/ZwFFkYs11fIGSfF6u/9qAHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:15:21.452570Z"},"content_sha256":"acc8e6c3ad69f2fc7d5d54b38ff7560bc430849f2a204bc22a7943955eb457eb","schema_version":"1.0","event_id":"sha256:acc8e6c3ad69f2fc7d5d54b38ff7560bc430849f2a204bc22a7943955eb457eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NUNNOAUZFCPO7SXKQFUUOZARXG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Simplified Successive-Cancellation List Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Carlo Condo, Seyyed Ali Hashemi, Warren J. Gross","submitted_at":"2017-01-27T17:39:53Z","abstract_excerpt":"Polar codes are capacity achieving error correcting codes that can be decoded through the successive-cancellation algorithm. To improve its error-correction performance, a list-based version called successive-cancellation list (SCL) has been proposed in the past, that however substantially increases the number of time-steps in the decoding process. The simplified SCL (SSCL) decoding algorithm exploits constituent codes within the polar code structure to greatly reduce the required number of time-steps without introducing any error-correction performance loss. In this paper, we propose a faster"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08126","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-18T00:51:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XifjbpDni1lNErxotizQRdPiroklYBtd1Bs/dMGm89YpJIdhXNixo0IQUI05mW1440WZJnAwuqmFRBIyHge+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:15:21.452922Z"},"content_sha256":"815cd1036e195f6ed889ef98992f549c20fcc0d4e7217c4e9d8dad4a44f4ece0","schema_version":"1.0","event_id":"sha256:815cd1036e195f6ed889ef98992f549c20fcc0d4e7217c4e9d8dad4a44f4ece0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NUNNOAUZFCPO7SXKQFUUOZARXG/bundle.json","state_url":"https://pith.science/pith/NUNNOAUZFCPO7SXKQFUUOZARXG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NUNNOAUZFCPO7SXKQFUUOZARXG/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-28T08:15:21Z","links":{"resolver":"https://pith.science/pith/NUNNOAUZFCPO7SXKQFUUOZARXG","bundle":"https://pith.science/pith/NUNNOAUZFCPO7SXKQFUUOZARXG/bundle.json","state":"https://pith.science/pith/NUNNOAUZFCPO7SXKQFUUOZARXG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NUNNOAUZFCPO7SXKQFUUOZARXG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NUNNOAUZFCPO7SXKQFUUOZARXG","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":"7466066fd7b0a02d51057c224aadb7e96b189bac9d7654cc8957708aa4dab500","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-27T17:39:53Z","title_canon_sha256":"15dd6fd02f93a1c5928f5260147483e0ca29d63c40b3a1bf68f26117083a7afb"},"schema_version":"1.0","source":{"id":"1701.08126","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08126","created_at":"2026-05-18T00:51:58Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08126v1","created_at":"2026-05-18T00:51:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08126","created_at":"2026-05-18T00:51:58Z"},{"alias_kind":"pith_short_12","alias_value":"NUNNOAUZFCPO","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NUNNOAUZFCPO7SXK","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NUNNOAUZ","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:815cd1036e195f6ed889ef98992f549c20fcc0d4e7217c4e9d8dad4a44f4ece0","target":"graph","created_at":"2026-05-18T00:51:58Z","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 capacity achieving error correcting codes that can be decoded through the successive-cancellation algorithm. To improve its error-correction performance, a list-based version called successive-cancellation list (SCL) has been proposed in the past, that however substantially increases the number of time-steps in the decoding process. The simplified SCL (SSCL) decoding algorithm exploits constituent codes within the polar code structure to greatly reduce the required number of time-steps without introducing any error-correction performance loss. In this paper, we propose a faster","authors_text":"Carlo Condo, Seyyed Ali Hashemi, Warren J. Gross","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-27T17:39:53Z","title":"Fast Simplified Successive-Cancellation List Decoding of Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08126","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:acc8e6c3ad69f2fc7d5d54b38ff7560bc430849f2a204bc22a7943955eb457eb","target":"record","created_at":"2026-05-18T00:51:58Z","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":"7466066fd7b0a02d51057c224aadb7e96b189bac9d7654cc8957708aa4dab500","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-27T17:39:53Z","title_canon_sha256":"15dd6fd02f93a1c5928f5260147483e0ca29d63c40b3a1bf68f26117083a7afb"},"schema_version":"1.0","source":{"id":"1701.08126","kind":"arxiv","version":1}},"canonical_sha256":"6d1ad70299289eefcaea8169476411b98c3a0ea9c2da4445a85951874b969b58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d1ad70299289eefcaea8169476411b98c3a0ea9c2da4445a85951874b969b58","first_computed_at":"2026-05-18T00:51:58.784229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:58.784229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+lK4h+/bxHFYTUrIVfbXVq3x6J9cV+gfGtQdNNDpBkOqevudjg8Hnka0Op0cW6barWwDjk7xx6xJAJFSdiKjDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:58.784772Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08126","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acc8e6c3ad69f2fc7d5d54b38ff7560bc430849f2a204bc22a7943955eb457eb","sha256:815cd1036e195f6ed889ef98992f549c20fcc0d4e7217c4e9d8dad4a44f4ece0"],"state_sha256":"57e79efce020698dfd5a525175290e1260f6be74d036dd49ff2a1d11978b426d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jy4wQgtvzOImi397E2ht8mjp1CenAbISzT9XQ3owTyvJn+pFfa16wNCFG0mD8mLPtRHWZG8/KEW1xzKUljQ3CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:15:21.454872Z","bundle_sha256":"7ca1adac76b83d2d7251f3140235bafaa8691c4bdb88338e94fe5cd97c9a613a"}}