{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:D34WLGPRXSBOOFU7KCXMMKX6LL","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":"520a16a282eb1a83b6942347ac139ff02e08565c1b9f2dd7d923f406b930f51e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-24T08:04:47Z","title_canon_sha256":"fd6db682000eec25d495ba4992bdefdfb34e33fc46bd9433c348c5ce333d5be1"},"schema_version":"1.0","source":{"id":"1504.06416","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06416","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06416v1","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06416","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"pith_short_12","alias_value":"D34WLGPRXSBO","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D34WLGPRXSBOOFU7","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D34WLGPR","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:68b8dc5d8d1b6c721a4f8a3664afbb72e753d57656beefedfbccc8390252b45c","target":"graph","created_at":"2026-05-18T00:58:35Z","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":"An array low-density parity-check (LDPC) code is a quasi-cyclic LDPC code specified by two integers $q$ and $m$, where $q$ is an odd prime and $m \\leq q$. The exact minimum distance, for small $q$ and $m$, has been calculated, and tight upper bounds on it for $m \\leq 7$ have been derived. In this work, we study the minimum distance of the spatially-coupled version of these codes. In particular, several tight upper bounds on the optimal minimum distance for coupling length at least two and $m=3,4,5$, that are independent of $q$ and that are valid for all values of $q \\geq q_0$ where $q_0$ depen","authors_text":"Eirik Rosnes","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-24T08:04:47Z","title":"On the Minimum Distance of Array-Based Spatially-Coupled Low-Density Parity-Check Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06416","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:207d18a0f416562ec5661f6fd6b7a5bfa19991ab9bef2bc99b1c730e92641950","target":"record","created_at":"2026-05-18T00:58:35Z","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":"520a16a282eb1a83b6942347ac139ff02e08565c1b9f2dd7d923f406b930f51e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-24T08:04:47Z","title_canon_sha256":"fd6db682000eec25d495ba4992bdefdfb34e33fc46bd9433c348c5ce333d5be1"},"schema_version":"1.0","source":{"id":"1504.06416","kind":"arxiv","version":1}},"canonical_sha256":"1ef96599f1bc82e7169f50aec62afe5ae323a67b7c5843eeb7abf638c8fb3785","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ef96599f1bc82e7169f50aec62afe5ae323a67b7c5843eeb7abf638c8fb3785","first_computed_at":"2026-05-18T00:58:35.739465Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:35.739465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HG5o1xr1jJtZT+kRqI0JY9+la3m9mcVnvc6xIf8sNz9gALpMKXQxVkwmtcJPyt9kmsw94tdg9M2yxZ4Bf/7+BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:35.740130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.06416","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:207d18a0f416562ec5661f6fd6b7a5bfa19991ab9bef2bc99b1c730e92641950","sha256:68b8dc5d8d1b6c721a4f8a3664afbb72e753d57656beefedfbccc8390252b45c"],"state_sha256":"59806668531cddf3eff0c0ebe02980c506aba7d3912dee80769a3711b2a49fcc"}