{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YTU3AOLXKBJ5J62RUWOVBLZT67","short_pith_number":"pith:YTU3AOLX","canonical_record":{"source":{"id":"1712.00165","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-01T02:44:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4544a19c1031ad6fee58ca2a4e45ddc61e4d3c766eff0871d62b743a20a19159","abstract_canon_sha256":"803873d12c2f7ffb3beba6b728b1f5955aa4661c364140080bcf779d3c596c2a"},"schema_version":"1.0"},"canonical_sha256":"c4e9b039775053d4fb51a59d50af33f7fa22e4f0977d83e21367315890f04fe2","source":{"kind":"arxiv","id":"1712.00165","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00165","created_at":"2026-05-18T00:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00165v2","created_at":"2026-05-18T00:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00165","created_at":"2026-05-18T00:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"YTU3AOLXKBJ5","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YTU3AOLXKBJ5J62R","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YTU3AOLX","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YTU3AOLXKBJ5J62RUWOVBLZT67","target":"record","payload":{"canonical_record":{"source":{"id":"1712.00165","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-01T02:44:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4544a19c1031ad6fee58ca2a4e45ddc61e4d3c766eff0871d62b743a20a19159","abstract_canon_sha256":"803873d12c2f7ffb3beba6b728b1f5955aa4661c364140080bcf779d3c596c2a"},"schema_version":"1.0"},"canonical_sha256":"c4e9b039775053d4fb51a59d50af33f7fa22e4f0977d83e21367315890f04fe2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:04.358892Z","signature_b64":"j/cGqx5DIKF4hSvhICl4E4yKk82OxAN0fP5jJ3oh4m3q/02D9Y0UmRTxtoEfdb2n+fHyn1LRx/+zKfHUMsMCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4e9b039775053d4fb51a59d50af33f7fa22e4f0977d83e21367315890f04fe2","last_reissued_at":"2026-05-18T00:28:04.358195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:04.358195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.00165","source_version":2,"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:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPThxLuE5tMOQjzRXr7jWLO/fdpvF7yxFjjO7qOdd7VX8ztFri6KHUxSX9AUGM7+NJDNhayDL9mAF6c1iwrtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:29:27.524682Z"},"content_sha256":"53989b921fb6ba8baf7f343484fa8b28466b3b27fba46b820e0573db9fd4b42d","schema_version":"1.0","event_id":"sha256:53989b921fb6ba8baf7f343484fa8b28466b3b27fba46b820e0573db9fd4b42d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YTU3AOLXKBJ5J62RUWOVBLZT67","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Capacity-Achievability of Polar Codes and Precoded Polar Codes under List Decoding: They are Good both Practically and Theoretically","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ba-Zhong Shen, Lijuan Xing, Zhuo Li","submitted_at":"2017-12-01T02:44:37Z","abstract_excerpt":"Polar codes under successive cancellation decoding proposed by Ar{\\i}kan provably achieve the symmetric capacity of any given binary-input discrete memoryless channel. The successive cancellation list decoder for polar codes was described by Tal and Vardy as a generalization of the successive cancellation decoder of Ar{\\i}kan. The performance of the successive cancellation list decoder is encouraging in practice. In this paper, we formalize the successive cancellation list decoder in our notation and prove that polar codes under successive cancellation list decoding achieve the symmetric capac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00165","kind":"arxiv","version":2},"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:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SOBq91Dig6hl7RK7wt48FCg1hQ55L/ye4gMZWSL1RY7zRZESHz9OxT8GnlXYCcZ7alyJ2Mcm1KgISNMmX0zMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:29:27.525028Z"},"content_sha256":"bcb8b9e362c3a505fbd594b28c40a7abfe434f1660ecd965556ef59b332eab5b","schema_version":"1.0","event_id":"sha256:bcb8b9e362c3a505fbd594b28c40a7abfe434f1660ecd965556ef59b332eab5b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YTU3AOLXKBJ5J62RUWOVBLZT67/bundle.json","state_url":"https://pith.science/pith/YTU3AOLXKBJ5J62RUWOVBLZT67/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YTU3AOLXKBJ5J62RUWOVBLZT67/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-06-05T16:29:27Z","links":{"resolver":"https://pith.science/pith/YTU3AOLXKBJ5J62RUWOVBLZT67","bundle":"https://pith.science/pith/YTU3AOLXKBJ5J62RUWOVBLZT67/bundle.json","state":"https://pith.science/pith/YTU3AOLXKBJ5J62RUWOVBLZT67/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YTU3AOLXKBJ5J62RUWOVBLZT67/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YTU3AOLXKBJ5J62RUWOVBLZT67","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":"803873d12c2f7ffb3beba6b728b1f5955aa4661c364140080bcf779d3c596c2a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-01T02:44:37Z","title_canon_sha256":"4544a19c1031ad6fee58ca2a4e45ddc61e4d3c766eff0871d62b743a20a19159"},"schema_version":"1.0","source":{"id":"1712.00165","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00165","created_at":"2026-05-18T00:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00165v2","created_at":"2026-05-18T00:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00165","created_at":"2026-05-18T00:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"YTU3AOLXKBJ5","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YTU3AOLXKBJ5J62R","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YTU3AOLX","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:bcb8b9e362c3a505fbd594b28c40a7abfe434f1660ecd965556ef59b332eab5b","target":"graph","created_at":"2026-05-18T00:28:04Z","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 under successive cancellation decoding proposed by Ar{\\i}kan provably achieve the symmetric capacity of any given binary-input discrete memoryless channel. The successive cancellation list decoder for polar codes was described by Tal and Vardy as a generalization of the successive cancellation decoder of Ar{\\i}kan. The performance of the successive cancellation list decoder is encouraging in practice. In this paper, we formalize the successive cancellation list decoder in our notation and prove that polar codes under successive cancellation list decoding achieve the symmetric capac","authors_text":"Ba-Zhong Shen, Lijuan Xing, Zhuo Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-01T02:44:37Z","title":"Capacity-Achievability of Polar Codes and Precoded Polar Codes under List Decoding: They are Good both Practically and Theoretically"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00165","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:53989b921fb6ba8baf7f343484fa8b28466b3b27fba46b820e0573db9fd4b42d","target":"record","created_at":"2026-05-18T00:28:04Z","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":"803873d12c2f7ffb3beba6b728b1f5955aa4661c364140080bcf779d3c596c2a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-01T02:44:37Z","title_canon_sha256":"4544a19c1031ad6fee58ca2a4e45ddc61e4d3c766eff0871d62b743a20a19159"},"schema_version":"1.0","source":{"id":"1712.00165","kind":"arxiv","version":2}},"canonical_sha256":"c4e9b039775053d4fb51a59d50af33f7fa22e4f0977d83e21367315890f04fe2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4e9b039775053d4fb51a59d50af33f7fa22e4f0977d83e21367315890f04fe2","first_computed_at":"2026-05-18T00:28:04.358195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:04.358195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j/cGqx5DIKF4hSvhICl4E4yKk82OxAN0fP5jJ3oh4m3q/02D9Y0UmRTxtoEfdb2n+fHyn1LRx/+zKfHUMsMCCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:04.358892Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00165","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53989b921fb6ba8baf7f343484fa8b28466b3b27fba46b820e0573db9fd4b42d","sha256:bcb8b9e362c3a505fbd594b28c40a7abfe434f1660ecd965556ef59b332eab5b"],"state_sha256":"b24de0c12862b10dae27f78613754245f2bdae69b62e0a7939d903e0dbc2fe4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pzZqVpv6SiZ4e4CjUdM0hqLJVNiCTYNyo4Z0aC6Cf0+8wvm1VM+bLTPW5h1csOoB23xFU0Q/zOrufpWNiH6xDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:29:27.527140Z","bundle_sha256":"8e919fe24b7f1238fdfb800f0909ac31c18a93dee6f7fdbba4405ab1ff089026"}}