{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:UEK7AHCNW5RYQF5O6VTNF4FUCR","short_pith_number":"pith:UEK7AHCN","schema_version":"1.0","canonical_sha256":"a115f01c4db7638817aef566d2f0b4144a4273c9d5e6e0dd0f294268b2d487f3","source":{"kind":"arxiv","id":"1007.0404","version":1},"attestation_state":"computed","paper":{"title":"Quasi-Cyclic Asymptotically Regular LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel J. Costello Jr, David G. M. Mitchell, Michael Lentmaier, Roxana Smarandache","submitted_at":"2010-07-02T17:14:45Z","abstract_excerpt":"Families of \"asymptotically regular\" LDPC block code ensembles can be formed by terminating (J,K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles with varying code rates, minimum distance that grows linearly with block length, and capacity approaching iterative decoding thresholds, despite the fact that the terminated ensembles are almost regular. In this paper, we investigate the properties of the quasi-cyclic (QC) members of such an ensemble. We show that an upper bound on the minimum Hamming dista"},"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":"1007.0404","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-02T17:14:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0064364bfeeab6dcb48de4094e7e9788f490ccaf948eedd0cf1b4fd43600acc6","abstract_canon_sha256":"3bbe39fb2ea0786912427d16e4bbf3a838c766bfbb1b75a2ad111ab2701ac11f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:10.832907Z","signature_b64":"ZJk6Advl4uQPJPD39mhOQ8YSPTuHtQoMl2KR2B9ODz9ayG8I+ius4ThmaZREyflq/HiYt6PKS4//0I6RNxaeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a115f01c4db7638817aef566d2f0b4144a4273c9d5e6e0dd0f294268b2d487f3","last_reissued_at":"2026-05-18T00:59:10.832183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:10.832183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-Cyclic Asymptotically Regular LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel J. Costello Jr, David G. M. Mitchell, Michael Lentmaier, Roxana Smarandache","submitted_at":"2010-07-02T17:14:45Z","abstract_excerpt":"Families of \"asymptotically regular\" LDPC block code ensembles can be formed by terminating (J,K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles with varying code rates, minimum distance that grows linearly with block length, and capacity approaching iterative decoding thresholds, despite the fact that the terminated ensembles are almost regular. In this paper, we investigate the properties of the quasi-cyclic (QC) members of such an ensemble. We show that an upper bound on the minimum Hamming dista"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.0404","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":"1007.0404","created_at":"2026-05-18T00:59:10.832302+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.0404v1","created_at":"2026-05-18T00:59:10.832302+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.0404","created_at":"2026-05-18T00:59:10.832302+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEK7AHCNW5RY","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEK7AHCNW5RYQF5O","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEK7AHCN","created_at":"2026-05-18T12:26:15.391820+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/UEK7AHCNW5RYQF5O6VTNF4FUCR","json":"https://pith.science/pith/UEK7AHCNW5RYQF5O6VTNF4FUCR.json","graph_json":"https://pith.science/api/pith-number/UEK7AHCNW5RYQF5O6VTNF4FUCR/graph.json","events_json":"https://pith.science/api/pith-number/UEK7AHCNW5RYQF5O6VTNF4FUCR/events.json","paper":"https://pith.science/paper/UEK7AHCN"},"agent_actions":{"view_html":"https://pith.science/pith/UEK7AHCNW5RYQF5O6VTNF4FUCR","download_json":"https://pith.science/pith/UEK7AHCNW5RYQF5O6VTNF4FUCR.json","view_paper":"https://pith.science/paper/UEK7AHCN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.0404&json=true","fetch_graph":"https://pith.science/api/pith-number/UEK7AHCNW5RYQF5O6VTNF4FUCR/graph.json","fetch_events":"https://pith.science/api/pith-number/UEK7AHCNW5RYQF5O6VTNF4FUCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEK7AHCNW5RYQF5O6VTNF4FUCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEK7AHCNW5RYQF5O6VTNF4FUCR/action/storage_attestation","attest_author":"https://pith.science/pith/UEK7AHCNW5RYQF5O6VTNF4FUCR/action/author_attestation","sign_citation":"https://pith.science/pith/UEK7AHCNW5RYQF5O6VTNF4FUCR/action/citation_signature","submit_replication":"https://pith.science/pith/UEK7AHCNW5RYQF5O6VTNF4FUCR/action/replication_record"}},"created_at":"2026-05-18T00:59:10.832302+00:00","updated_at":"2026-05-18T00:59:10.832302+00:00"}