{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GJRQFDN2T343A7RRG6BRPKE5TJ","short_pith_number":"pith:GJRQFDN2","canonical_record":{"source":{"id":"1505.04979","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T12:58:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7a5eb2687bf0f630c3c9b5972932acb7c21f482b791e9feced69df49f6f49b12","abstract_canon_sha256":"276b943c84353410d2323acf333db328afcfc83c9b8a74c808c5fbf8041f21dc"},"schema_version":"1.0"},"canonical_sha256":"3263028dba9ef9b07e31378317a89d9a69c58c6aacea6360a2a11bf842e0ed8d","source":{"kind":"arxiv","id":"1505.04979","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04979","created_at":"2026-05-18T01:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04979v2","created_at":"2026-05-18T01:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04979","created_at":"2026-05-18T01:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"GJRQFDN2T343","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GJRQFDN2T343A7RR","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GJRQFDN2","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GJRQFDN2T343A7RRG6BRPKE5TJ","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04979","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T12:58:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7a5eb2687bf0f630c3c9b5972932acb7c21f482b791e9feced69df49f6f49b12","abstract_canon_sha256":"276b943c84353410d2323acf333db328afcfc83c9b8a74c808c5fbf8041f21dc"},"schema_version":"1.0"},"canonical_sha256":"3263028dba9ef9b07e31378317a89d9a69c58c6aacea6360a2a11bf842e0ed8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:49.710961Z","signature_b64":"+mR1nmqoapFKoVPGlBceJI4/CzVnkHol4M++hiW55e3XX98DJPy2irqDCEUNSWm5XoszI7mqBIBGYC6RQA8HBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3263028dba9ef9b07e31378317a89d9a69c58c6aacea6360a2a11bf842e0ed8d","last_reissued_at":"2026-05-18T01:34:49.710429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:49.710429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04979","source_version":2,"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:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GbrHN2wAZO2o1JYuLxJQyXhDBEx5ZQlXPHxt0Nz1x/P9pru/n36LmmJ1j8lpbtuYoVVc6MpoQqwX2keiFBpdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:05:49.827760Z"},"content_sha256":"aabe5147a9f4408bbb4d9ebcfe156ffcfa98dc86ac4037d5d06bd350240d9b3f","schema_version":"1.0","event_id":"sha256:aabe5147a9f4408bbb4d9ebcfe156ffcfa98dc86ac4037d5d06bd350240d9b3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GJRQFDN2T343A7RRG6BRPKE5TJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low Complexity Belief Propagation Polar Code Decoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chi-Ying Tsui, Ji Chen, Syed Mohsin Abbas, YouZhe Fan","submitted_at":"2015-05-19T12:58:58Z","abstract_excerpt":"Since its invention, polar code has received a lot of attention because of its capacity-achieving performance and low encoding and decoding complexity. Successive cancellation decoding (SCD) and belief propagation decoding (BPD) are two of the most popular approaches for decoding polar codes. SCD is able to achieve good error-correcting performance and is less computationally expensive as compared to BPD. However SCDs suffer from long latency and low throughput due to the serial nature of the successive cancellation algorithm. BPD is parallel in nature and hence is more attractive for high thr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04979","kind":"arxiv","version":2},"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:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GovKFG1+hhFasmlwKysZkDbenEQqCRKk3x2JKiBpGs4ksiOKGBVVGNhnmLAQqHIm8PNYikIlYeJpHOwBfkGnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:05:49.828135Z"},"content_sha256":"4e3d94b170b41318a202d18ca7e1234d115004d8a75f2a2a2902cee68745759b","schema_version":"1.0","event_id":"sha256:4e3d94b170b41318a202d18ca7e1234d115004d8a75f2a2a2902cee68745759b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJRQFDN2T343A7RRG6BRPKE5TJ/bundle.json","state_url":"https://pith.science/pith/GJRQFDN2T343A7RRG6BRPKE5TJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJRQFDN2T343A7RRG6BRPKE5TJ/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-27T17:05:49Z","links":{"resolver":"https://pith.science/pith/GJRQFDN2T343A7RRG6BRPKE5TJ","bundle":"https://pith.science/pith/GJRQFDN2T343A7RRG6BRPKE5TJ/bundle.json","state":"https://pith.science/pith/GJRQFDN2T343A7RRG6BRPKE5TJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJRQFDN2T343A7RRG6BRPKE5TJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GJRQFDN2T343A7RRG6BRPKE5TJ","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":"276b943c84353410d2323acf333db328afcfc83c9b8a74c808c5fbf8041f21dc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T12:58:58Z","title_canon_sha256":"7a5eb2687bf0f630c3c9b5972932acb7c21f482b791e9feced69df49f6f49b12"},"schema_version":"1.0","source":{"id":"1505.04979","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04979","created_at":"2026-05-18T01:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04979v2","created_at":"2026-05-18T01:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04979","created_at":"2026-05-18T01:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"GJRQFDN2T343","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GJRQFDN2T343A7RR","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GJRQFDN2","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:4e3d94b170b41318a202d18ca7e1234d115004d8a75f2a2a2902cee68745759b","target":"graph","created_at":"2026-05-18T01:34: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":"Since its invention, polar code has received a lot of attention because of its capacity-achieving performance and low encoding and decoding complexity. Successive cancellation decoding (SCD) and belief propagation decoding (BPD) are two of the most popular approaches for decoding polar codes. SCD is able to achieve good error-correcting performance and is less computationally expensive as compared to BPD. However SCDs suffer from long latency and low throughput due to the serial nature of the successive cancellation algorithm. BPD is parallel in nature and hence is more attractive for high thr","authors_text":"Chi-Ying Tsui, Ji Chen, Syed Mohsin Abbas, YouZhe Fan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T12:58:58Z","title":"Low Complexity Belief Propagation Polar Code Decoders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04979","kind":"arxiv","version":2},"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:aabe5147a9f4408bbb4d9ebcfe156ffcfa98dc86ac4037d5d06bd350240d9b3f","target":"record","created_at":"2026-05-18T01:34: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":"276b943c84353410d2323acf333db328afcfc83c9b8a74c808c5fbf8041f21dc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-19T12:58:58Z","title_canon_sha256":"7a5eb2687bf0f630c3c9b5972932acb7c21f482b791e9feced69df49f6f49b12"},"schema_version":"1.0","source":{"id":"1505.04979","kind":"arxiv","version":2}},"canonical_sha256":"3263028dba9ef9b07e31378317a89d9a69c58c6aacea6360a2a11bf842e0ed8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3263028dba9ef9b07e31378317a89d9a69c58c6aacea6360a2a11bf842e0ed8d","first_computed_at":"2026-05-18T01:34:49.710429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:49.710429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+mR1nmqoapFKoVPGlBceJI4/CzVnkHol4M++hiW55e3XX98DJPy2irqDCEUNSWm5XoszI7mqBIBGYC6RQA8HBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:49.710961Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04979","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aabe5147a9f4408bbb4d9ebcfe156ffcfa98dc86ac4037d5d06bd350240d9b3f","sha256:4e3d94b170b41318a202d18ca7e1234d115004d8a75f2a2a2902cee68745759b"],"state_sha256":"38394d7da35261a72fe87ec60f64c4a88e5285021131667bf794c38997d34730"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WEuwvOwYFqyt+6kIL2Sa91XSgRhPYNq9zls8zfRN5oEXwnn8hMiihyqgWjYX3IZgET+BpwAjTo6IcAKeI8XlDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:05:49.831794Z","bundle_sha256":"7300e28089f75a47ff7ab1bc166dd0d7399b9d1e754ed35e30f56f85cb9ef946"}}