{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WDLC4SI5B7WZERJHVXAUWHUD6Y","short_pith_number":"pith:WDLC4SI5","schema_version":"1.0","canonical_sha256":"b0d62e491d0fed924527adc14b1e83f62494abb45acb767850bf6ed46a7b164d","source":{"kind":"arxiv","id":"1605.04661","version":1},"attestation_state":"computed","paper":{"title":"Optimization of Graph Based Codes for Belief Propagation Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lawrence Ong, Regina Berretta, Sachini Jayasooriya, Sarah J. Johnson","submitted_at":"2016-05-16T06:26:25Z","abstract_excerpt":"A low-density parity-check (LDPC) code is a linear block code described by a sparse parity-check matrix, which can be efficiently represented by a bipartite Tanner graph. The standard iterative decoding algorithm, known as belief propagation, passes messages along the edges of this Tanner graph. Density evolution is an efficient method to analyze the performance of the belief propagation decoding algorithm for a particular LDPC code ensemble, enabling the determination of a decoding threshold. The basic problem addressed in this work is how to optimize the Tanner graph so that the decoding thr"},"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":"1605.04661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-16T06:26:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7db6bcd9eaa9c3f95ecc86bd0e02f946f0ce1007341a0930d5a2e8f8dd3c9248","abstract_canon_sha256":"2c4120c8a4d4e9d0e9e45bf3222b17f0668f7bfcf7f220229fd9ca1e06c017c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:46.600347Z","signature_b64":"ptdnHYDg+EPINrmQ6BAgwOuTw73292YbOu0aWb23ms42TfuFRVqR7RUoB/57PXE2V5cPtV5rvBicVLOZQRTJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0d62e491d0fed924527adc14b1e83f62494abb45acb767850bf6ed46a7b164d","last_reissued_at":"2026-05-18T01:14:46.599677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:46.599677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization of Graph Based Codes for Belief Propagation Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lawrence Ong, Regina Berretta, Sachini Jayasooriya, Sarah J. Johnson","submitted_at":"2016-05-16T06:26:25Z","abstract_excerpt":"A low-density parity-check (LDPC) code is a linear block code described by a sparse parity-check matrix, which can be efficiently represented by a bipartite Tanner graph. The standard iterative decoding algorithm, known as belief propagation, passes messages along the edges of this Tanner graph. Density evolution is an efficient method to analyze the performance of the belief propagation decoding algorithm for a particular LDPC code ensemble, enabling the determination of a decoding threshold. The basic problem addressed in this work is how to optimize the Tanner graph so that the decoding thr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04661","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.04661","created_at":"2026-05-18T01:14:46.599775+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04661v1","created_at":"2026-05-18T01:14:46.599775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04661","created_at":"2026-05-18T01:14:46.599775+00:00"},{"alias_kind":"pith_short_12","alias_value":"WDLC4SI5B7WZ","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WDLC4SI5B7WZERJH","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WDLC4SI5","created_at":"2026-05-18T12:30:48.956258+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/WDLC4SI5B7WZERJHVXAUWHUD6Y","json":"https://pith.science/pith/WDLC4SI5B7WZERJHVXAUWHUD6Y.json","graph_json":"https://pith.science/api/pith-number/WDLC4SI5B7WZERJHVXAUWHUD6Y/graph.json","events_json":"https://pith.science/api/pith-number/WDLC4SI5B7WZERJHVXAUWHUD6Y/events.json","paper":"https://pith.science/paper/WDLC4SI5"},"agent_actions":{"view_html":"https://pith.science/pith/WDLC4SI5B7WZERJHVXAUWHUD6Y","download_json":"https://pith.science/pith/WDLC4SI5B7WZERJHVXAUWHUD6Y.json","view_paper":"https://pith.science/paper/WDLC4SI5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04661&json=true","fetch_graph":"https://pith.science/api/pith-number/WDLC4SI5B7WZERJHVXAUWHUD6Y/graph.json","fetch_events":"https://pith.science/api/pith-number/WDLC4SI5B7WZERJHVXAUWHUD6Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WDLC4SI5B7WZERJHVXAUWHUD6Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WDLC4SI5B7WZERJHVXAUWHUD6Y/action/storage_attestation","attest_author":"https://pith.science/pith/WDLC4SI5B7WZERJHVXAUWHUD6Y/action/author_attestation","sign_citation":"https://pith.science/pith/WDLC4SI5B7WZERJHVXAUWHUD6Y/action/citation_signature","submit_replication":"https://pith.science/pith/WDLC4SI5B7WZERJHVXAUWHUD6Y/action/replication_record"}},"created_at":"2026-05-18T01:14:46.599775+00:00","updated_at":"2026-05-18T01:14:46.599775+00:00"}