{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RZXQG3FIC74FGOQTRHM3A2ZFOC","short_pith_number":"pith:RZXQG3FI","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"},"canonical_sha256":"8e6f036ca817f8533a1389d9b06b2570b4b010f78484d42a004716870664f7bb","source":{"kind":"arxiv","id":"1111.0711","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RZXQG3FIC74FGOQTRHM3A2ZFOC","target":"record","payload":{"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"},"canonical_sha256":"8e6f036ca817f8533a1389d9b06b2570b4b010f78484d42a004716870664f7bb","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"},"source_kind":"arxiv","source_id":"1111.0711","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nXorActRHnG0OCVbyBauDxrwyg4Gk/UJnfsmzH1pavfVTUfEO/U8JsMU3K6KofIJYIOCaW+1+wZn/wyBOdqiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:38:56.169695Z"},"content_sha256":"e5024c4a9799487e68ede83e8b153cbd23b1dfd71d6a86ebf99d2ea0aebfec4a","schema_version":"1.0","event_id":"sha256:e5024c4a9799487e68ede83e8b153cbd23b1dfd71d6a86ebf99d2ea0aebfec4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RZXQG3FIC74FGOQTRHM3A2ZFOC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S9U5/5fBtOW86XHbVw0ZQMmJVjex+ylsZlZXbC0m+Jgtt06FDl08TNm7wXoPoqNMQ0H9ZXqXx21mpsgDrlC+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:38:56.170046Z"},"content_sha256":"1ca1ca9961d19b4e2ad0451b4b75460880a7417bcb434be8301e696700d918ff","schema_version":"1.0","event_id":"sha256:1ca1ca9961d19b4e2ad0451b4b75460880a7417bcb434be8301e696700d918ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RZXQG3FIC74FGOQTRHM3A2ZFOC/bundle.json","state_url":"https://pith.science/pith/RZXQG3FIC74FGOQTRHM3A2ZFOC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RZXQG3FIC74FGOQTRHM3A2ZFOC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T03:38:56Z","links":{"resolver":"https://pith.science/pith/RZXQG3FIC74FGOQTRHM3A2ZFOC","bundle":"https://pith.science/pith/RZXQG3FIC74FGOQTRHM3A2ZFOC/bundle.json","state":"https://pith.science/pith/RZXQG3FIC74FGOQTRHM3A2ZFOC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RZXQG3FIC74FGOQTRHM3A2ZFOC/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ddmx+y/87ppyn8B/1vpJ8S/ihDdcCOhW87d7MloeN6EqJpU88pfA4nUuSQ1v098uSUjcn1mdJ6ZOxnOHDMM4DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:38:56.172035Z","bundle_sha256":"065a3d6bc1171355a0fa29b69e57a017b6be19e1dec5108d80741390a392a50e"}}