{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:R6QZCNPHIYY5LTGE6NU5TIQ2QM","short_pith_number":"pith:R6QZCNPH","canonical_record":{"source":{"id":"1411.7286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-26T16:19:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1921f9a3463e38bc697899182bf8556e29d8a82b3de8f6a9bc6546c9684b2a9f","abstract_canon_sha256":"6f9a32d35ceb9091c3548f13bf4b817f55e57adaf883dc0b476edf6730187195"},"schema_version":"1.0"},"canonical_sha256":"8fa19135e74631d5ccc4f369d9a21a8300cf63bf46cdcaa718ebbebeb273433e","source":{"kind":"arxiv","id":"1411.7286","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7286","created_at":"2026-05-18T02:32:44Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7286v1","created_at":"2026-05-18T02:32:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7286","created_at":"2026-05-18T02:32:44Z"},{"alias_kind":"pith_short_12","alias_value":"R6QZCNPHIYY5","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"R6QZCNPHIYY5LTGE","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"R6QZCNPH","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:R6QZCNPHIYY5LTGE6NU5TIQ2QM","target":"record","payload":{"canonical_record":{"source":{"id":"1411.7286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-26T16:19:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1921f9a3463e38bc697899182bf8556e29d8a82b3de8f6a9bc6546c9684b2a9f","abstract_canon_sha256":"6f9a32d35ceb9091c3548f13bf4b817f55e57adaf883dc0b476edf6730187195"},"schema_version":"1.0"},"canonical_sha256":"8fa19135e74631d5ccc4f369d9a21a8300cf63bf46cdcaa718ebbebeb273433e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:44.772251Z","signature_b64":"aqC1NgYLrabdsVrNyQaG/YkifPV2BJh7iw38BdQC/aONDTccRvfmQ/Jfd1qeWqjuu8LM/Mis86Du9gp6iroqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fa19135e74631d5ccc4f369d9a21a8300cf63bf46cdcaa718ebbebeb273433e","last_reissued_at":"2026-05-18T02:32:44.771765Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:44.771765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.7286","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-18T02:32:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XITIP2Uv4m//WCicMOL0FUjH9nhMrYX1z/iWscfjV38bpZj+G3prwvIeNVSk7G2YyPVg1AUCknouQN6Oo8a4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T21:22:04.968601Z"},"content_sha256":"95056e06301f9ba522da1cbaf5d640018528d5061dd29fcdf0573606d96427cb","schema_version":"1.0","event_id":"sha256:95056e06301f9ba522da1cbaf5d640018528d5061dd29fcdf0573606d96427cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:R6QZCNPHIYY5LTGE6NU5TIQ2QM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithm and Architecture for Hybrid Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bo Yuan, Keshab K. Parhi","submitted_at":"2014-11-26T16:19:38Z","abstract_excerpt":"Polar codes are the first provable capacity-achieving forward error correction (FEC) codes. In general polar codes can be decoded via either successive cancellation (SC) or belief propagation (BP) decoding algorithm. However, to date practical applications of polar codes have been hindered by the long decoding latency and limited error-correcting performance problems. In this paper, based on our recent proposed early stopping criteria for the BP algorithm, we propose a hybrid BP-SC decoding scheme to improve the decoding performance of polar codes with relatively short latency. Simulation resu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7286","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-18T02:32:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vEeU12EHpm62HdUhjP1ij7BX39HONkSFlpYASLKqq8QKcZQx6vTyp8lYPgLZ6CjbwVHJ6HskzD0KT0hy4lR/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T21:22:04.968959Z"},"content_sha256":"f595762561cce38b512c293ab59e654d7cbc783840cb94483ea08701669bd062","schema_version":"1.0","event_id":"sha256:f595762561cce38b512c293ab59e654d7cbc783840cb94483ea08701669bd062"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6QZCNPHIYY5LTGE6NU5TIQ2QM/bundle.json","state_url":"https://pith.science/pith/R6QZCNPHIYY5LTGE6NU5TIQ2QM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6QZCNPHIYY5LTGE6NU5TIQ2QM/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-01T21:22:04Z","links":{"resolver":"https://pith.science/pith/R6QZCNPHIYY5LTGE6NU5TIQ2QM","bundle":"https://pith.science/pith/R6QZCNPHIYY5LTGE6NU5TIQ2QM/bundle.json","state":"https://pith.science/pith/R6QZCNPHIYY5LTGE6NU5TIQ2QM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6QZCNPHIYY5LTGE6NU5TIQ2QM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:R6QZCNPHIYY5LTGE6NU5TIQ2QM","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":"6f9a32d35ceb9091c3548f13bf4b817f55e57adaf883dc0b476edf6730187195","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-26T16:19:38Z","title_canon_sha256":"1921f9a3463e38bc697899182bf8556e29d8a82b3de8f6a9bc6546c9684b2a9f"},"schema_version":"1.0","source":{"id":"1411.7286","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7286","created_at":"2026-05-18T02:32:44Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7286v1","created_at":"2026-05-18T02:32:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7286","created_at":"2026-05-18T02:32:44Z"},{"alias_kind":"pith_short_12","alias_value":"R6QZCNPHIYY5","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"R6QZCNPHIYY5LTGE","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"R6QZCNPH","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:f595762561cce38b512c293ab59e654d7cbc783840cb94483ea08701669bd062","target":"graph","created_at":"2026-05-18T02:32:44Z","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 the first provable capacity-achieving forward error correction (FEC) codes. In general polar codes can be decoded via either successive cancellation (SC) or belief propagation (BP) decoding algorithm. However, to date practical applications of polar codes have been hindered by the long decoding latency and limited error-correcting performance problems. In this paper, based on our recent proposed early stopping criteria for the BP algorithm, we propose a hybrid BP-SC decoding scheme to improve the decoding performance of polar codes with relatively short latency. Simulation resu","authors_text":"Bo Yuan, Keshab K. Parhi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-26T16:19:38Z","title":"Algorithm and Architecture for Hybrid Decoding of Polar Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7286","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:95056e06301f9ba522da1cbaf5d640018528d5061dd29fcdf0573606d96427cb","target":"record","created_at":"2026-05-18T02:32:44Z","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":"6f9a32d35ceb9091c3548f13bf4b817f55e57adaf883dc0b476edf6730187195","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-26T16:19:38Z","title_canon_sha256":"1921f9a3463e38bc697899182bf8556e29d8a82b3de8f6a9bc6546c9684b2a9f"},"schema_version":"1.0","source":{"id":"1411.7286","kind":"arxiv","version":1}},"canonical_sha256":"8fa19135e74631d5ccc4f369d9a21a8300cf63bf46cdcaa718ebbebeb273433e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fa19135e74631d5ccc4f369d9a21a8300cf63bf46cdcaa718ebbebeb273433e","first_computed_at":"2026-05-18T02:32:44.771765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:44.771765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aqC1NgYLrabdsVrNyQaG/YkifPV2BJh7iw38BdQC/aONDTccRvfmQ/Jfd1qeWqjuu8LM/Mis86Du9gp6iroqCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:44.772251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.7286","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95056e06301f9ba522da1cbaf5d640018528d5061dd29fcdf0573606d96427cb","sha256:f595762561cce38b512c293ab59e654d7cbc783840cb94483ea08701669bd062"],"state_sha256":"4b960e5a16b1af13adb446cb2eda3e3c5e1ec1d515f3396af75e5577b56070dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ggyOuVV7C234mKTElox0qx0thMZgFY60VtVKOcEMfs3Mclqw3IJNPrL6paBMfF0VnceNDRNO9IC8xT/3ldBdBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T21:22:04.971091Z","bundle_sha256":"b3f2ede3a05baae6e1e5be5e4a9f5adc981b521d1de26c0237981e9751061aa4"}}