{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:B7WZGKH6S2AZ4Q4DW3F5VXT6H6","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":"45c2c565b4cf331fd8dd6aaca1fe4f7a9327d9f69ab2da9061a21a8c95e082b3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-17T05:57:40Z","title_canon_sha256":"36559ad6ccfe09ed75210c43fd33ac0186d4b9e739dbf71ef9a33b9ff884a21a"},"schema_version":"1.0","source":{"id":"1411.4373","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4373","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4373v1","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4373","created_at":"2026-05-18T02:35:45Z"},{"alias_kind":"pith_short_12","alias_value":"B7WZGKH6S2AZ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"B7WZGKH6S2AZ4Q4D","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"B7WZGKH6","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:5464cb4f48bdec20ffb9114f838896834c110d6341a77d6bf2da5d07cf5bf523","target":"graph","created_at":"2026-05-18T02:35:45Z","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":"In this paper we consider the generalization of binary spatially coupled low-density parity-check (SC-LDPC) codes to finite fields GF$(q)$, $q\\geq 2$, and develop design rules for $q$-ary SC-LDPC code ensembles based on their iterative belief propagation (BP) decoding thresholds, with particular emphasis on low-latency windowed decoding (WD). We consider transmission over both the binary erasure channel (BEC) and the binary-input additive white Gaussian noise channel (BIAWGNC) and present results for a variety of $(J,K)$-regular SC-LDPC code ensembles constructed over GF$(q)$ using protographs","authors_text":"Daniel J. Costello, David G. M. Mitchell, Lai Wei, Thomas E. Fuja","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-17T05:57:40Z","title":"Design of Spatially Coupled LDPC Codes over GF(q) for Windowed Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4373","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:e76dede00dd0e3835bf7ce41dbd99ceced699d277e46f3b3d0183fbd870b6d36","target":"record","created_at":"2026-05-18T02:35:45Z","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":"45c2c565b4cf331fd8dd6aaca1fe4f7a9327d9f69ab2da9061a21a8c95e082b3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-11-17T05:57:40Z","title_canon_sha256":"36559ad6ccfe09ed75210c43fd33ac0186d4b9e739dbf71ef9a33b9ff884a21a"},"schema_version":"1.0","source":{"id":"1411.4373","kind":"arxiv","version":1}},"canonical_sha256":"0fed9328fe96819e4383b6cbdade7e3f83739c6aac3abeeb5b0c2fbd2a32f195","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fed9328fe96819e4383b6cbdade7e3f83739c6aac3abeeb5b0c2fbd2a32f195","first_computed_at":"2026-05-18T02:35:45.832998Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:35:45.832998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mjvVSOQ39VekyyJwaokotDrlrQAV4QO8RJQvUAqt7cEc3/XIMxRDOZOnz26T/R/KDwBTxXanT1+0m3IJX3/5Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:35:45.833433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4373","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e76dede00dd0e3835bf7ce41dbd99ceced699d277e46f3b3d0183fbd870b6d36","sha256:5464cb4f48bdec20ffb9114f838896834c110d6341a77d6bf2da5d07cf5bf523"],"state_sha256":"fc0e0d148734a62279f75788c1a0a2c50a59cee371ce080e7ac5affff41aa5ae"}