{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3FCZOBXYADUNK6XDN2GYUQDJJ4","short_pith_number":"pith:3FCZOBXY","canonical_record":{"source":{"id":"1510.06495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-22T06:11:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d2ad864d116b9eeaf84d73165826a1f53d02d3efbf86e629eba7af7e9cbb617d","abstract_canon_sha256":"97bee31170827c90b1de64bf3ee4dca6e43399e1326b06922ef8c99a520acf76"},"schema_version":"1.0"},"canonical_sha256":"d9459706f800e8d57ae36e8d8a40694f263fdeda21a3648c58ad5964e81c24c4","source":{"kind":"arxiv","id":"1510.06495","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06495","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06495v1","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06495","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"3FCZOBXYADUN","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3FCZOBXYADUNK6XD","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3FCZOBXY","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3FCZOBXYADUNK6XDN2GYUQDJJ4","target":"record","payload":{"canonical_record":{"source":{"id":"1510.06495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-22T06:11:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d2ad864d116b9eeaf84d73165826a1f53d02d3efbf86e629eba7af7e9cbb617d","abstract_canon_sha256":"97bee31170827c90b1de64bf3ee4dca6e43399e1326b06922ef8c99a520acf76"},"schema_version":"1.0"},"canonical_sha256":"d9459706f800e8d57ae36e8d8a40694f263fdeda21a3648c58ad5964e81c24c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:10.218045Z","signature_b64":"QP3NxwquNG4OJ2qJylfTYjSBBAJ80cdmS2qsSrAtMz0K0VcX7CxyYV0dAxE7Z+n/S3uMMpBWy3DfkEJJZg3oDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9459706f800e8d57ae36e8d8a40694f263fdeda21a3648c58ad5964e81c24c4","last_reissued_at":"2026-05-18T00:58:10.217427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:10.217427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.06495","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:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Efp4sh/u6ynfVXzVlOl7WOqjgcYm48G1FZsaGh9cw1BFJ3PIaVjPV4QOCbddXTRKf1Y4v/uoKRHpdSUuC0CqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:31:46.760496Z"},"content_sha256":"4e098328ec040fc8e401ef9d1b68b03c77bca3e8833326d42936a27457089e8f","schema_version":"1.0","event_id":"sha256:4e098328ec040fc8e401ef9d1b68b03c77bca3e8833326d42936a27457089e8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3FCZOBXYADUNK6XDN2GYUQDJJ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reduced Complexity Belief Propagation Decoders for Polar Codes","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-22T06:11:43Z","abstract_excerpt":"Polar codes are newly discovered capacity-achieving codes, which have attracted lots of research efforts. Polar codes can be efficiently decoded by the low-complexity successive cancelation (SC) algorithm and the SC list (SCL) decoding algorithm. The belief propagation (BP) decoding algorithm not only is an alternative to the SC and SCL decoders, but also provides soft outputs that are necessary for joint detection and decoding. Both the BP decoder and the soft cancelation (SCAN) decoder were proposed for polar codes to output soft information about the coded bits. In this paper, first a belie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06495","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:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pegkrVaqC8X5SHJxdQb5kFO8RYB3xVUamDnJoeXfYwZAHv47sc8vjx3thFyYNcY1MKgICoU7lmyFM5Hrw7TsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:31:46.760900Z"},"content_sha256":"41f848ce3381bae9df025adc37b0942c6923af2cbd9756ca760ec12b29069ead","schema_version":"1.0","event_id":"sha256:41f848ce3381bae9df025adc37b0942c6923af2cbd9756ca760ec12b29069ead"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FCZOBXYADUNK6XDN2GYUQDJJ4/bundle.json","state_url":"https://pith.science/pith/3FCZOBXYADUNK6XDN2GYUQDJJ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FCZOBXYADUNK6XDN2GYUQDJJ4/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-30T06:31:46Z","links":{"resolver":"https://pith.science/pith/3FCZOBXYADUNK6XDN2GYUQDJJ4","bundle":"https://pith.science/pith/3FCZOBXYADUNK6XDN2GYUQDJJ4/bundle.json","state":"https://pith.science/pith/3FCZOBXYADUNK6XDN2GYUQDJJ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FCZOBXYADUNK6XDN2GYUQDJJ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3FCZOBXYADUNK6XDN2GYUQDJJ4","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":"97bee31170827c90b1de64bf3ee4dca6e43399e1326b06922ef8c99a520acf76","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-22T06:11:43Z","title_canon_sha256":"d2ad864d116b9eeaf84d73165826a1f53d02d3efbf86e629eba7af7e9cbb617d"},"schema_version":"1.0","source":{"id":"1510.06495","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06495","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06495v1","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06495","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"3FCZOBXYADUN","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3FCZOBXYADUNK6XD","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3FCZOBXY","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:41f848ce3381bae9df025adc37b0942c6923af2cbd9756ca760ec12b29069ead","target":"graph","created_at":"2026-05-18T00:58:10Z","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 newly discovered capacity-achieving codes, which have attracted lots of research efforts. Polar codes can be efficiently decoded by the low-complexity successive cancelation (SC) algorithm and the SC list (SCL) decoding algorithm. The belief propagation (BP) decoding algorithm not only is an alternative to the SC and SCL decoders, but also provides soft outputs that are necessary for joint detection and decoding. Both the BP decoder and the soft cancelation (SCAN) decoder were proposed for polar codes to output soft information about the coded bits. In this paper, first a belie","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-22T06:11:43Z","title":"Reduced Complexity Belief Propagation Decoders for Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06495","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:4e098328ec040fc8e401ef9d1b68b03c77bca3e8833326d42936a27457089e8f","target":"record","created_at":"2026-05-18T00:58:10Z","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":"97bee31170827c90b1de64bf3ee4dca6e43399e1326b06922ef8c99a520acf76","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-22T06:11:43Z","title_canon_sha256":"d2ad864d116b9eeaf84d73165826a1f53d02d3efbf86e629eba7af7e9cbb617d"},"schema_version":"1.0","source":{"id":"1510.06495","kind":"arxiv","version":1}},"canonical_sha256":"d9459706f800e8d57ae36e8d8a40694f263fdeda21a3648c58ad5964e81c24c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9459706f800e8d57ae36e8d8a40694f263fdeda21a3648c58ad5964e81c24c4","first_computed_at":"2026-05-18T00:58:10.217427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:10.217427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QP3NxwquNG4OJ2qJylfTYjSBBAJ80cdmS2qsSrAtMz0K0VcX7CxyYV0dAxE7Z+n/S3uMMpBWy3DfkEJJZg3oDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:10.218045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.06495","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e098328ec040fc8e401ef9d1b68b03c77bca3e8833326d42936a27457089e8f","sha256:41f848ce3381bae9df025adc37b0942c6923af2cbd9756ca760ec12b29069ead"],"state_sha256":"8c0b0df7f7f072fc418ae5fe5c8d3057e112bcbc11d2acb44ac1693476427a3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dNTsu+X+0oYB6bAsLgeq0vrdCJHyNAYsofhxNMQ1LJ9dZITJhX4ArDFSY60d5kS7sgyY/XcsMSRRyPpWQSBxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:31:46.764305Z","bundle_sha256":"49b6cc187f373c8b2190d3c0c52485cfc4c8fd9b9a1e4fef0c5f8891d8ce10ec"}}