{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7FC7ODQL34KMQHCLXK7CBUQQSD","short_pith_number":"pith:7FC7ODQL","schema_version":"1.0","canonical_sha256":"f945f70e0bdf14c81c4bbabe20d21090fc019a0bf4240e263b1070c1a1dcf23d","source":{"kind":"arxiv","id":"1712.08538","version":5},"attestation_state":"computed","paper":{"title":"Sparse Graphs for Belief Propagation Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink","submitted_at":"2017-12-22T15:58:14Z","abstract_excerpt":"We describe a novel approach to interpret a polar code as a low-density parity-check (LDPC)-like code with an underlying sparse decoding graph. This sparse graph is based on the encoding factor graph of polar codes and is suitable for conventional belief propagation (BP) decoding. We discuss several pruning techniques based on the check node decoder (CND) and variable node decoder (VND) update equations, significantly reducing the size (i.e., decoding complexity) of the parity-check matrix. As a result, iterative polar decoding can then be conducted on a sparse graph, akin to the traditional w"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1712.08538","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-22T15:58:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5a3dc6ae42aa9bf40f9df0030fa18a3e73c8655697cf7202d20fbb9d2742db6f","abstract_canon_sha256":"6a0de95475421131c77d0298ff4b2b0dd7d1f748304b79e282e1ead06e7a9040"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:08.141982Z","signature_b64":"flIeKjwB2AxAJz7FwSM4MgxeTlI/Yw47LlmXESbt/COIJ5aZ7GfIQhssj7TaUfgCDYRP/AbzSHR1Xja2G6JvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f945f70e0bdf14c81c4bbabe20d21090fc019a0bf4240e263b1070c1a1dcf23d","last_reissued_at":"2026-05-18T00:16:08.141420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:08.141420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Graphs for Belief Propagation Decoding of Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink","submitted_at":"2017-12-22T15:58:14Z","abstract_excerpt":"We describe a novel approach to interpret a polar code as a low-density parity-check (LDPC)-like code with an underlying sparse decoding graph. This sparse graph is based on the encoding factor graph of polar codes and is suitable for conventional belief propagation (BP) decoding. We discuss several pruning techniques based on the check node decoder (CND) and variable node decoder (VND) update equations, significantly reducing the size (i.e., decoding complexity) of the parity-check matrix. As a result, iterative polar decoding can then be conducted on a sparse graph, akin to the traditional w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08538","kind":"arxiv","version":5},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.08538","created_at":"2026-05-18T00:16:08.141510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.08538v5","created_at":"2026-05-18T00:16:08.141510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08538","created_at":"2026-05-18T00:16:08.141510+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FC7ODQL34KM","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FC7ODQL34KMQHCL","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FC7ODQL","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7FC7ODQL34KMQHCLXK7CBUQQSD","json":"https://pith.science/pith/7FC7ODQL34KMQHCLXK7CBUQQSD.json","graph_json":"https://pith.science/api/pith-number/7FC7ODQL34KMQHCLXK7CBUQQSD/graph.json","events_json":"https://pith.science/api/pith-number/7FC7ODQL34KMQHCLXK7CBUQQSD/events.json","paper":"https://pith.science/paper/7FC7ODQL"},"agent_actions":{"view_html":"https://pith.science/pith/7FC7ODQL34KMQHCLXK7CBUQQSD","download_json":"https://pith.science/pith/7FC7ODQL34KMQHCLXK7CBUQQSD.json","view_paper":"https://pith.science/paper/7FC7ODQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.08538&json=true","fetch_graph":"https://pith.science/api/pith-number/7FC7ODQL34KMQHCLXK7CBUQQSD/graph.json","fetch_events":"https://pith.science/api/pith-number/7FC7ODQL34KMQHCLXK7CBUQQSD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FC7ODQL34KMQHCLXK7CBUQQSD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FC7ODQL34KMQHCLXK7CBUQQSD/action/storage_attestation","attest_author":"https://pith.science/pith/7FC7ODQL34KMQHCLXK7CBUQQSD/action/author_attestation","sign_citation":"https://pith.science/pith/7FC7ODQL34KMQHCLXK7CBUQQSD/action/citation_signature","submit_replication":"https://pith.science/pith/7FC7ODQL34KMQHCLXK7CBUQQSD/action/replication_record"}},"created_at":"2026-05-18T00:16:08.141510+00:00","updated_at":"2026-05-18T00:16:08.141510+00:00"}