{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:V4DZPYPCF33LRNZYNF4L7EQFNF","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":"74607acd643589364d019ad33a272c310e037c6f1c7daee5e9fbf163e113b711","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-25T20:53:01Z","title_canon_sha256":"04383c9149037a01d96c5ea4fb8638c0f9a343cfa28f9758fc911f9c6c33a471"},"schema_version":"1.0","source":{"id":"1209.5762","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5762","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5762v2","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5762","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"V4DZPYPCF33L","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"V4DZPYPCF33LRNZY","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"V4DZPYPC","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:188c846b78f29350ac3906fa32e76b24a0081f3cbd5eaac3bc5a3dc96069289b","target":"graph","created_at":"2026-05-18T00:59:04Z","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 analyze the asymptotic performance of nonbinary spatially-coupled low-density parity-check (SC-LDPC) codes built on the general linear group, when the transmission takes place over the binary erasure channel. We propose an efficient method to derive an upper bound to the maximum a posteriori probability (MAP) threshold for nonbinary LDPC codes, and observe that the MAP performance of regular LDPC codes improves with the alphabet size. We then consider nonbinary SC-LDPC codes. We show that the same threshold saturation effect experienced by binary SC-LDPC codes occurs for the nonbinary codes","authors_text":"Alexandre Graell i Amat, Amina Piemontese, Giulio Colavolpe","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-25T20:53:01Z","title":"Nonbinary Spatially-Coupled LDPC Codes on the Binary Erasure Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5762","kind":"arxiv","version":2},"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:e750d243c176b2f462d0d0f6999d68383e88c6112b0b8e17478d5577785e5c1d","target":"record","created_at":"2026-05-18T00:59:04Z","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":"74607acd643589364d019ad33a272c310e037c6f1c7daee5e9fbf163e113b711","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-25T20:53:01Z","title_canon_sha256":"04383c9149037a01d96c5ea4fb8638c0f9a343cfa28f9758fc911f9c6c33a471"},"schema_version":"1.0","source":{"id":"1209.5762","kind":"arxiv","version":2}},"canonical_sha256":"af0797e1e22ef6b8b7386978bf9205697d27cdf104309d7dfee942f1454951c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af0797e1e22ef6b8b7386978bf9205697d27cdf104309d7dfee942f1454951c9","first_computed_at":"2026-05-18T00:59:04.807202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:04.807202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sfhp/CIqqomn6qq4BmtSU5Kg0ahdSO/Hg+kfA8GY36Au3W2DG2Q2GmX51fOCegcX6fxvh+JPeAVf8BcrwHERCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:04.807922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.5762","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e750d243c176b2f462d0d0f6999d68383e88c6112b0b8e17478d5577785e5c1d","sha256:188c846b78f29350ac3906fa32e76b24a0081f3cbd5eaac3bc5a3dc96069289b"],"state_sha256":"4483f0e3baed34bc82abada3ea233930debacdbd3adcfb338df914d216a807a8"}