{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:H63LLOVPDC4QUXR5UKYWBVMAYI","short_pith_number":"pith:H63LLOVP","canonical_record":{"source":{"id":"1603.07055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-23T02:48:35Z","cross_cats_sorted":["cs.AR","math.IT"],"title_canon_sha256":"b3c85de0ce53b2ad4e42688931f538fc9896f90b6ee5efdc3d8069e13ea6eaa2","abstract_canon_sha256":"d24a552aba34e110cecce4dc925d224089e10dfaee588a9cee62768519cbfb11"},"schema_version":"1.0"},"canonical_sha256":"3fb6b5baaf18b90a5e3da2b160d580c201038a6b55cd1a948d86dacc77009bdb","source":{"kind":"arxiv","id":"1603.07055","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07055","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07055v1","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07055","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"pith_short_12","alias_value":"H63LLOVPDC4Q","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"H63LLOVPDC4QUXR5","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"H63LLOVP","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:H63LLOVPDC4QUXR5UKYWBVMAYI","target":"record","payload":{"canonical_record":{"source":{"id":"1603.07055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-23T02:48:35Z","cross_cats_sorted":["cs.AR","math.IT"],"title_canon_sha256":"b3c85de0ce53b2ad4e42688931f538fc9896f90b6ee5efdc3d8069e13ea6eaa2","abstract_canon_sha256":"d24a552aba34e110cecce4dc925d224089e10dfaee588a9cee62768519cbfb11"},"schema_version":"1.0"},"canonical_sha256":"3fb6b5baaf18b90a5e3da2b160d580c201038a6b55cd1a948d86dacc77009bdb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:49.780267Z","signature_b64":"y9eIrf2LEoUc/E13aHe4lWa/Ey92O6svXfc5IqJpZvXhB3EjeF53jB8YUk1SG74895ApHMM2bjy6l3ElPQQICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fb6b5baaf18b90a5e3da2b160d580c201038a6b55cd1a948d86dacc77009bdb","last_reissued_at":"2026-05-18T00:57:49.779673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:49.779673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.07055","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:57:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dLdHWj32F85eZtY7yDmTTDVVKHBbB8dIi0TfqAfxL7OxXTnIMxzQI9ignf+PtEUybpPe14hMxR3k3nmk22xVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T22:59:16.684212Z"},"content_sha256":"b8ee6db670da158ecef3b17d7923fc1bfec6d97f984016f5c81453db28c043f2","schema_version":"1.0","event_id":"sha256:b8ee6db670da158ecef3b17d7923fc1bfec6d97f984016f5c81453db28c043f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:H63LLOVPDC4QUXR5UKYWBVMAYI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LLR-based Successive-Cancellation List Decoder for Polar Codes with Multi-bit Decision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","math.IT"],"primary_cat":"cs.IT","authors_text":"Bo Yuan, Keshab K. Parhi","submitted_at":"2016-03-23T02:48:35Z","abstract_excerpt":"Due to their capacity-achieving property, polar codes have become one of the most attractive channel codes. To date, the successive cancellation list (SCL) decoding algorithm is the primary approach that can guarantee outstanding error-correcting performance of polar codes. However, the hardware designs of the original SCL decoder have large silicon area and long decoding latency. Although some recent efforts can reduce either the area or latency of SCL decoders, these two metrics still cannot be optimized at the same time. This paper, for the first time, proposes a general log-likelihood-rati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07055","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:57:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uNIn0qBkmaCVSUbSR/xnyGQeedUfrDiGEEf5nnArPsJMI4MPGZmRTYzObGBy/z9Qj2cEgJ6Iogp6EjmSARY+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T22:59:16.684571Z"},"content_sha256":"d638c2c98d009e65eb240f8d6ad279bb30ec52766da2a425c24b35180d0fda53","schema_version":"1.0","event_id":"sha256:d638c2c98d009e65eb240f8d6ad279bb30ec52766da2a425c24b35180d0fda53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H63LLOVPDC4QUXR5UKYWBVMAYI/bundle.json","state_url":"https://pith.science/pith/H63LLOVPDC4QUXR5UKYWBVMAYI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H63LLOVPDC4QUXR5UKYWBVMAYI/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-07-01T22:59:16Z","links":{"resolver":"https://pith.science/pith/H63LLOVPDC4QUXR5UKYWBVMAYI","bundle":"https://pith.science/pith/H63LLOVPDC4QUXR5UKYWBVMAYI/bundle.json","state":"https://pith.science/pith/H63LLOVPDC4QUXR5UKYWBVMAYI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H63LLOVPDC4QUXR5UKYWBVMAYI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:H63LLOVPDC4QUXR5UKYWBVMAYI","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":"d24a552aba34e110cecce4dc925d224089e10dfaee588a9cee62768519cbfb11","cross_cats_sorted":["cs.AR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-23T02:48:35Z","title_canon_sha256":"b3c85de0ce53b2ad4e42688931f538fc9896f90b6ee5efdc3d8069e13ea6eaa2"},"schema_version":"1.0","source":{"id":"1603.07055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07055","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07055v1","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07055","created_at":"2026-05-18T00:57:49Z"},{"alias_kind":"pith_short_12","alias_value":"H63LLOVPDC4Q","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"H63LLOVPDC4QUXR5","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"H63LLOVP","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:d638c2c98d009e65eb240f8d6ad279bb30ec52766da2a425c24b35180d0fda53","target":"graph","created_at":"2026-05-18T00:57:49Z","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":"Due to their capacity-achieving property, polar codes have become one of the most attractive channel codes. To date, the successive cancellation list (SCL) decoding algorithm is the primary approach that can guarantee outstanding error-correcting performance of polar codes. However, the hardware designs of the original SCL decoder have large silicon area and long decoding latency. Although some recent efforts can reduce either the area or latency of SCL decoders, these two metrics still cannot be optimized at the same time. This paper, for the first time, proposes a general log-likelihood-rati","authors_text":"Bo Yuan, Keshab K. Parhi","cross_cats":["cs.AR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-23T02:48:35Z","title":"LLR-based Successive-Cancellation List Decoder for Polar Codes with Multi-bit Decision"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07055","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:b8ee6db670da158ecef3b17d7923fc1bfec6d97f984016f5c81453db28c043f2","target":"record","created_at":"2026-05-18T00:57:49Z","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":"d24a552aba34e110cecce4dc925d224089e10dfaee588a9cee62768519cbfb11","cross_cats_sorted":["cs.AR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-23T02:48:35Z","title_canon_sha256":"b3c85de0ce53b2ad4e42688931f538fc9896f90b6ee5efdc3d8069e13ea6eaa2"},"schema_version":"1.0","source":{"id":"1603.07055","kind":"arxiv","version":1}},"canonical_sha256":"3fb6b5baaf18b90a5e3da2b160d580c201038a6b55cd1a948d86dacc77009bdb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fb6b5baaf18b90a5e3da2b160d580c201038a6b55cd1a948d86dacc77009bdb","first_computed_at":"2026-05-18T00:57:49.779673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:49.779673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y9eIrf2LEoUc/E13aHe4lWa/Ey92O6svXfc5IqJpZvXhB3EjeF53jB8YUk1SG74895ApHMM2bjy6l3ElPQQICw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:49.780267Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.07055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8ee6db670da158ecef3b17d7923fc1bfec6d97f984016f5c81453db28c043f2","sha256:d638c2c98d009e65eb240f8d6ad279bb30ec52766da2a425c24b35180d0fda53"],"state_sha256":"8f82f336dc54f16e5dbc62ed47ea5e27b237eeac0cdaa21dc004193ade87fa82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0kjTzk2kwDcoTBAiugx7st0o1svvkJ+gNN9ZKKUC1PSbyKcxA5IN1aYzweLFe3fGvOUFiMAvGFaAH/RbH9LRDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T22:59:16.687133Z","bundle_sha256":"d68b610da607b4bd6971ec363b68e3a519237e993221e7626f6f4f5594a5c7b1"}}