{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2X6ZV7VHYVLXTHC7WX4JI34472","short_pith_number":"pith:2X6ZV7VH","schema_version":"1.0","canonical_sha256":"d5fd9afea7c557799c5fb5f8946f9cfe84000a1137a49a05d667fbd2bf118a69","source":{"kind":"arxiv","id":"1301.6301","version":3},"attestation_state":"computed","paper":{"title":"Deterministic Constructions for Large Girth Protograph LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew Thangaraj, Arunkumar Subramanian, Asit Kumar Pradhan","submitted_at":"2013-01-27T00:17:03Z","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"},"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":"1301.6301","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-27T00:17:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"67d0fdd4fc2e7c4a73506dc7f033f9e29568acd2b2de15d81b3f23ba0989656c","abstract_canon_sha256":"ea9e2f7ff704ee1e33567b1f5269ab05a39770189203eed746bb105c6d0c2d55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:15.917528Z","signature_b64":"S2jAuwRnRyT7PuJ7KwOsoOlj8sH/Q++iaiVITr8lobfRb2LrQhXH8xPHgnkvCJrMDDIBmjzeVlP7vOsNhr3kDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5fd9afea7c557799c5fb5f8946f9cfe84000a1137a49a05d667fbd2bf118a69","last_reissued_at":"2026-05-18T03:25:15.917125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:15.917125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Constructions for Large Girth Protograph LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew Thangaraj, Arunkumar Subramanian, Asit Kumar Pradhan","submitted_at":"2013-01-27T00:17:03Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6301","kind":"arxiv","version":3},"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":"1301.6301","created_at":"2026-05-18T03:25:15.917183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6301v3","created_at":"2026-05-18T03:25:15.917183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6301","created_at":"2026-05-18T03:25:15.917183+00:00"},{"alias_kind":"pith_short_12","alias_value":"2X6ZV7VHYVLX","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2X6ZV7VHYVLXTHC7","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2X6ZV7VH","created_at":"2026-05-18T12:27:32.513160+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/2X6ZV7VHYVLXTHC7WX4JI34472","json":"https://pith.science/pith/2X6ZV7VHYVLXTHC7WX4JI34472.json","graph_json":"https://pith.science/api/pith-number/2X6ZV7VHYVLXTHC7WX4JI34472/graph.json","events_json":"https://pith.science/api/pith-number/2X6ZV7VHYVLXTHC7WX4JI34472/events.json","paper":"https://pith.science/paper/2X6ZV7VH"},"agent_actions":{"view_html":"https://pith.science/pith/2X6ZV7VHYVLXTHC7WX4JI34472","download_json":"https://pith.science/pith/2X6ZV7VHYVLXTHC7WX4JI34472.json","view_paper":"https://pith.science/paper/2X6ZV7VH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6301&json=true","fetch_graph":"https://pith.science/api/pith-number/2X6ZV7VHYVLXTHC7WX4JI34472/graph.json","fetch_events":"https://pith.science/api/pith-number/2X6ZV7VHYVLXTHC7WX4JI34472/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2X6ZV7VHYVLXTHC7WX4JI34472/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2X6ZV7VHYVLXTHC7WX4JI34472/action/storage_attestation","attest_author":"https://pith.science/pith/2X6ZV7VHYVLXTHC7WX4JI34472/action/author_attestation","sign_citation":"https://pith.science/pith/2X6ZV7VHYVLXTHC7WX4JI34472/action/citation_signature","submit_replication":"https://pith.science/pith/2X6ZV7VHYVLXTHC7WX4JI34472/action/replication_record"}},"created_at":"2026-05-18T03:25:15.917183+00:00","updated_at":"2026-05-18T03:25:15.917183+00:00"}