{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RZXQG3FIC74FGOQTRHM3A2ZFOC","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":"37c02c42dbd81f25562d1df1392aaa2a9d9881e69e4494d84f31c99aa9448b71","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-03T01:54:49Z","title_canon_sha256":"855d0d3acd7ceaa6e6abfd651672928bf8d607744bd30e09dc9c47b33fd53eb2"},"schema_version":"1.0","source":{"id":"1111.0711","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0711","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0711v1","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0711","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"pith_short_12","alias_value":"RZXQG3FIC74F","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RZXQG3FIC74FGOQT","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RZXQG3FI","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:1ca1ca9961d19b4e2ad0451b4b75460880a7417bcb434be8301e696700d918ff","target":"graph","created_at":"2026-05-18T00:58:18Z","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":"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","authors_text":"Jonathan S. Yedidia, Stark C. Draper, Yige Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-03T01:54:49Z","title":"Hierarchical and High-Girth QC LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0711","kind":"arxiv","version":1},"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:e5024c4a9799487e68ede83e8b153cbd23b1dfd71d6a86ebf99d2ea0aebfec4a","target":"record","created_at":"2026-05-18T00:58:18Z","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":"37c02c42dbd81f25562d1df1392aaa2a9d9881e69e4494d84f31c99aa9448b71","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-03T01:54:49Z","title_canon_sha256":"855d0d3acd7ceaa6e6abfd651672928bf8d607744bd30e09dc9c47b33fd53eb2"},"schema_version":"1.0","source":{"id":"1111.0711","kind":"arxiv","version":1}},"canonical_sha256":"8e6f036ca817f8533a1389d9b06b2570b4b010f78484d42a004716870664f7bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e6f036ca817f8533a1389d9b06b2570b4b010f78484d42a004716870664f7bb","first_computed_at":"2026-05-18T00:58:18.644771Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:18.644771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vm9LSvN7PojJfOXS9yWUpQAmHYweAfyglBR1HaGf4LAO4SdMLidTlDrM+kOeKHXSrz+V6XAA64ECk9NdCQQUDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:18.646541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.0711","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5024c4a9799487e68ede83e8b153cbd23b1dfd71d6a86ebf99d2ea0aebfec4a","sha256:1ca1ca9961d19b4e2ad0451b4b75460880a7417bcb434be8301e696700d918ff"],"state_sha256":"f045c447b3ca9e0e06e13413b78705a2b85c1d5a162be0d232e9c7a8506f241b"}