{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:S4OLOMCYRU64YE7ONXR3UXPCJJ","short_pith_number":"pith:S4OLOMCY","schema_version":"1.0","canonical_sha256":"971cb730588d3dcc13ee6de3ba5de24a669a0a671170e2708f55c0055734e63b","source":{"kind":"arxiv","id":"1701.07629","version":1},"attestation_state":"computed","paper":{"title":"Non-Uniformly Coupled LDPC Codes: Better Thresholds, Smaller Rate-loss, and Less Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fanny Jardel, Laurent Schmalen, Vahid Aref","submitted_at":"2017-01-26T09:41:14Z","abstract_excerpt":"We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing the amount of coupling between spatial positions, we show that we can construct codes with excellent thresholds and small rate loss, even with the lowest possible smoothing parameter and large variable node degrees, which are required for low error floors. We also establish that the decoding convergence speed is faster with non-uniformly coupled codes, which w"},"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":"1701.07629","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-26T09:41:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4b66066bf06243829e9c631efc38ebe1ef68caec81714bbbc16e90b839a085e9","abstract_canon_sha256":"db869926b4671d688d4d52bcefc14c5abe997f0d218da51f42491a8a6b52d629"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:02.980961Z","signature_b64":"OsxTY4lNbo+bWGfrcjTQy65pGBn59BBe8K4s+qSutnWo6k6ab2yoZsP40N/rGYMMteHHy8jVakHtWtAvp8JjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"971cb730588d3dcc13ee6de3ba5de24a669a0a671170e2708f55c0055734e63b","last_reissued_at":"2026-05-18T00:52:02.980492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:02.980492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Uniformly Coupled LDPC Codes: Better Thresholds, Smaller Rate-loss, and Less Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fanny Jardel, Laurent Schmalen, Vahid Aref","submitted_at":"2017-01-26T09:41:14Z","abstract_excerpt":"We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing the amount of coupling between spatial positions, we show that we can construct codes with excellent thresholds and small rate loss, even with the lowest possible smoothing parameter and large variable node degrees, which are required for low error floors. We also establish that the decoding convergence speed is faster with non-uniformly coupled codes, which w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07629","kind":"arxiv","version":1},"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":"1701.07629","created_at":"2026-05-18T00:52:02.980559+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07629v1","created_at":"2026-05-18T00:52:02.980559+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07629","created_at":"2026-05-18T00:52:02.980559+00:00"},{"alias_kind":"pith_short_12","alias_value":"S4OLOMCYRU64","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"S4OLOMCYRU64YE7O","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"S4OLOMCY","created_at":"2026-05-18T12:31:43.269735+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/S4OLOMCYRU64YE7ONXR3UXPCJJ","json":"https://pith.science/pith/S4OLOMCYRU64YE7ONXR3UXPCJJ.json","graph_json":"https://pith.science/api/pith-number/S4OLOMCYRU64YE7ONXR3UXPCJJ/graph.json","events_json":"https://pith.science/api/pith-number/S4OLOMCYRU64YE7ONXR3UXPCJJ/events.json","paper":"https://pith.science/paper/S4OLOMCY"},"agent_actions":{"view_html":"https://pith.science/pith/S4OLOMCYRU64YE7ONXR3UXPCJJ","download_json":"https://pith.science/pith/S4OLOMCYRU64YE7ONXR3UXPCJJ.json","view_paper":"https://pith.science/paper/S4OLOMCY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07629&json=true","fetch_graph":"https://pith.science/api/pith-number/S4OLOMCYRU64YE7ONXR3UXPCJJ/graph.json","fetch_events":"https://pith.science/api/pith-number/S4OLOMCYRU64YE7ONXR3UXPCJJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S4OLOMCYRU64YE7ONXR3UXPCJJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S4OLOMCYRU64YE7ONXR3UXPCJJ/action/storage_attestation","attest_author":"https://pith.science/pith/S4OLOMCYRU64YE7ONXR3UXPCJJ/action/author_attestation","sign_citation":"https://pith.science/pith/S4OLOMCYRU64YE7ONXR3UXPCJJ/action/citation_signature","submit_replication":"https://pith.science/pith/S4OLOMCYRU64YE7ONXR3UXPCJJ/action/replication_record"}},"created_at":"2026-05-18T00:52:02.980559+00:00","updated_at":"2026-05-18T00:52:02.980559+00:00"}