{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:NUVVIXSLB3HB7YU2LSVYMZ7WPP","short_pith_number":"pith:NUVVIXSL","schema_version":"1.0","canonical_sha256":"6d2b545e4b0ece1fe29a5cab8667f67bf793884d866b7c9f51c26a88daecdfeb","source":{"kind":"arxiv","id":"1010.0333","version":1},"attestation_state":"computed","paper":{"title":"Effects of Single-Cycle Structure on Iterative Decoding for Low-Density Parity-Check Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kenta Kasai, Kohichi Sakaniwa, Ryuhei Mori, Toshiyuki Tanaka","submitted_at":"2010-10-02T13:08:01Z","abstract_excerpt":"We consider communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) codes and belief propagation (BP) decoding. For fixed numbers of BP iterations, the bit error probability approaches a limit as blocklength tends to infinity, and the limit is obtained via density evolution. On the other hand, the difference between the bit error probability of codes with blocklength $n$ and that in the large blocklength limit is asymptotically $\\alpha(\\epsilon,t)/n + \\Theta(n^{-2})$ where $\\alpha(\\epsilon,t)$ denotes a specific constant determined by the code ensemble conside"},"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":"1010.0333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-02T13:08:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b138a13d26237ebc85082a5094e1534d3e7de6e0884332d476c33774a1b6e4c1","abstract_canon_sha256":"03f2bc451c324e607dfd9d595b7dcb1a7b227d1be2cb01d732d33aca4df30dc8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.951268Z","signature_b64":"Kcnj8icWMKv/hfX17eWjiQKtZMSftGMKcBKtXpMDWztFm/3neG4Q9GNqlUseSp70sjT8Kzs2lsgzxrUvxpunCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d2b545e4b0ece1fe29a5cab8667f67bf793884d866b7c9f51c26a88daecdfeb","last_reissued_at":"2026-05-18T00:58:43.950721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.950721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effects of Single-Cycle Structure on Iterative Decoding for Low-Density Parity-Check Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kenta Kasai, Kohichi Sakaniwa, Ryuhei Mori, Toshiyuki Tanaka","submitted_at":"2010-10-02T13:08:01Z","abstract_excerpt":"We consider communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) codes and belief propagation (BP) decoding. For fixed numbers of BP iterations, the bit error probability approaches a limit as blocklength tends to infinity, and the limit is obtained via density evolution. On the other hand, the difference between the bit error probability of codes with blocklength $n$ and that in the large blocklength limit is asymptotically $\\alpha(\\epsilon,t)/n + \\Theta(n^{-2})$ where $\\alpha(\\epsilon,t)$ denotes a specific constant determined by the code ensemble conside"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0333","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":"1010.0333","created_at":"2026-05-18T00:58:43.950814+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.0333v1","created_at":"2026-05-18T00:58:43.950814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0333","created_at":"2026-05-18T00:58:43.950814+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUVVIXSLB3HB","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUVVIXSLB3HB7YU2","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUVVIXSL","created_at":"2026-05-18T12:26:10.704358+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/NUVVIXSLB3HB7YU2LSVYMZ7WPP","json":"https://pith.science/pith/NUVVIXSLB3HB7YU2LSVYMZ7WPP.json","graph_json":"https://pith.science/api/pith-number/NUVVIXSLB3HB7YU2LSVYMZ7WPP/graph.json","events_json":"https://pith.science/api/pith-number/NUVVIXSLB3HB7YU2LSVYMZ7WPP/events.json","paper":"https://pith.science/paper/NUVVIXSL"},"agent_actions":{"view_html":"https://pith.science/pith/NUVVIXSLB3HB7YU2LSVYMZ7WPP","download_json":"https://pith.science/pith/NUVVIXSLB3HB7YU2LSVYMZ7WPP.json","view_paper":"https://pith.science/paper/NUVVIXSL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.0333&json=true","fetch_graph":"https://pith.science/api/pith-number/NUVVIXSLB3HB7YU2LSVYMZ7WPP/graph.json","fetch_events":"https://pith.science/api/pith-number/NUVVIXSLB3HB7YU2LSVYMZ7WPP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUVVIXSLB3HB7YU2LSVYMZ7WPP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUVVIXSLB3HB7YU2LSVYMZ7WPP/action/storage_attestation","attest_author":"https://pith.science/pith/NUVVIXSLB3HB7YU2LSVYMZ7WPP/action/author_attestation","sign_citation":"https://pith.science/pith/NUVVIXSLB3HB7YU2LSVYMZ7WPP/action/citation_signature","submit_replication":"https://pith.science/pith/NUVVIXSLB3HB7YU2LSVYMZ7WPP/action/replication_record"}},"created_at":"2026-05-18T00:58:43.950814+00:00","updated_at":"2026-05-18T00:58:43.950814+00:00"}