{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IWJXDBZMNUZSQ5FRCSBFK5VBJH","short_pith_number":"pith:IWJXDBZM","schema_version":"1.0","canonical_sha256":"459371872c6d332874b114825576a149d5baee2124c553a650a5e3b960af1d3e","source":{"kind":"arxiv","id":"1311.2003","version":4},"attestation_state":"computed","paper":{"title":"Threshold Saturation for Nonbinary SC-LDPC Codes on the Binary Erasure Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Iryna Andriyanova","submitted_at":"2013-11-08T15:55:36Z","abstract_excerpt":"We analyze the asymptotic performance of nonbinary spatially-coupled low-density parity-check (SC-LDPC) code ensembles defined over the general linear group on the binary erasure channel. In particular, we prove threshold saturation of belief propagation decoding to the so called potential threshold, using the proof technique based on potential functions introduced by Yedla \\textit{et al.}, assuming that the potential function exists. We rewrite the density evolution of nonbinary SC-LDPC codes in an equivalent vector recursion form which is suited for the use of the potential function. We then"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1311.2003","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-08T15:55:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fd0b77061f2bdc16f1cb3a5df94ee5431e734b9d0fc85e3d365a3ad5bc5fbc71","abstract_canon_sha256":"5562e8ad4e677b148431881f4d47bc2fe42ef4edde9d018314ca7c5089175bfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:53.476842Z","signature_b64":"SW1kPJ1p3q74mg+CUB1g0J8vVe5320rZ1tZ12JbUMSVmDPjEjwr1A0VmB4ve3RLju/wxbPLyVa0gHQqlF1R+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"459371872c6d332874b114825576a149d5baee2124c553a650a5e3b960af1d3e","last_reissued_at":"2026-05-18T01:17:53.476310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:53.476310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Threshold Saturation for Nonbinary SC-LDPC Codes on the Binary Erasure Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Iryna Andriyanova","submitted_at":"2013-11-08T15:55:36Z","abstract_excerpt":"We analyze the asymptotic performance of nonbinary spatially-coupled low-density parity-check (SC-LDPC) code ensembles defined over the general linear group on the binary erasure channel. In particular, we prove threshold saturation of belief propagation decoding to the so called potential threshold, using the proof technique based on potential functions introduced by Yedla \\textit{et al.}, assuming that the potential function exists. We rewrite the density evolution of nonbinary SC-LDPC codes in an equivalent vector recursion form which is suited for the use of the potential function. We then"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2003","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.2003","created_at":"2026-05-18T01:17:53.476411+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.2003v4","created_at":"2026-05-18T01:17:53.476411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2003","created_at":"2026-05-18T01:17:53.476411+00:00"},{"alias_kind":"pith_short_12","alias_value":"IWJXDBZMNUZS","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"IWJXDBZMNUZSQ5FR","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"IWJXDBZM","created_at":"2026-05-18T12:27:49.015174+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IWJXDBZMNUZSQ5FRCSBFK5VBJH","json":"https://pith.science/pith/IWJXDBZMNUZSQ5FRCSBFK5VBJH.json","graph_json":"https://pith.science/api/pith-number/IWJXDBZMNUZSQ5FRCSBFK5VBJH/graph.json","events_json":"https://pith.science/api/pith-number/IWJXDBZMNUZSQ5FRCSBFK5VBJH/events.json","paper":"https://pith.science/paper/IWJXDBZM"},"agent_actions":{"view_html":"https://pith.science/pith/IWJXDBZMNUZSQ5FRCSBFK5VBJH","download_json":"https://pith.science/pith/IWJXDBZMNUZSQ5FRCSBFK5VBJH.json","view_paper":"https://pith.science/paper/IWJXDBZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.2003&json=true","fetch_graph":"https://pith.science/api/pith-number/IWJXDBZMNUZSQ5FRCSBFK5VBJH/graph.json","fetch_events":"https://pith.science/api/pith-number/IWJXDBZMNUZSQ5FRCSBFK5VBJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IWJXDBZMNUZSQ5FRCSBFK5VBJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IWJXDBZMNUZSQ5FRCSBFK5VBJH/action/storage_attestation","attest_author":"https://pith.science/pith/IWJXDBZMNUZSQ5FRCSBFK5VBJH/action/author_attestation","sign_citation":"https://pith.science/pith/IWJXDBZMNUZSQ5FRCSBFK5VBJH/action/citation_signature","submit_replication":"https://pith.science/pith/IWJXDBZMNUZSQ5FRCSBFK5VBJH/action/replication_record"}},"created_at":"2026-05-18T01:17:53.476411+00:00","updated_at":"2026-05-18T01:17:53.476411+00:00"}