{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VMJKE57GAU4BVFBINOCPN6A3FQ","short_pith_number":"pith:VMJKE57G","canonical_record":{"source":{"id":"1511.02150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-06T16:44:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"172048179fa54ecbdb78336a2c0af36fd2df0b828ec33b310aa4155e47fbded5","abstract_canon_sha256":"678135735cf55f8c4677891182c57c65bbafdad0429d2f90dc9342efaeae5102"},"schema_version":"1.0"},"canonical_sha256":"ab12a277e605381a94286b84f6f81b2c130edc29bcd6aac5bad9c3e58c14e15f","source":{"kind":"arxiv","id":"1511.02150","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02150","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02150v1","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02150","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"pith_short_12","alias_value":"VMJKE57GAU4B","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VMJKE57GAU4BVFBI","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VMJKE57G","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VMJKE57GAU4BVFBINOCPN6A3FQ","target":"record","payload":{"canonical_record":{"source":{"id":"1511.02150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-06T16:44:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"172048179fa54ecbdb78336a2c0af36fd2df0b828ec33b310aa4155e47fbded5","abstract_canon_sha256":"678135735cf55f8c4677891182c57c65bbafdad0429d2f90dc9342efaeae5102"},"schema_version":"1.0"},"canonical_sha256":"ab12a277e605381a94286b84f6f81b2c130edc29bcd6aac5bad9c3e58c14e15f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:34.622204Z","signature_b64":"CSngPuzA6z345vTphhsUrPQDkJVKNQDeWRq4p33x1Vp7wRxrDsmi6IjCifiNB4fepOp/k9BU8XqlAzf21IiPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab12a277e605381a94286b84f6f81b2c130edc29bcd6aac5bad9c3e58c14e15f","last_reissued_at":"2026-05-18T00:58:34.621586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:34.621586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.02150","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:58:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uFjllQvGh0+yWVEpeAKsa8adn2HzvDY1wSXfnPyt1LiNKl2nMa9P8TDBbLaI6yjOeu3pgPlHreAPHJLLxMSPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:33:56.576830Z"},"content_sha256":"0ffbb06d09b13fb63f1c73abdfdd8e58e8bffbfec623cea652d3077cb039e97c","schema_version":"1.0","event_id":"sha256:0ffbb06d09b13fb63f1c73abdfdd8e58e8bffbfec623cea652d3077cb039e97c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VMJKE57GAU4BVFBINOCPN6A3FQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Split-Reduced Successive Cancellation List Decoder for Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Caijun Zhong, H. Vincent Poor, Liang Zhang, Xianbin Wang, Zhaoyang Zhang","submitted_at":"2015-11-06T16:44:14Z","abstract_excerpt":"This paper focuses on low complexity successive cancellation list (SCL) decoding of polar codes. In particular, using the fact that splitting may be unnecessary when the reliability of decoding the unfrozen bit is sufficiently high, a novel splitting rule is proposed. Based on this rule, it is conjectured that, if the correct path survives at some stage, it tends to survive till termination without splitting with high probability. On the other hand, the incorrect paths are more likely to split at the following stages. Motivated by these observations, a simple counter that counts the successive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02150","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:58:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HPh21o6NBHiOezV5GJ6yPnXS32hOO5CWHOUWfA/abHE5e+VxJ1VWXL16fB092xwLU2OjfGGf1oqsRdfxR28nAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:33:56.577530Z"},"content_sha256":"72a3c568900c47fa826be05d88b4eccac3c070d07a1e12a1f91496eafe65178e","schema_version":"1.0","event_id":"sha256:72a3c568900c47fa826be05d88b4eccac3c070d07a1e12a1f91496eafe65178e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VMJKE57GAU4BVFBINOCPN6A3FQ/bundle.json","state_url":"https://pith.science/pith/VMJKE57GAU4BVFBINOCPN6A3FQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VMJKE57GAU4BVFBINOCPN6A3FQ/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-27T16:33:56Z","links":{"resolver":"https://pith.science/pith/VMJKE57GAU4BVFBINOCPN6A3FQ","bundle":"https://pith.science/pith/VMJKE57GAU4BVFBINOCPN6A3FQ/bundle.json","state":"https://pith.science/pith/VMJKE57GAU4BVFBINOCPN6A3FQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VMJKE57GAU4BVFBINOCPN6A3FQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VMJKE57GAU4BVFBINOCPN6A3FQ","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":"678135735cf55f8c4677891182c57c65bbafdad0429d2f90dc9342efaeae5102","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-06T16:44:14Z","title_canon_sha256":"172048179fa54ecbdb78336a2c0af36fd2df0b828ec33b310aa4155e47fbded5"},"schema_version":"1.0","source":{"id":"1511.02150","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02150","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02150v1","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02150","created_at":"2026-05-18T00:58:34Z"},{"alias_kind":"pith_short_12","alias_value":"VMJKE57GAU4B","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VMJKE57GAU4BVFBI","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VMJKE57G","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:72a3c568900c47fa826be05d88b4eccac3c070d07a1e12a1f91496eafe65178e","target":"graph","created_at":"2026-05-18T00:58:34Z","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":"This paper focuses on low complexity successive cancellation list (SCL) decoding of polar codes. In particular, using the fact that splitting may be unnecessary when the reliability of decoding the unfrozen bit is sufficiently high, a novel splitting rule is proposed. Based on this rule, it is conjectured that, if the correct path survives at some stage, it tends to survive till termination without splitting with high probability. On the other hand, the incorrect paths are more likely to split at the following stages. Motivated by these observations, a simple counter that counts the successive","authors_text":"Caijun Zhong, H. Vincent Poor, Liang Zhang, Xianbin Wang, Zhaoyang Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-06T16:44:14Z","title":"A Split-Reduced Successive Cancellation List Decoder for Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02150","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:0ffbb06d09b13fb63f1c73abdfdd8e58e8bffbfec623cea652d3077cb039e97c","target":"record","created_at":"2026-05-18T00:58:34Z","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":"678135735cf55f8c4677891182c57c65bbafdad0429d2f90dc9342efaeae5102","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-06T16:44:14Z","title_canon_sha256":"172048179fa54ecbdb78336a2c0af36fd2df0b828ec33b310aa4155e47fbded5"},"schema_version":"1.0","source":{"id":"1511.02150","kind":"arxiv","version":1}},"canonical_sha256":"ab12a277e605381a94286b84f6f81b2c130edc29bcd6aac5bad9c3e58c14e15f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab12a277e605381a94286b84f6f81b2c130edc29bcd6aac5bad9c3e58c14e15f","first_computed_at":"2026-05-18T00:58:34.621586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:34.621586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CSngPuzA6z345vTphhsUrPQDkJVKNQDeWRq4p33x1Vp7wRxrDsmi6IjCifiNB4fepOp/k9BU8XqlAzf21IiPCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:34.622204Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02150","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ffbb06d09b13fb63f1c73abdfdd8e58e8bffbfec623cea652d3077cb039e97c","sha256:72a3c568900c47fa826be05d88b4eccac3c070d07a1e12a1f91496eafe65178e"],"state_sha256":"cd7f2f36b000e197b45a8d2cd277c8b11e12669f370776aa51557ed0884662b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PMHyIZV52A5elEWt3jUYP/MQ6esFPYXFjm7qmZEeFVFHwfJUgRMnR24ClaY1gknrZG6hNbuTMJx46QCptj0+AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:33:56.579881Z","bundle_sha256":"eae21791179364273ff4f61fcb6eefa263bca6ded9f98e8016e981813e5e92d6"}}