{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PZEWOH2CTEHNAM73OJQWFVXQC6","short_pith_number":"pith:PZEWOH2C","canonical_record":{"source":{"id":"1809.03606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-10T21:32:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eb55582394936adf1c9ea223ab9b6e19038ae0a7aafd57255c502a9de6c8b207","abstract_canon_sha256":"f52574d4980ada33a38c150152d6147cd08f2ffdd3e6fd7adcb45efa59c2d7aa"},"schema_version":"1.0"},"canonical_sha256":"7e49671f42990ed033fb726162d6f0178b2c03c6364fb20b85fd71c16b4cc546","source":{"kind":"arxiv","id":"1809.03606","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03606","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03606v1","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03606","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"pith_short_12","alias_value":"PZEWOH2CTEHN","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PZEWOH2CTEHNAM73","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PZEWOH2C","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PZEWOH2CTEHNAM73OJQWFVXQC6","target":"record","payload":{"canonical_record":{"source":{"id":"1809.03606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-10T21:32:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eb55582394936adf1c9ea223ab9b6e19038ae0a7aafd57255c502a9de6c8b207","abstract_canon_sha256":"f52574d4980ada33a38c150152d6147cd08f2ffdd3e6fd7adcb45efa59c2d7aa"},"schema_version":"1.0"},"canonical_sha256":"7e49671f42990ed033fb726162d6f0178b2c03c6364fb20b85fd71c16b4cc546","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:00.340223Z","signature_b64":"RQTRKRh0X/GIZUqON86WQZ4sVrJxAkElpOXthGz02ExVg/aLILVfbAutgmph8InKbOJPqYJR6EkSV/XvG+LdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e49671f42990ed033fb726162d6f0178b2c03c6364fb20b85fd71c16b4cc546","last_reissued_at":"2026-05-18T00:06:00.339625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:00.339625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.03606","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:06:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LSL96yf8205/nPZx8dYGLs9VcwsIN3iXfmKb5R5A4cj6H3zLVKlbu+knpR8tcdgmlZmkvAQVtbL24NYzJ+RZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:11:05.065196Z"},"content_sha256":"9b44c09d132f2cf8d38210d402c1575e9676bab2d7dbcc34d916f10c8e273842","schema_version":"1.0","event_id":"sha256:9b44c09d132f2cf8d38210d402c1575e9676bab2d7dbcc34d916f10c8e273842"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PZEWOH2CTEHNAM73OJQWFVXQC6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Practical Software Stack Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Harsh Aurora, Warren J. Gross","submitted_at":"2018-09-10T21:32:09Z","abstract_excerpt":"The successive cancellation list decoding algorithm for polar codes yields near-optimal decoding performance at the cost of high implementation complexity. The successive cancellation stack algorithm has been shown to provide similar decoding performance at a much lower computational complexity, but software implementations report a sub-par T/P performance. In this technical report, the benefits of the fast simplified successive cancellation list decoder are extended to the stack algorithm, resulting in a throughput increase by two orders of magnitude over the traditional stack decoder."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03606","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:06:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ZSkLPzhQauh5AaQhCjvMks81MDhfE5R8XnSyQuaoQy+J2JwSYYlylYi42kmuolvecPuYx/Iym89Vu05lKhIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:11:05.065856Z"},"content_sha256":"d0a80815054e8a2ecdaa38d983f13872864529ff5e57d82b138a6923af3759ab","schema_version":"1.0","event_id":"sha256:d0a80815054e8a2ecdaa38d983f13872864529ff5e57d82b138a6923af3759ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PZEWOH2CTEHNAM73OJQWFVXQC6/bundle.json","state_url":"https://pith.science/pith/PZEWOH2CTEHNAM73OJQWFVXQC6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PZEWOH2CTEHNAM73OJQWFVXQC6/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-27T09:11:05Z","links":{"resolver":"https://pith.science/pith/PZEWOH2CTEHNAM73OJQWFVXQC6","bundle":"https://pith.science/pith/PZEWOH2CTEHNAM73OJQWFVXQC6/bundle.json","state":"https://pith.science/pith/PZEWOH2CTEHNAM73OJQWFVXQC6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PZEWOH2CTEHNAM73OJQWFVXQC6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PZEWOH2CTEHNAM73OJQWFVXQC6","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":"f52574d4980ada33a38c150152d6147cd08f2ffdd3e6fd7adcb45efa59c2d7aa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-10T21:32:09Z","title_canon_sha256":"eb55582394936adf1c9ea223ab9b6e19038ae0a7aafd57255c502a9de6c8b207"},"schema_version":"1.0","source":{"id":"1809.03606","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03606","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03606v1","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03606","created_at":"2026-05-18T00:06:00Z"},{"alias_kind":"pith_short_12","alias_value":"PZEWOH2CTEHN","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PZEWOH2CTEHNAM73","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PZEWOH2C","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:d0a80815054e8a2ecdaa38d983f13872864529ff5e57d82b138a6923af3759ab","target":"graph","created_at":"2026-05-18T00:06:00Z","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":"The successive cancellation list decoding algorithm for polar codes yields near-optimal decoding performance at the cost of high implementation complexity. The successive cancellation stack algorithm has been shown to provide similar decoding performance at a much lower computational complexity, but software implementations report a sub-par T/P performance. In this technical report, the benefits of the fast simplified successive cancellation list decoder are extended to the stack algorithm, resulting in a throughput increase by two orders of magnitude over the traditional stack decoder.","authors_text":"Harsh Aurora, Warren J. Gross","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-10T21:32:09Z","title":"Towards Practical Software Stack Decoding of Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03606","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:9b44c09d132f2cf8d38210d402c1575e9676bab2d7dbcc34d916f10c8e273842","target":"record","created_at":"2026-05-18T00:06:00Z","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":"f52574d4980ada33a38c150152d6147cd08f2ffdd3e6fd7adcb45efa59c2d7aa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-09-10T21:32:09Z","title_canon_sha256":"eb55582394936adf1c9ea223ab9b6e19038ae0a7aafd57255c502a9de6c8b207"},"schema_version":"1.0","source":{"id":"1809.03606","kind":"arxiv","version":1}},"canonical_sha256":"7e49671f42990ed033fb726162d6f0178b2c03c6364fb20b85fd71c16b4cc546","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e49671f42990ed033fb726162d6f0178b2c03c6364fb20b85fd71c16b4cc546","first_computed_at":"2026-05-18T00:06:00.339625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:00.339625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RQTRKRh0X/GIZUqON86WQZ4sVrJxAkElpOXthGz02ExVg/aLILVfbAutgmph8InKbOJPqYJR6EkSV/XvG+LdAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:00.340223Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.03606","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b44c09d132f2cf8d38210d402c1575e9676bab2d7dbcc34d916f10c8e273842","sha256:d0a80815054e8a2ecdaa38d983f13872864529ff5e57d82b138a6923af3759ab"],"state_sha256":"414391ddfbb6eb2c567f081344a22c8ba3b5c931ac15eeff5ca5c8802187b5dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ESvellJa4QcVNA0QL/+hUbHzSzQv9s6e79Coxim9uh5Pg8QkYzRQCv6THbFdm+8KiTGGu+NSSaBMq6eKpyQJBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:11:05.069485Z","bundle_sha256":"f494927eccfc9c4de8aad0814ed8bfec0ecffa1d27575e47d2b223b1977acdde"}}