{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UIZLR6DUVZSLPHF5BK4EXGTN3U","short_pith_number":"pith:UIZLR6DU","schema_version":"1.0","canonical_sha256":"a232b8f874ae64b79cbd0ab84b9a6ddd13f02965f21cc6d9a2109c9cbe52ec46","source":{"kind":"arxiv","id":"1309.7102","version":1},"attestation_state":"computed","paper":{"title":"Finite Length Analysis of LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gottfried Lechner, Khoa D. Nguyen, Md. Noor-A-Rahim","submitted_at":"2013-09-27T02:43:17Z","abstract_excerpt":"In this paper, we study the performance of finite-length LDPC codes in the waterfall region. We propose an algorithm to predict the error performance of finite-length LDPC codes over various binary memoryless channels. Through numerical results, we find that our technique gives better performance prediction compared to existing techniques."},"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":"1309.7102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-27T02:43:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b37c637bc060146c5ec4c6380cba20b989ff4a92df3a4ae30ae199766d37d9b4","abstract_canon_sha256":"ab6b7edef02f6c8f9cf87998a1f22286fcc59c1991f540cbde60fdf53bcd0321"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:08.031411Z","signature_b64":"6QN671Puc541LglBCUOJTCFSAJuMT9lWzrBbwy6uLTeHg4A6b1IzI6aqlGE0wJWQm2sCVc6eIv1cynku/TjcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a232b8f874ae64b79cbd0ab84b9a6ddd13f02965f21cc6d9a2109c9cbe52ec46","last_reissued_at":"2026-05-18T03:12:08.030780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:08.030780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite Length Analysis of LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gottfried Lechner, Khoa D. Nguyen, Md. Noor-A-Rahim","submitted_at":"2013-09-27T02:43:17Z","abstract_excerpt":"In this paper, we study the performance of finite-length LDPC codes in the waterfall region. We propose an algorithm to predict the error performance of finite-length LDPC codes over various binary memoryless channels. Through numerical results, we find that our technique gives better performance prediction compared to existing techniques."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7102","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":"1309.7102","created_at":"2026-05-18T03:12:08.030862+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7102v1","created_at":"2026-05-18T03:12:08.030862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7102","created_at":"2026-05-18T03:12:08.030862+00:00"},{"alias_kind":"pith_short_12","alias_value":"UIZLR6DUVZSL","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UIZLR6DUVZSLPHF5","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UIZLR6DU","created_at":"2026-05-18T12:28:02.375192+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/UIZLR6DUVZSLPHF5BK4EXGTN3U","json":"https://pith.science/pith/UIZLR6DUVZSLPHF5BK4EXGTN3U.json","graph_json":"https://pith.science/api/pith-number/UIZLR6DUVZSLPHF5BK4EXGTN3U/graph.json","events_json":"https://pith.science/api/pith-number/UIZLR6DUVZSLPHF5BK4EXGTN3U/events.json","paper":"https://pith.science/paper/UIZLR6DU"},"agent_actions":{"view_html":"https://pith.science/pith/UIZLR6DUVZSLPHF5BK4EXGTN3U","download_json":"https://pith.science/pith/UIZLR6DUVZSLPHF5BK4EXGTN3U.json","view_paper":"https://pith.science/paper/UIZLR6DU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7102&json=true","fetch_graph":"https://pith.science/api/pith-number/UIZLR6DUVZSLPHF5BK4EXGTN3U/graph.json","fetch_events":"https://pith.science/api/pith-number/UIZLR6DUVZSLPHF5BK4EXGTN3U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UIZLR6DUVZSLPHF5BK4EXGTN3U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UIZLR6DUVZSLPHF5BK4EXGTN3U/action/storage_attestation","attest_author":"https://pith.science/pith/UIZLR6DUVZSLPHF5BK4EXGTN3U/action/author_attestation","sign_citation":"https://pith.science/pith/UIZLR6DUVZSLPHF5BK4EXGTN3U/action/citation_signature","submit_replication":"https://pith.science/pith/UIZLR6DUVZSLPHF5BK4EXGTN3U/action/replication_record"}},"created_at":"2026-05-18T03:12:08.030862+00:00","updated_at":"2026-05-18T03:12:08.030862+00:00"}