{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3EY7XCHXPM3QMXLMZQS4TXSYZK","short_pith_number":"pith:3EY7XCHX","canonical_record":{"source":{"id":"1510.07510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-26T15:22:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9ac44c508e872742988c634eddbf08bd1f7300d4d9b649fb85db5fe00ee93262","abstract_canon_sha256":"a6dd7b7d6630701f72f86b57baf7ee84564e50ba0d0931c67247b160e2d382a5"},"schema_version":"1.0"},"canonical_sha256":"d931fb88f77b37065d6ccc25c9de58caa28ace13d7228b78b4f5f56250f99762","source":{"kind":"arxiv","id":"1510.07510","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07510","created_at":"2026-05-18T01:29:13Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07510v1","created_at":"2026-05-18T01:29:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07510","created_at":"2026-05-18T01:29:13Z"},{"alias_kind":"pith_short_12","alias_value":"3EY7XCHXPM3Q","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3EY7XCHXPM3QMXLM","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3EY7XCHX","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3EY7XCHXPM3QMXLMZQS4TXSYZK","target":"record","payload":{"canonical_record":{"source":{"id":"1510.07510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-26T15:22:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9ac44c508e872742988c634eddbf08bd1f7300d4d9b649fb85db5fe00ee93262","abstract_canon_sha256":"a6dd7b7d6630701f72f86b57baf7ee84564e50ba0d0931c67247b160e2d382a5"},"schema_version":"1.0"},"canonical_sha256":"d931fb88f77b37065d6ccc25c9de58caa28ace13d7228b78b4f5f56250f99762","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:13.935938Z","signature_b64":"hiyAnWuyD54z3T/bHJzg8GjG2E3B25f04byfpLmPXyPVa/RA45T5cVJGq/qETvB9CvG+0GnAgzuwhJAF7EjpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d931fb88f77b37065d6ccc25c9de58caa28ace13d7228b78b4f5f56250f99762","last_reissued_at":"2026-05-18T01:29:13.935480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:13.935480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.07510","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:29:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qAQ+lsLNmugz71uI4aFBr98JHVZmX9JED4wDMbzoJ1t3YcFdTS9M3WwyPhfc89jhgOAKYBD9Qbl1j1Rt/b37Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:50:15.567776Z"},"content_sha256":"91aa7b126bb6e548bc746e76d344f43bb213489ce1d4c1d3598f730267420b91","schema_version":"1.0","event_id":"sha256:91aa7b126bb6e548bc746e76d344f43bb213489ce1d4c1d3598f730267420b91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3EY7XCHXPM3QMXLMZQS4TXSYZK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A multi-mode area-efficient SCL polar decoder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chenrong Xiong, Jun Lin, Zhiyuan Yan","submitted_at":"2015-10-26T15:22:19Z","abstract_excerpt":"Polar codes are of great interest since they are the first provably capacity-achieving forward error correction codes. To improve throughput and to reduce decoding latency of polar decoders, maximum likelihood (ML) decoding units are used by successive cancellation list (SCL) decoders as well as successive cancellation (SC) decoders. This paper proposes an approximate ML (AML) decoding unit for SCL decoders first. In particular, we investigate the distribution of frozen bits of polar codes designed for both the binary erasure and additive white Gaussian noise channels, and take advantage of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07510","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:29:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WBMze8WKNt7TZ94PWLHBLqxRuzTHfVeJhdcqqUYxBkx6epDSDRvkUg27DUO++ussPT7fuONb3k0whNcSINnAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:50:15.568467Z"},"content_sha256":"caf927bb0eabb1403b0b0cf8a7388aed3d34a7e8ea017bd401a0543c65f12a87","schema_version":"1.0","event_id":"sha256:caf927bb0eabb1403b0b0cf8a7388aed3d34a7e8ea017bd401a0543c65f12a87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3EY7XCHXPM3QMXLMZQS4TXSYZK/bundle.json","state_url":"https://pith.science/pith/3EY7XCHXPM3QMXLMZQS4TXSYZK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3EY7XCHXPM3QMXLMZQS4TXSYZK/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-31T05:50:15Z","links":{"resolver":"https://pith.science/pith/3EY7XCHXPM3QMXLMZQS4TXSYZK","bundle":"https://pith.science/pith/3EY7XCHXPM3QMXLMZQS4TXSYZK/bundle.json","state":"https://pith.science/pith/3EY7XCHXPM3QMXLMZQS4TXSYZK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3EY7XCHXPM3QMXLMZQS4TXSYZK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3EY7XCHXPM3QMXLMZQS4TXSYZK","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":"a6dd7b7d6630701f72f86b57baf7ee84564e50ba0d0931c67247b160e2d382a5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-26T15:22:19Z","title_canon_sha256":"9ac44c508e872742988c634eddbf08bd1f7300d4d9b649fb85db5fe00ee93262"},"schema_version":"1.0","source":{"id":"1510.07510","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07510","created_at":"2026-05-18T01:29:13Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07510v1","created_at":"2026-05-18T01:29:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07510","created_at":"2026-05-18T01:29:13Z"},{"alias_kind":"pith_short_12","alias_value":"3EY7XCHXPM3Q","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3EY7XCHXPM3QMXLM","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3EY7XCHX","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:caf927bb0eabb1403b0b0cf8a7388aed3d34a7e8ea017bd401a0543c65f12a87","target":"graph","created_at":"2026-05-18T01:29:13Z","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 codes are of great interest since they are the first provably capacity-achieving forward error correction codes. To improve throughput and to reduce decoding latency of polar decoders, maximum likelihood (ML) decoding units are used by successive cancellation list (SCL) decoders as well as successive cancellation (SC) decoders. This paper proposes an approximate ML (AML) decoding unit for SCL decoders first. In particular, we investigate the distribution of frozen bits of polar codes designed for both the binary erasure and additive white Gaussian noise channels, and take advantage of th","authors_text":"Chenrong Xiong, Jun Lin, Zhiyuan Yan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-26T15:22:19Z","title":"A multi-mode area-efficient SCL polar decoder"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07510","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:91aa7b126bb6e548bc746e76d344f43bb213489ce1d4c1d3598f730267420b91","target":"record","created_at":"2026-05-18T01:29:13Z","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":"a6dd7b7d6630701f72f86b57baf7ee84564e50ba0d0931c67247b160e2d382a5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-26T15:22:19Z","title_canon_sha256":"9ac44c508e872742988c634eddbf08bd1f7300d4d9b649fb85db5fe00ee93262"},"schema_version":"1.0","source":{"id":"1510.07510","kind":"arxiv","version":1}},"canonical_sha256":"d931fb88f77b37065d6ccc25c9de58caa28ace13d7228b78b4f5f56250f99762","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d931fb88f77b37065d6ccc25c9de58caa28ace13d7228b78b4f5f56250f99762","first_computed_at":"2026-05-18T01:29:13.935480Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:13.935480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hiyAnWuyD54z3T/bHJzg8GjG2E3B25f04byfpLmPXyPVa/RA45T5cVJGq/qETvB9CvG+0GnAgzuwhJAF7EjpCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:13.935938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07510","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91aa7b126bb6e548bc746e76d344f43bb213489ce1d4c1d3598f730267420b91","sha256:caf927bb0eabb1403b0b0cf8a7388aed3d34a7e8ea017bd401a0543c65f12a87"],"state_sha256":"df6e0509543a4d59bc5eba71c9f1b4cef4bb48470077697d1eef9bc7e681543d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oyRwWmG1LNf7W8p3N1QANuwThOV6ySZsqC8V1a2iNN8Aa3Zx/cvVWb2ADf8JrfI0xoyvG0h+DEvG3cmQPBXjCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:50:15.572834Z","bundle_sha256":"4fa4ccc2d4610f3bb534b95b1013cc0cd0471d5ba0e61bf7ca5f979084261c3b"}}