{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GVJNHCPA5WCZEJJ3YMRNE3LMUY","short_pith_number":"pith:GVJNHCPA","canonical_record":{"source":{"id":"1309.3173","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-12T14:38:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e3a4ccaec63fde9c6f7ce66822605ebdf3d9bd46bab17f0821e4e2004d4b0050","abstract_canon_sha256":"7a5d93c0510dbf34ce6406834a45fcea9b96987b4d2fc899c5b73841add83440"},"schema_version":"1.0"},"canonical_sha256":"3552d389e0ed8592253bc322d26d6ca626ecbccb214b6fc9b02877441cc6d180","source":{"kind":"arxiv","id":"1309.3173","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3173","created_at":"2026-05-18T03:13:32Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3173v1","created_at":"2026-05-18T03:13:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3173","created_at":"2026-05-18T03:13:32Z"},{"alias_kind":"pith_short_12","alias_value":"GVJNHCPA5WCZ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GVJNHCPA5WCZEJJ3","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GVJNHCPA","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GVJNHCPA5WCZEJJ3YMRNE3LMUY","target":"record","payload":{"canonical_record":{"source":{"id":"1309.3173","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-12T14:38:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e3a4ccaec63fde9c6f7ce66822605ebdf3d9bd46bab17f0821e4e2004d4b0050","abstract_canon_sha256":"7a5d93c0510dbf34ce6406834a45fcea9b96987b4d2fc899c5b73841add83440"},"schema_version":"1.0"},"canonical_sha256":"3552d389e0ed8592253bc322d26d6ca626ecbccb214b6fc9b02877441cc6d180","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:32.654606Z","signature_b64":"kUIKgm6aVhNpqUFeODzw587G1Oeybx/JwJ6McQTIm/tDBXv1/O2y7QbK17wZMgEORfZErY7JXygA3x1pC63OAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3552d389e0ed8592253bc322d26d6ca626ecbccb214b6fc9b02877441cc6d180","last_reissued_at":"2026-05-18T03:13:32.654107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:32.654107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.3173","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-18T03:13:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LNpsYlqgJC9/oTClJ8G+jdkQuIk96l2oyMEVjV9OU3jy2iN5znoJ+jsj7uYHk7JErQnX2Bx/a6ZTNKFZKycVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:52:24.734547Z"},"content_sha256":"df2588a470b6abba86fe6b885a076f7f41a241c6aed06e5a33e3f84491df3c1a","schema_version":"1.0","event_id":"sha256:df2588a470b6abba86fe6b885a076f7f41a241c6aed06e5a33e3f84491df3c1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GVJNHCPA5WCZEJJ3YMRNE3LMUY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low Complexity List Successive Cancellation Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Congzhe Cao, Jingming Kuang, Jinhong Yuan, Zesong Fei","submitted_at":"2013-09-12T14:38:40Z","abstract_excerpt":"We propose a low complexity list successive cancellation (LCLSC) decoding algorithm to reduce complexity of traditional list successive cancellation (LSC) decoding of polar codes while trying to maintain the LSC decoding performance at the same time. By defining two thresholds, namely \"likelihood ratio (LR) threshold\" and \"Bhattacharyya parameter threshold\", we classify the reliability of each received information bit and the quality of each bit channel. Based on this classification, we implement successive cancellation (SC) decoding instead of LSC decoding when the information bits from \"bad\""},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3173","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-18T03:13:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yUjGslSfzUrtgPyPzHjGNSwaPp9pzV6QO+4SwtUj+YvfcxjTdEYYsM0TAXIrO5ZgThSUL4dkYjWrgzauFT1LBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:52:24.735276Z"},"content_sha256":"608afc71131774c18aad31f2f6544120f48521c40f4bd4a2da042549cad70442","schema_version":"1.0","event_id":"sha256:608afc71131774c18aad31f2f6544120f48521c40f4bd4a2da042549cad70442"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVJNHCPA5WCZEJJ3YMRNE3LMUY/bundle.json","state_url":"https://pith.science/pith/GVJNHCPA5WCZEJJ3YMRNE3LMUY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVJNHCPA5WCZEJJ3YMRNE3LMUY/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-30T17:52:24Z","links":{"resolver":"https://pith.science/pith/GVJNHCPA5WCZEJJ3YMRNE3LMUY","bundle":"https://pith.science/pith/GVJNHCPA5WCZEJJ3YMRNE3LMUY/bundle.json","state":"https://pith.science/pith/GVJNHCPA5WCZEJJ3YMRNE3LMUY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVJNHCPA5WCZEJJ3YMRNE3LMUY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GVJNHCPA5WCZEJJ3YMRNE3LMUY","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":"7a5d93c0510dbf34ce6406834a45fcea9b96987b4d2fc899c5b73841add83440","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-12T14:38:40Z","title_canon_sha256":"e3a4ccaec63fde9c6f7ce66822605ebdf3d9bd46bab17f0821e4e2004d4b0050"},"schema_version":"1.0","source":{"id":"1309.3173","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3173","created_at":"2026-05-18T03:13:32Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3173v1","created_at":"2026-05-18T03:13:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3173","created_at":"2026-05-18T03:13:32Z"},{"alias_kind":"pith_short_12","alias_value":"GVJNHCPA5WCZ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GVJNHCPA5WCZEJJ3","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GVJNHCPA","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:608afc71131774c18aad31f2f6544120f48521c40f4bd4a2da042549cad70442","target":"graph","created_at":"2026-05-18T03:13:32Z","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":"We propose a low complexity list successive cancellation (LCLSC) decoding algorithm to reduce complexity of traditional list successive cancellation (LSC) decoding of polar codes while trying to maintain the LSC decoding performance at the same time. By defining two thresholds, namely \"likelihood ratio (LR) threshold\" and \"Bhattacharyya parameter threshold\", we classify the reliability of each received information bit and the quality of each bit channel. Based on this classification, we implement successive cancellation (SC) decoding instead of LSC decoding when the information bits from \"bad\"","authors_text":"Congzhe Cao, Jingming Kuang, Jinhong Yuan, Zesong Fei","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-12T14:38:40Z","title":"Low Complexity List Successive Cancellation Decoding of Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3173","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:df2588a470b6abba86fe6b885a076f7f41a241c6aed06e5a33e3f84491df3c1a","target":"record","created_at":"2026-05-18T03:13:32Z","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":"7a5d93c0510dbf34ce6406834a45fcea9b96987b4d2fc899c5b73841add83440","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-12T14:38:40Z","title_canon_sha256":"e3a4ccaec63fde9c6f7ce66822605ebdf3d9bd46bab17f0821e4e2004d4b0050"},"schema_version":"1.0","source":{"id":"1309.3173","kind":"arxiv","version":1}},"canonical_sha256":"3552d389e0ed8592253bc322d26d6ca626ecbccb214b6fc9b02877441cc6d180","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3552d389e0ed8592253bc322d26d6ca626ecbccb214b6fc9b02877441cc6d180","first_computed_at":"2026-05-18T03:13:32.654107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:32.654107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kUIKgm6aVhNpqUFeODzw587G1Oeybx/JwJ6McQTIm/tDBXv1/O2y7QbK17wZMgEORfZErY7JXygA3x1pC63OAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:32.654606Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.3173","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df2588a470b6abba86fe6b885a076f7f41a241c6aed06e5a33e3f84491df3c1a","sha256:608afc71131774c18aad31f2f6544120f48521c40f4bd4a2da042549cad70442"],"state_sha256":"76e4c8ff1243143df6e72e27afe0eef9acd09bc924a28393d0ed23d1d1992dc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7rb3CB+mx2b7vYZ2a8Xhh1piuuEAuaMqR/pP21ZH5pocF+fpIxqTmMSm6toxSWUTtMKGUu2gIYwopraU5WrjAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:52:24.739374Z","bundle_sha256":"c2ef93be5bb36c0c82bd1d07f5931cb6d76756acba1a1a1c2c1962684707a15e"}}