{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:NUVVIXSLB3HB7YU2LSVYMZ7WPP","short_pith_number":"pith:NUVVIXSL","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"},"canonical_sha256":"6d2b545e4b0ece1fe29a5cab8667f67bf793884d866b7c9f51c26a88daecdfeb","source":{"kind":"arxiv","id":"1010.0333","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0333","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0333v1","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0333","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"NUVVIXSLB3HB","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NUVVIXSLB3HB7YU2","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NUVVIXSL","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:NUVVIXSLB3HB7YU2LSVYMZ7WPP","target":"record","payload":{"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"},"canonical_sha256":"6d2b545e4b0ece1fe29a5cab8667f67bf793884d866b7c9f51c26a88daecdfeb","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"},"source_kind":"arxiv","source_id":"1010.0333","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-18T00:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dDuwluJfZK4B+CWGYU1pk8d4mqimtB7hyVgwMJ7ZlkzzLKP9dEuYk1xPt95b8rD5Tw56qOGAH4C6oqVhpEX8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:50:21.465687Z"},"content_sha256":"d4accb7ea7df588f62ace2164456c32d85c3d1f40bc6713646f41b3550593df1","schema_version":"1.0","event_id":"sha256:d4accb7ea7df588f62ace2164456c32d85c3d1f40bc6713646f41b3550593df1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:NUVVIXSLB3HB7YU2LSVYMZ7WPP","target":"graph","payload":{"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"},"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-18T00:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KuEMZW0C9WiyBp8yYWGbtGzuk3a+H3EOfPYqyP6rpL2s/p1tolEkr0riXaJKIQnfDsJ0fmAL0PWNO0jIus+dBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:50:21.466088Z"},"content_sha256":"5d44d66ef1846341fa2531e3347d954d2102e11b176e5247cf374bcdcd7f2aa4","schema_version":"1.0","event_id":"sha256:5d44d66ef1846341fa2531e3347d954d2102e11b176e5247cf374bcdcd7f2aa4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NUVVIXSLB3HB7YU2LSVYMZ7WPP/bundle.json","state_url":"https://pith.science/pith/NUVVIXSLB3HB7YU2LSVYMZ7WPP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NUVVIXSLB3HB7YU2LSVYMZ7WPP/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-05-26T11:50:21Z","links":{"resolver":"https://pith.science/pith/NUVVIXSLB3HB7YU2LSVYMZ7WPP","bundle":"https://pith.science/pith/NUVVIXSLB3HB7YU2LSVYMZ7WPP/bundle.json","state":"https://pith.science/pith/NUVVIXSLB3HB7YU2LSVYMZ7WPP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NUVVIXSLB3HB7YU2LSVYMZ7WPP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:NUVVIXSLB3HB7YU2LSVYMZ7WPP","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":"03f2bc451c324e607dfd9d595b7dcb1a7b227d1be2cb01d732d33aca4df30dc8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-02T13:08:01Z","title_canon_sha256":"b138a13d26237ebc85082a5094e1534d3e7de6e0884332d476c33774a1b6e4c1"},"schema_version":"1.0","source":{"id":"1010.0333","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0333","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0333v1","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0333","created_at":"2026-05-18T00:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"NUVVIXSLB3HB","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NUVVIXSLB3HB7YU2","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NUVVIXSL","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:5d44d66ef1846341fa2531e3347d954d2102e11b176e5247cf374bcdcd7f2aa4","target":"graph","created_at":"2026-05-18T00:58:43Z","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":"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","authors_text":"Kenta Kasai, Kohichi Sakaniwa, Ryuhei Mori, Toshiyuki Tanaka","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-02T13:08:01Z","title":"Effects of Single-Cycle Structure on Iterative Decoding for Low-Density Parity-Check Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0333","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:d4accb7ea7df588f62ace2164456c32d85c3d1f40bc6713646f41b3550593df1","target":"record","created_at":"2026-05-18T00:58:43Z","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":"03f2bc451c324e607dfd9d595b7dcb1a7b227d1be2cb01d732d33aca4df30dc8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-02T13:08:01Z","title_canon_sha256":"b138a13d26237ebc85082a5094e1534d3e7de6e0884332d476c33774a1b6e4c1"},"schema_version":"1.0","source":{"id":"1010.0333","kind":"arxiv","version":1}},"canonical_sha256":"6d2b545e4b0ece1fe29a5cab8667f67bf793884d866b7c9f51c26a88daecdfeb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d2b545e4b0ece1fe29a5cab8667f67bf793884d866b7c9f51c26a88daecdfeb","first_computed_at":"2026-05-18T00:58:43.950721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:43.950721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kcnj8icWMKv/hfX17eWjiQKtZMSftGMKcBKtXpMDWztFm/3neG4Q9GNqlUseSp70sjT8Kzs2lsgzxrUvxpunCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:43.951268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.0333","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4accb7ea7df588f62ace2164456c32d85c3d1f40bc6713646f41b3550593df1","sha256:5d44d66ef1846341fa2531e3347d954d2102e11b176e5247cf374bcdcd7f2aa4"],"state_sha256":"b909d224288e0e029d959d455dfda1409898bbbcc14522fc6717601585e36e2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VKt59iLyztFdTkEEgV2lO6KhGZsRvZLHmbraZp491uY25AVegeLnCgIX1dZ/xzpO2MByiby5ekM3LIp+nJqGBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:50:21.469139Z","bundle_sha256":"5c880af89f8d0c8cfbfb93e76598faff82b0addf5c90d4a66174908d84906e57"}}