{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2X6ZV7VHYVLXTHC7WX4JI34472","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":"ea9e2f7ff704ee1e33567b1f5269ab05a39770189203eed746bb105c6d0c2d55","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-27T00:17:03Z","title_canon_sha256":"67d0fdd4fc2e7c4a73506dc7f033f9e29568acd2b2de15d81b3f23ba0989656c"},"schema_version":"1.0","source":{"id":"1301.6301","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6301","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6301v3","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6301","created_at":"2026-05-18T03:25:15Z"},{"alias_kind":"pith_short_12","alias_value":"2X6ZV7VHYVLX","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2X6ZV7VHYVLXTHC7","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2X6ZV7VH","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:ccba02be9253a09b1340c37353dde246d37160f72ae1c035a9ac68c149ea8581","target":"graph","created_at":"2026-05-18T03:25:15Z","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":"The bit-error threshold of the standard ensemble of Low Density Parity Check (LDPC) codes is known to be close to capacity, if there is a non-zero fraction of degree-two bit nodes. However, the degree-two bit nodes preclude the possibility of a block-error threshold. Interestingly, LDPC codes constructed using protographs allow the possibility of having both degree-two bit nodes and a block-error threshold. In this paper, we analyze density evolution for protograph LDPC codes over the binary erasure channel and show that their bit-error probability decreases double exponentially with the numbe","authors_text":"Andrew Thangaraj, Arunkumar Subramanian, Asit Kumar Pradhan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-27T00:17:03Z","title":"Deterministic Constructions for Large Girth Protograph LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6301","kind":"arxiv","version":3},"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:522ccce5f9293808c1e5891dea4c81da6c283d505eeab0c20024703c90fb72fc","target":"record","created_at":"2026-05-18T03:25:15Z","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":"ea9e2f7ff704ee1e33567b1f5269ab05a39770189203eed746bb105c6d0c2d55","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-27T00:17:03Z","title_canon_sha256":"67d0fdd4fc2e7c4a73506dc7f033f9e29568acd2b2de15d81b3f23ba0989656c"},"schema_version":"1.0","source":{"id":"1301.6301","kind":"arxiv","version":3}},"canonical_sha256":"d5fd9afea7c557799c5fb5f8946f9cfe84000a1137a49a05d667fbd2bf118a69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5fd9afea7c557799c5fb5f8946f9cfe84000a1137a49a05d667fbd2bf118a69","first_computed_at":"2026-05-18T03:25:15.917125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:15.917125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S2jAuwRnRyT7PuJ7KwOsoOlj8sH/Q++iaiVITr8lobfRb2LrQhXH8xPHgnkvCJrMDDIBmjzeVlP7vOsNhr3kDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:15.917528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6301","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:522ccce5f9293808c1e5891dea4c81da6c283d505eeab0c20024703c90fb72fc","sha256:ccba02be9253a09b1340c37353dde246d37160f72ae1c035a9ac68c149ea8581"],"state_sha256":"628f0aa1b5f5bb8120b1f5f4156ad382963fb323fa3d7fe8e87d1942671792b3"}