{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IEPJYJJY7TEPOAPXSRVZHM2KRT","short_pith_number":"pith:IEPJYJJY","canonical_record":{"source":{"id":"1504.03437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-04-14T07:12:24Z","cross_cats_sorted":[],"title_canon_sha256":"d9e5ed5fe4bd581e3954b32edd5018bec2483609a04ed409965eeb85743ba9f6","abstract_canon_sha256":"10528438827d2346ae74266c6c69640822de0b4fcf9cf4cb66e3e0749bcadcc2"},"schema_version":"1.0"},"canonical_sha256":"411e9c2538fcc8f701f7946b93b34a8cf835cb44740b077ac7373929dc210578","source":{"kind":"arxiv","id":"1504.03437","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03437","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03437v1","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03437","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"pith_short_12","alias_value":"IEPJYJJY7TEP","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IEPJYJJY7TEPOAPX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IEPJYJJY","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IEPJYJJY7TEPOAPXSRVZHM2KRT","target":"record","payload":{"canonical_record":{"source":{"id":"1504.03437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-04-14T07:12:24Z","cross_cats_sorted":[],"title_canon_sha256":"d9e5ed5fe4bd581e3954b32edd5018bec2483609a04ed409965eeb85743ba9f6","abstract_canon_sha256":"10528438827d2346ae74266c6c69640822de0b4fcf9cf4cb66e3e0749bcadcc2"},"schema_version":"1.0"},"canonical_sha256":"411e9c2538fcc8f701f7946b93b34a8cf835cb44740b077ac7373929dc210578","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:55.398085Z","signature_b64":"ddePesDiJjnZ/nCLT9SGtEeoY+rRBoR5lmbhMNVQrhGV/t5swzCWBYS1IBgaxeUAatMWHqTQKcMO97iA5wF0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"411e9c2538fcc8f701f7946b93b34a8cf835cb44740b077ac7373929dc210578","last_reissued_at":"2026-05-18T01:25:55.397286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:55.397286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.03437","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-18T01:25:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1wT4SfSY7t83Lr3Dhw9E/a6S/mf6GBYKe6ZTrVtsvzsQnrybpKR8lD8KHBzAEy8/T52iwCYhUrIb6S4c3Q+jCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:18:16.321003Z"},"content_sha256":"77c96a15da32b904d223251c00960f3fa60ecbb1493240f1315ccf60b3c9facd","schema_version":"1.0","event_id":"sha256:77c96a15da32b904d223251c00960f3fa60ecbb1493240f1315ccf60b3c9facd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IEPJYJJY7TEPOAPXSRVZHM2KRT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-latency List Decoding Of Polar Codes With Double Thresholding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Bin Li, ChenYang Xia, Chi-Ying Tsui, Hui Shen, Ji Chen, Jie Jin, YouZhe Fan","submitted_at":"2015-04-14T07:12:24Z","abstract_excerpt":"For polar codes with short-to-medium code length, list successive cancellation decoding is used to achieve a good error-correcting performance. However, list pruning in the current list decoding is based on the sorting strategy and its timing complexity is high. This results in a long decoding latency for large list size. In this work, aiming at a low-latency list decoding implementation, a double thresholding algorithm is proposed for a fast list pruning. As a result, with a negligible performance degradation, the list pruning delay is greatly reduced. Based on the double thresholding, a low-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03437","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-18T01:25:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eTO/2GAJTsclc7X0o0N4hlNvKYN+MOPfDB0GCKbvCkEbJ0LIJGinUPVAiHeJGK45rQd7KsZdQZzip3S/Zy8MAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:18:16.321361Z"},"content_sha256":"3b56f0e2cf38d8605a4cf30a5dd03ff4c045bb42ee80963601fdebfb7bddb773","schema_version":"1.0","event_id":"sha256:3b56f0e2cf38d8605a4cf30a5dd03ff4c045bb42ee80963601fdebfb7bddb773"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IEPJYJJY7TEPOAPXSRVZHM2KRT/bundle.json","state_url":"https://pith.science/pith/IEPJYJJY7TEPOAPXSRVZHM2KRT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IEPJYJJY7TEPOAPXSRVZHM2KRT/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-03T17:18:16Z","links":{"resolver":"https://pith.science/pith/IEPJYJJY7TEPOAPXSRVZHM2KRT","bundle":"https://pith.science/pith/IEPJYJJY7TEPOAPXSRVZHM2KRT/bundle.json","state":"https://pith.science/pith/IEPJYJJY7TEPOAPXSRVZHM2KRT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IEPJYJJY7TEPOAPXSRVZHM2KRT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IEPJYJJY7TEPOAPXSRVZHM2KRT","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":"10528438827d2346ae74266c6c69640822de0b4fcf9cf4cb66e3e0749bcadcc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-04-14T07:12:24Z","title_canon_sha256":"d9e5ed5fe4bd581e3954b32edd5018bec2483609a04ed409965eeb85743ba9f6"},"schema_version":"1.0","source":{"id":"1504.03437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03437","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03437v1","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03437","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"pith_short_12","alias_value":"IEPJYJJY7TEP","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IEPJYJJY7TEPOAPX","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IEPJYJJY","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:3b56f0e2cf38d8605a4cf30a5dd03ff4c045bb42ee80963601fdebfb7bddb773","target":"graph","created_at":"2026-05-18T01:25:55Z","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":"For polar codes with short-to-medium code length, list successive cancellation decoding is used to achieve a good error-correcting performance. However, list pruning in the current list decoding is based on the sorting strategy and its timing complexity is high. This results in a long decoding latency for large list size. In this work, aiming at a low-latency list decoding implementation, a double thresholding algorithm is proposed for a fast list pruning. As a result, with a negligible performance degradation, the list pruning delay is greatly reduced. Based on the double thresholding, a low-","authors_text":"Bin Li, ChenYang Xia, Chi-Ying Tsui, Hui Shen, Ji Chen, Jie Jin, YouZhe Fan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-04-14T07:12:24Z","title":"Low-latency List Decoding Of Polar Codes With Double Thresholding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03437","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:77c96a15da32b904d223251c00960f3fa60ecbb1493240f1315ccf60b3c9facd","target":"record","created_at":"2026-05-18T01:25:55Z","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":"10528438827d2346ae74266c6c69640822de0b4fcf9cf4cb66e3e0749bcadcc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-04-14T07:12:24Z","title_canon_sha256":"d9e5ed5fe4bd581e3954b32edd5018bec2483609a04ed409965eeb85743ba9f6"},"schema_version":"1.0","source":{"id":"1504.03437","kind":"arxiv","version":1}},"canonical_sha256":"411e9c2538fcc8f701f7946b93b34a8cf835cb44740b077ac7373929dc210578","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"411e9c2538fcc8f701f7946b93b34a8cf835cb44740b077ac7373929dc210578","first_computed_at":"2026-05-18T01:25:55.397286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:55.397286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ddePesDiJjnZ/nCLT9SGtEeoY+rRBoR5lmbhMNVQrhGV/t5swzCWBYS1IBgaxeUAatMWHqTQKcMO97iA5wF0AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:55.398085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.03437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77c96a15da32b904d223251c00960f3fa60ecbb1493240f1315ccf60b3c9facd","sha256:3b56f0e2cf38d8605a4cf30a5dd03ff4c045bb42ee80963601fdebfb7bddb773"],"state_sha256":"3b79dc63d734e1c6b9f78fa42bf0983baf1281f2963750cce170c28fb895430c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e5BJa+rR9mYIC5+AqGn9bD7ITr6T3uxr9O8EPaQReNdkpciWsLTn0kseKwnmKNue1kKMvPNl+AQluyRlbbGdAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:18:16.323288Z","bundle_sha256":"e433a76a9717f154d6042c6c8b14adb7ca32d7fde707596f23fa8de183bcf7a9"}}