{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5Y2IQIVX7V6DKEM2XTIBFWJFAB","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":"a2799957c5ea63cb60c4aec28fe5e35a0d9a9682267b8c7631b1ad0ff7adca10","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-08T00:00:28Z","title_canon_sha256":"71790b595207d39f33e3f4cedb074c0bd247b6231d21725a684d8b55e966e6ef"},"schema_version":"1.0","source":{"id":"1303.1858","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1858","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1858v1","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1858","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"5Y2IQIVX7V6D","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5Y2IQIVX7V6DKEM2","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5Y2IQIVX","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:8f8213f454d1d2dc43a6c54e33a95563fed9362d7298b595c3a2ca069d5769cc","target":"graph","created_at":"2026-05-18T00:57:56Z","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 generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes. It has previously been shown that ensembles of GSC-LDPC codes constructed from a protograph have better iterative decoding thresholds than their block code counterparts, and that, for large termination lengths, their thresholds coincide with the maximum a-posteriori (MAP) decoding threshold of the underlying generalized LDPC block code ensemble. Here we show that, in addition to their excellent iterative decodi","authors_text":"Daniel J. Costello Jr, David G. M. Mitchell, Michael Lentmaier","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-08T00:00:28Z","title":"On the Minimum Distance of Generalized Spatially Coupled LDPC Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1858","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:3d8aa140da955469bca62df3d9735ed70cc8702b40ddd37b25dd5552ec9eafcb","target":"record","created_at":"2026-05-18T00:57:56Z","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":"a2799957c5ea63cb60c4aec28fe5e35a0d9a9682267b8c7631b1ad0ff7adca10","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-08T00:00:28Z","title_canon_sha256":"71790b595207d39f33e3f4cedb074c0bd247b6231d21725a684d8b55e966e6ef"},"schema_version":"1.0","source":{"id":"1303.1858","kind":"arxiv","version":1}},"canonical_sha256":"ee348822b7fd7c35119abcd012d925004568f01766fba74f43604c8f3f336a8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee348822b7fd7c35119abcd012d925004568f01766fba74f43604c8f3f336a8e","first_computed_at":"2026-05-18T00:57:56.513249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:56.513249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fifdy89A8dglXbLf7bbKpZFKnbjh++4CdVy7DzJWoxch/fVrHu7a1YNVi63ym6t5O+QNrsvp8lpRPgQ6dUNOCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:56.513713Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.1858","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d8aa140da955469bca62df3d9735ed70cc8702b40ddd37b25dd5552ec9eafcb","sha256:8f8213f454d1d2dc43a6c54e33a95563fed9362d7298b595c3a2ca069d5769cc"],"state_sha256":"bb8706a5009c06c12def4da2bcb22c028bbf595346223fbb4a33c419444559c0"}