{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:L3A7UU5E4R6UVWKNG6UK7NRHJB","short_pith_number":"pith:L3A7UU5E","canonical_record":{"source":{"id":"1712.02053","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-06T06:18:30Z","cross_cats_sorted":["cs.AR","math.IT"],"title_canon_sha256":"7ffc75e6fefdd93ab24320eaaf9d47c35161d02c14383cc496c50034086c1f76","abstract_canon_sha256":"af72ab004044b7c8f82a19a2f254bc658f317b5f6feda597120da83d43f3b386"},"schema_version":"1.0"},"canonical_sha256":"5ec1fa53a4e47d4ad94d37a8afb62748669f570e9f140f58142bcd1be42a765d","source":{"kind":"arxiv","id":"1712.02053","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02053","created_at":"2026-05-18T00:16:21Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02053v2","created_at":"2026-05-18T00:16:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02053","created_at":"2026-05-18T00:16:21Z"},{"alias_kind":"pith_short_12","alias_value":"L3A7UU5E4R6U","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L3A7UU5E4R6UVWKN","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L3A7UU5E","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:L3A7UU5E4R6UVWKNG6UK7NRHJB","target":"record","payload":{"canonical_record":{"source":{"id":"1712.02053","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-06T06:18:30Z","cross_cats_sorted":["cs.AR","math.IT"],"title_canon_sha256":"7ffc75e6fefdd93ab24320eaaf9d47c35161d02c14383cc496c50034086c1f76","abstract_canon_sha256":"af72ab004044b7c8f82a19a2f254bc658f317b5f6feda597120da83d43f3b386"},"schema_version":"1.0"},"canonical_sha256":"5ec1fa53a4e47d4ad94d37a8afb62748669f570e9f140f58142bcd1be42a765d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:21.421563Z","signature_b64":"mOXIO0xL4q3/NVzaGYFbwjBab4iCqBQ1O2pNN3wZxpivcwyDUraohQ2iGmrSsGdlEYsu7dSKZ7waPq5OPtBfCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ec1fa53a4e47d4ad94d37a8afb62748669f570e9f140f58142bcd1be42a765d","last_reissued_at":"2026-05-18T00:16:21.421126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:21.421126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.02053","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:16:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kicT+jhgNlWz5M95pdr0GB5IuiE/e54DnWi4O2yot/FdKCvC8AaGobC1ilxNQD3GBE52SFf+gW57mITOjHx6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:40:08.445270Z"},"content_sha256":"8d6925ebebba51f9a2b1a8003a2050328997bb6a4bc33a248a1c9f41bef71635","schema_version":"1.0","event_id":"sha256:8d6925ebebba51f9a2b1a8003a2050328997bb6a4bc33a248a1c9f41bef71635"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:L3A7UU5E4R6UVWKNG6UK7NRHJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Path Memory in List Successive Cancellation Decoder of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","math.IT"],"primary_cat":"cs.IT","authors_text":"ChenYang Xia, Chi-Ying Tsui, Ji Chen, YouZhe Fan","submitted_at":"2017-12-06T06:18:30Z","abstract_excerpt":"Polar code is a breakthrough in coding theory. Using list successive cancellation decoding with large list size L, polar codes can achieve excellent error correction performance. The L partial decoded vectors are stored in the path memory and updated according to the results of list management. In the state-of-the-art designs, the memories are implemented with registers and a large crossbar is used for copying the partial decoded vectors from one block of memory to another during the update. The architectures are quite area-costly when the code length and list size are large. To solve this pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02053","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:16:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cW6Qn2w+7oKt3phtq7dtBEX1rR1/3+gQ2jp1JweSjUsSubJStQWmQOqqPEoNE+5na+c/91MZHDrFDJXaGUPYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:40:08.446002Z"},"content_sha256":"5609958220cdfd2f854803ff9909ca869d897fa43798311e47bc74f2a2267d2f","schema_version":"1.0","event_id":"sha256:5609958220cdfd2f854803ff9909ca869d897fa43798311e47bc74f2a2267d2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L3A7UU5E4R6UVWKNG6UK7NRHJB/bundle.json","state_url":"https://pith.science/pith/L3A7UU5E4R6UVWKNG6UK7NRHJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L3A7UU5E4R6UVWKNG6UK7NRHJB/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-10T13:40:08Z","links":{"resolver":"https://pith.science/pith/L3A7UU5E4R6UVWKNG6UK7NRHJB","bundle":"https://pith.science/pith/L3A7UU5E4R6UVWKNG6UK7NRHJB/bundle.json","state":"https://pith.science/pith/L3A7UU5E4R6UVWKNG6UK7NRHJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L3A7UU5E4R6UVWKNG6UK7NRHJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:L3A7UU5E4R6UVWKNG6UK7NRHJB","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":"af72ab004044b7c8f82a19a2f254bc658f317b5f6feda597120da83d43f3b386","cross_cats_sorted":["cs.AR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-06T06:18:30Z","title_canon_sha256":"7ffc75e6fefdd93ab24320eaaf9d47c35161d02c14383cc496c50034086c1f76"},"schema_version":"1.0","source":{"id":"1712.02053","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02053","created_at":"2026-05-18T00:16:21Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02053v2","created_at":"2026-05-18T00:16:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02053","created_at":"2026-05-18T00:16:21Z"},{"alias_kind":"pith_short_12","alias_value":"L3A7UU5E4R6U","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"L3A7UU5E4R6UVWKN","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"L3A7UU5E","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:5609958220cdfd2f854803ff9909ca869d897fa43798311e47bc74f2a2267d2f","target":"graph","created_at":"2026-05-18T00:16:21Z","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 code is a breakthrough in coding theory. Using list successive cancellation decoding with large list size L, polar codes can achieve excellent error correction performance. The L partial decoded vectors are stored in the path memory and updated according to the results of list management. In the state-of-the-art designs, the memories are implemented with registers and a large crossbar is used for copying the partial decoded vectors from one block of memory to another during the update. The architectures are quite area-costly when the code length and list size are large. To solve this pro","authors_text":"ChenYang Xia, Chi-Ying Tsui, Ji Chen, YouZhe Fan","cross_cats":["cs.AR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-06T06:18:30Z","title":"On Path Memory in List Successive Cancellation Decoder of Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02053","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:8d6925ebebba51f9a2b1a8003a2050328997bb6a4bc33a248a1c9f41bef71635","target":"record","created_at":"2026-05-18T00:16:21Z","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":"af72ab004044b7c8f82a19a2f254bc658f317b5f6feda597120da83d43f3b386","cross_cats_sorted":["cs.AR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-06T06:18:30Z","title_canon_sha256":"7ffc75e6fefdd93ab24320eaaf9d47c35161d02c14383cc496c50034086c1f76"},"schema_version":"1.0","source":{"id":"1712.02053","kind":"arxiv","version":2}},"canonical_sha256":"5ec1fa53a4e47d4ad94d37a8afb62748669f570e9f140f58142bcd1be42a765d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ec1fa53a4e47d4ad94d37a8afb62748669f570e9f140f58142bcd1be42a765d","first_computed_at":"2026-05-18T00:16:21.421126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:21.421126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mOXIO0xL4q3/NVzaGYFbwjBab4iCqBQ1O2pNN3wZxpivcwyDUraohQ2iGmrSsGdlEYsu7dSKZ7waPq5OPtBfCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:21.421563Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.02053","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d6925ebebba51f9a2b1a8003a2050328997bb6a4bc33a248a1c9f41bef71635","sha256:5609958220cdfd2f854803ff9909ca869d897fa43798311e47bc74f2a2267d2f"],"state_sha256":"87e2fc1fc8d98dc64fd5b5b3f170dc2f1578ddf34b4df9a835815ef70f50cede"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"44OO/otQGVBcvFzPoHbjH/83eIFxlUTkTJgkzErY0pvKeUORyseXK7JrmeURSWlblvvgcXdjuuoJifdnn7LcAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T13:40:08.449692Z","bundle_sha256":"f164f0392deed67740a221f2687f73dcfd9ec2dc8a2a2a21af4e9bd528b55d7d"}}