{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:TW7P66WYBABIWJTW2QYSR3IIWZ","short_pith_number":"pith:TW7P66WY","canonical_record":{"source":{"id":"0903.2232","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-12T18:26:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0cb485d3cac23d2263fbda2e9ff3a1f9732063ebb44713a11b3b0c66eceb6eac","abstract_canon_sha256":"21ce41fdeb51002234d848665e08f64a9cadb971327cbca65989c48922d6f3c2"},"schema_version":"1.0"},"canonical_sha256":"9dbeff7ad808028b2676d43128ed08b66b08f765e5e2b0a0e5c1c7f0afd8eb39","source":{"kind":"arxiv","id":"0903.2232","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.2232","created_at":"2026-05-18T04:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"0903.2232v4","created_at":"2026-05-18T04:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.2232","created_at":"2026-05-18T04:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"TW7P66WYBABI","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"TW7P66WYBABIWJTW","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"TW7P66WY","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:TW7P66WYBABIWJTW2QYSR3IIWZ","target":"record","payload":{"canonical_record":{"source":{"id":"0903.2232","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-12T18:26:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0cb485d3cac23d2263fbda2e9ff3a1f9732063ebb44713a11b3b0c66eceb6eac","abstract_canon_sha256":"21ce41fdeb51002234d848665e08f64a9cadb971327cbca65989c48922d6f3c2"},"schema_version":"1.0"},"canonical_sha256":"9dbeff7ad808028b2676d43128ed08b66b08f765e5e2b0a0e5c1c7f0afd8eb39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:32.769678Z","signature_b64":"8wMSQ3jKO1D2iqeFVIGQ0l9/U8xJ501mnjRQbay/Cd1+jNnJy4yiS2Sbzv5s6+OP7E2bLn2syIwlVOeXsXF1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dbeff7ad808028b2676d43128ed08b66b08f765e5e2b0a0e5c1c7f0afd8eb39","last_reissued_at":"2026-05-18T04:03:32.768930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:32.768930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0903.2232","source_version":4,"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-18T04:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JVxcbPTR7UD+7+oIsHwlyYdJVVp6nVnVg472MBhvHhEuTR0VWtad2hpF/KyqdtkKiPeqvExybrQjToQKexLKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:59:25.076382Z"},"content_sha256":"93e43c6ec520f040196ec58b9edda3631eef92445b092724186ddd23ea2f8bfb","schema_version":"1.0","event_id":"sha256:93e43c6ec520f040196ec58b9edda3631eef92445b092724186ddd23ea2f8bfb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:TW7P66WYBABIWJTW2QYSR3IIWZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Iterative Decoding of High-Rate LDPC Codes With Applications in Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fan Zhang, Henry D. Pfister","submitted_at":"2009-03-12T18:26:10Z","abstract_excerpt":"This paper considers the performance of $(j,k)$-regular low-density parity-check (LDPC) codes with message-passing (MP) decoding algorithms in the high-rate regime. In particular, we derive the high-rate scaling law for MP decoding of LDPC codes on the binary erasure channel (BEC) and the $q$-ary symmetric channel ($q$-SC). For the BEC, the density evolution (DE) threshold of iterative decoding scales like $\\Theta(k^{-1})$ and the critical stopping ratio scales like $\\Theta(k^{-j/(j-2)})$. For the $q$-SC, the DE threshold of verification decoding depends on the details of the decoder and scale"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.2232","kind":"arxiv","version":4},"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-18T04:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CCRLKIDq5jMZv7kzamfWSKFsS8Ke1Z7N/GOOqL5y+FUInWWQe0di3anUIOKsL+h3WjAKXn1tLqQQTgT3Lz19CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:59:25.076770Z"},"content_sha256":"da806eef174a02f2d9c153c500178d4326c7c084597e59ce5cdd98fe40da651a","schema_version":"1.0","event_id":"sha256:da806eef174a02f2d9c153c500178d4326c7c084597e59ce5cdd98fe40da651a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TW7P66WYBABIWJTW2QYSR3IIWZ/bundle.json","state_url":"https://pith.science/pith/TW7P66WYBABIWJTW2QYSR3IIWZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TW7P66WYBABIWJTW2QYSR3IIWZ/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-27T12:59:25Z","links":{"resolver":"https://pith.science/pith/TW7P66WYBABIWJTW2QYSR3IIWZ","bundle":"https://pith.science/pith/TW7P66WYBABIWJTW2QYSR3IIWZ/bundle.json","state":"https://pith.science/pith/TW7P66WYBABIWJTW2QYSR3IIWZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TW7P66WYBABIWJTW2QYSR3IIWZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:TW7P66WYBABIWJTW2QYSR3IIWZ","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":"21ce41fdeb51002234d848665e08f64a9cadb971327cbca65989c48922d6f3c2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-12T18:26:10Z","title_canon_sha256":"0cb485d3cac23d2263fbda2e9ff3a1f9732063ebb44713a11b3b0c66eceb6eac"},"schema_version":"1.0","source":{"id":"0903.2232","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.2232","created_at":"2026-05-18T04:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"0903.2232v4","created_at":"2026-05-18T04:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.2232","created_at":"2026-05-18T04:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"TW7P66WYBABI","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"TW7P66WYBABIWJTW","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"TW7P66WY","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:da806eef174a02f2d9c153c500178d4326c7c084597e59ce5cdd98fe40da651a","target":"graph","created_at":"2026-05-18T04:03:32Z","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":"This paper considers the performance of $(j,k)$-regular low-density parity-check (LDPC) codes with message-passing (MP) decoding algorithms in the high-rate regime. In particular, we derive the high-rate scaling law for MP decoding of LDPC codes on the binary erasure channel (BEC) and the $q$-ary symmetric channel ($q$-SC). For the BEC, the density evolution (DE) threshold of iterative decoding scales like $\\Theta(k^{-1})$ and the critical stopping ratio scales like $\\Theta(k^{-j/(j-2)})$. For the $q$-SC, the DE threshold of verification decoding depends on the details of the decoder and scale","authors_text":"Fan Zhang, Henry D. Pfister","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-12T18:26:10Z","title":"On the Iterative Decoding of High-Rate LDPC Codes With Applications in Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.2232","kind":"arxiv","version":4},"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:93e43c6ec520f040196ec58b9edda3631eef92445b092724186ddd23ea2f8bfb","target":"record","created_at":"2026-05-18T04:03:32Z","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":"21ce41fdeb51002234d848665e08f64a9cadb971327cbca65989c48922d6f3c2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-12T18:26:10Z","title_canon_sha256":"0cb485d3cac23d2263fbda2e9ff3a1f9732063ebb44713a11b3b0c66eceb6eac"},"schema_version":"1.0","source":{"id":"0903.2232","kind":"arxiv","version":4}},"canonical_sha256":"9dbeff7ad808028b2676d43128ed08b66b08f765e5e2b0a0e5c1c7f0afd8eb39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9dbeff7ad808028b2676d43128ed08b66b08f765e5e2b0a0e5c1c7f0afd8eb39","first_computed_at":"2026-05-18T04:03:32.768930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:32.768930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8wMSQ3jKO1D2iqeFVIGQ0l9/U8xJ501mnjRQbay/Cd1+jNnJy4yiS2Sbzv5s6+OP7E2bLn2syIwlVOeXsXF1CA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:32.769678Z","signed_message":"canonical_sha256_bytes"},"source_id":"0903.2232","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93e43c6ec520f040196ec58b9edda3631eef92445b092724186ddd23ea2f8bfb","sha256:da806eef174a02f2d9c153c500178d4326c7c084597e59ce5cdd98fe40da651a"],"state_sha256":"faaf539a8e281eac036f346c4ec2d582b69c3bb518a41686cbd00656b5504ae2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b+MQ4nbg5GrI8jGXG7gFoux91pfW7/nRiQ2Gj9/9zbit93+YX4LY0EpBcB9exDAIYmS/vIWKosiaHhD/iQptCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:59:25.078932Z","bundle_sha256":"48404ba7b7103fb3a2503369b5d461823ff1cb8d5af0fcb1929bba589833f28f"}}