{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:QSH4ISXGVSEQVTNGQDZPGGNWPN","short_pith_number":"pith:QSH4ISXG","canonical_record":{"source":{"id":"1005.1062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-06T19:44:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"22e354bce0d61740afe5f4dd855da77d795eb156acc528acba55c84c9ef2af7e","abstract_canon_sha256":"e8bbc0f5887179f692e5d58d45c84794c1033653e9258e557d8b7d7c9099c625"},"schema_version":"1.0"},"canonical_sha256":"848fc44ae6ac890acda680f2f319b67b71aa5ee9e1713c71f5bc83bbc13e249c","source":{"kind":"arxiv","id":"1005.1062","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.1062","created_at":"2026-05-18T02:24:08Z"},{"alias_kind":"arxiv_version","alias_value":"1005.1062v1","created_at":"2026-05-18T02:24:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1062","created_at":"2026-05-18T02:24:08Z"},{"alias_kind":"pith_short_12","alias_value":"QSH4ISXGVSEQ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QSH4ISXGVSEQVTNG","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QSH4ISXG","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:QSH4ISXGVSEQVTNGQDZPGGNWPN","target":"record","payload":{"canonical_record":{"source":{"id":"1005.1062","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-06T19:44:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"22e354bce0d61740afe5f4dd855da77d795eb156acc528acba55c84c9ef2af7e","abstract_canon_sha256":"e8bbc0f5887179f692e5d58d45c84794c1033653e9258e557d8b7d7c9099c625"},"schema_version":"1.0"},"canonical_sha256":"848fc44ae6ac890acda680f2f319b67b71aa5ee9e1713c71f5bc83bbc13e249c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:08.810344Z","signature_b64":"QXCobvSo6KtF9n7F+59kfnmtEhSTz8+++G65B1xiDR5PMVoTq6qS5iBNHHGxXvqxA5n8cbXytFHlFxaKpAhSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"848fc44ae6ac890acda680f2f319b67b71aa5ee9e1713c71f5bc83bbc13e249c","last_reissued_at":"2026-05-18T02:24:08.809657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:08.809657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.1062","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-18T02:24:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jRjJbV6wq+LzsN30pV9GSk35A6cfKsQVX6X8xdvGRd3x68oWz8+fgRugh2WzhZUpgGi2VnqVwqaVNhq8O10XCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:14:20.522387Z"},"content_sha256":"50cb9f997457bd814d972397838587095b6fc64375afdecbc309823b3f77737b","schema_version":"1.0","event_id":"sha256:50cb9f997457bd814d972397838587095b6fc64375afdecbc309823b3f77737b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:QSH4ISXGVSEQVTNGQDZPGGNWPN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically Regular LDPC Codes with Linear Distance Growth and Thresholds Close to Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel J. Costello, David G. M. Mitchell, Gerhard P. Fettweis, Jr., Michael Lentmaier","submitted_at":"2010-05-06T19:44:26Z","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 and substantially better iterative decoding thresholds than those of (J,K)-regular LDPC block code ensembles, despite the fact that the terminated ensembles are almost regular. Also, by means of an asymptotic weight enumerator analysis, we show that minimum distance grows linearly with block length for all of the ensembles in these f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1062","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-18T02:24:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VF50M9agfx8Dr3AnBJJbeFri30CRYYhQQ1hoEuIiYzOdpophlJEBrRBFTLIbkCmuXurSb7Ln3ataj0o9C4NoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:14:20.522972Z"},"content_sha256":"2c33bae9dcc1cb4d54bb447aca16dac6e8cadb5c088be9f2aac9138485d17503","schema_version":"1.0","event_id":"sha256:2c33bae9dcc1cb4d54bb447aca16dac6e8cadb5c088be9f2aac9138485d17503"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QSH4ISXGVSEQVTNGQDZPGGNWPN/bundle.json","state_url":"https://pith.science/pith/QSH4ISXGVSEQVTNGQDZPGGNWPN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QSH4ISXGVSEQVTNGQDZPGGNWPN/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-05T02:14:20Z","links":{"resolver":"https://pith.science/pith/QSH4ISXGVSEQVTNGQDZPGGNWPN","bundle":"https://pith.science/pith/QSH4ISXGVSEQVTNGQDZPGGNWPN/bundle.json","state":"https://pith.science/pith/QSH4ISXGVSEQVTNGQDZPGGNWPN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QSH4ISXGVSEQVTNGQDZPGGNWPN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QSH4ISXGVSEQVTNGQDZPGGNWPN","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":"e8bbc0f5887179f692e5d58d45c84794c1033653e9258e557d8b7d7c9099c625","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-06T19:44:26Z","title_canon_sha256":"22e354bce0d61740afe5f4dd855da77d795eb156acc528acba55c84c9ef2af7e"},"schema_version":"1.0","source":{"id":"1005.1062","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.1062","created_at":"2026-05-18T02:24:08Z"},{"alias_kind":"arxiv_version","alias_value":"1005.1062v1","created_at":"2026-05-18T02:24:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1062","created_at":"2026-05-18T02:24:08Z"},{"alias_kind":"pith_short_12","alias_value":"QSH4ISXGVSEQ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QSH4ISXGVSEQVTNG","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QSH4ISXG","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:2c33bae9dcc1cb4d54bb447aca16dac6e8cadb5c088be9f2aac9138485d17503","target":"graph","created_at":"2026-05-18T02:24:08Z","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":"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 and substantially better iterative decoding thresholds than those of (J,K)-regular LDPC block code ensembles, despite the fact that the terminated ensembles are almost regular. Also, by means of an asymptotic weight enumerator analysis, we show that minimum distance grows linearly with block length for all of the ensembles in these f","authors_text":"Daniel J. Costello, David G. M. Mitchell, Gerhard P. Fettweis, Jr., Michael Lentmaier","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-06T19:44:26Z","title":"Asymptotically Regular LDPC Codes with Linear Distance Growth and Thresholds Close to Capacity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1062","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:50cb9f997457bd814d972397838587095b6fc64375afdecbc309823b3f77737b","target":"record","created_at":"2026-05-18T02:24:08Z","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":"e8bbc0f5887179f692e5d58d45c84794c1033653e9258e557d8b7d7c9099c625","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-06T19:44:26Z","title_canon_sha256":"22e354bce0d61740afe5f4dd855da77d795eb156acc528acba55c84c9ef2af7e"},"schema_version":"1.0","source":{"id":"1005.1062","kind":"arxiv","version":1}},"canonical_sha256":"848fc44ae6ac890acda680f2f319b67b71aa5ee9e1713c71f5bc83bbc13e249c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"848fc44ae6ac890acda680f2f319b67b71aa5ee9e1713c71f5bc83bbc13e249c","first_computed_at":"2026-05-18T02:24:08.809657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:08.809657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QXCobvSo6KtF9n7F+59kfnmtEhSTz8+++G65B1xiDR5PMVoTq6qS5iBNHHGxXvqxA5n8cbXytFHlFxaKpAhSBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:08.810344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.1062","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50cb9f997457bd814d972397838587095b6fc64375afdecbc309823b3f77737b","sha256:2c33bae9dcc1cb4d54bb447aca16dac6e8cadb5c088be9f2aac9138485d17503"],"state_sha256":"88f68428218fe9d65789b7262331f153bcd8c4c01b4d2b371aa8580386218ee0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"28QOMdHByPvINeCi6TKZdvFrJuAYK+v+sy8/i31X2VFV6Lc2VN3Ul9H6tqzKwyeEs9dIDdvQU5x8zZD9oZXwCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:14:20.526490Z","bundle_sha256":"c0db27b8ef53d41c2e16bcf48caa54b43c24b1c8bd0b5946bdc76b2028031ea1"}}