{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RZXQG3FIC74FGOQTRHM3A2ZFOC","short_pith_number":"pith:RZXQG3FI","schema_version":"1.0","canonical_sha256":"8e6f036ca817f8533a1389d9b06b2570b4b010f78484d42a004716870664f7bb","source":{"kind":"arxiv","id":"1111.0711","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical and High-Girth QC LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jonathan S. Yedidia, Stark C. Draper, Yige Wang","submitted_at":"2011-11-03T01:54:49Z","abstract_excerpt":"We present a general approach to designing capacity-approaching high-girth low-density parity-check (LDPC) codes that are friendly to hardware implementation. Our methodology starts by defining a new class of \"hierarchical\" quasi-cyclic (HQC) LDPC codes that generalizes the structure of quasi-cyclic (QC) LDPC codes. Whereas the parity check matrices of QC LDPC codes are composed of circulant sub-matrices, those of HQC LDPC codes are composed of a hierarchy of circulant sub-matrices that are in turn constructed from circulant sub-matrices, and so on, through some number of levels. We show how t"},"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":"1111.0711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-03T01:54:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"855d0d3acd7ceaa6e6abfd651672928bf8d607744bd30e09dc9c47b33fd53eb2","abstract_canon_sha256":"37c02c42dbd81f25562d1df1392aaa2a9d9881e69e4494d84f31c99aa9448b71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:18.646541Z","signature_b64":"Vm9LSvN7PojJfOXS9yWUpQAmHYweAfyglBR1HaGf4LAO4SdMLidTlDrM+kOeKHXSrz+V6XAA64ECk9NdCQQUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e6f036ca817f8533a1389d9b06b2570b4b010f78484d42a004716870664f7bb","last_reissued_at":"2026-05-18T00:58:18.644771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:18.644771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical and High-Girth QC LDPC Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jonathan S. Yedidia, Stark C. Draper, Yige Wang","submitted_at":"2011-11-03T01:54:49Z","abstract_excerpt":"We present a general approach to designing capacity-approaching high-girth low-density parity-check (LDPC) codes that are friendly to hardware implementation. Our methodology starts by defining a new class of \"hierarchical\" quasi-cyclic (HQC) LDPC codes that generalizes the structure of quasi-cyclic (QC) LDPC codes. Whereas the parity check matrices of QC LDPC codes are composed of circulant sub-matrices, those of HQC LDPC codes are composed of a hierarchy of circulant sub-matrices that are in turn constructed from circulant sub-matrices, and so on, through some number of levels. We show how t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0711","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":"1111.0711","created_at":"2026-05-18T00:58:18.644909+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0711v1","created_at":"2026-05-18T00:58:18.644909+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0711","created_at":"2026-05-18T00:58:18.644909+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZXQG3FIC74F","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZXQG3FIC74FGOQT","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZXQG3FI","created_at":"2026-05-18T12:26:41.206345+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/RZXQG3FIC74FGOQTRHM3A2ZFOC","json":"https://pith.science/pith/RZXQG3FIC74FGOQTRHM3A2ZFOC.json","graph_json":"https://pith.science/api/pith-number/RZXQG3FIC74FGOQTRHM3A2ZFOC/graph.json","events_json":"https://pith.science/api/pith-number/RZXQG3FIC74FGOQTRHM3A2ZFOC/events.json","paper":"https://pith.science/paper/RZXQG3FI"},"agent_actions":{"view_html":"https://pith.science/pith/RZXQG3FIC74FGOQTRHM3A2ZFOC","download_json":"https://pith.science/pith/RZXQG3FIC74FGOQTRHM3A2ZFOC.json","view_paper":"https://pith.science/paper/RZXQG3FI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0711&json=true","fetch_graph":"https://pith.science/api/pith-number/RZXQG3FIC74FGOQTRHM3A2ZFOC/graph.json","fetch_events":"https://pith.science/api/pith-number/RZXQG3FIC74FGOQTRHM3A2ZFOC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZXQG3FIC74FGOQTRHM3A2ZFOC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZXQG3FIC74FGOQTRHM3A2ZFOC/action/storage_attestation","attest_author":"https://pith.science/pith/RZXQG3FIC74FGOQTRHM3A2ZFOC/action/author_attestation","sign_citation":"https://pith.science/pith/RZXQG3FIC74FGOQTRHM3A2ZFOC/action/citation_signature","submit_replication":"https://pith.science/pith/RZXQG3FIC74FGOQTRHM3A2ZFOC/action/replication_record"}},"created_at":"2026-05-18T00:58:18.644909+00:00","updated_at":"2026-05-18T00:58:18.644909+00:00"}