{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VFRV4QVI55SKLWB66ZQYCWC2GJ","short_pith_number":"pith:VFRV4QVI","schema_version":"1.0","canonical_sha256":"a9635e42a8ef64a5d83ef66181585a3270b99e1c8a5135d482d8d5605719ddc9","source":{"kind":"arxiv","id":"1309.7543","version":2},"attestation_state":"computed","paper":{"title":"Threshold Saturation for Spatially-Coupled LDPC and LDGM Codes on BMS Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew J. Young, Henry D. Pfister, Nicolas Macris, Santhosh Kumar","submitted_at":"2013-09-29T06:44:59Z","abstract_excerpt":"Spatially-coupled low-density parity-check (LDPC) codes, which were first introduced as LDPC convolutional codes, have been shown to exhibit excellent performance under low-complexity belief-propagation decoding. This phenomenon is now termed threshold saturation via spatial coupling. Spatially-coupled codes have been successfully applied in numerous areas. In particular, it was proven that spatially-coupled regular LDPC codes universally achieve capacity over the class of binary memoryless symmetric (BMS) channels under belief-propagation decoding.\n  Recently, potential functions have been us"},"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":"1309.7543","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-29T06:44:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c48266a53be706f223349b5ade1401ab874b7ad2377b54989537efb2cb651c2e","abstract_canon_sha256":"cb914e8a85796721509b6ba011fe598bb50c8c9839aaf9bf6689e292410b2e04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:23.601795Z","signature_b64":"zIRT9Ci6HVWcs9vWSq/VymxDVl+wV+TSxVFeEzFAfAFHKIDeb9S5FnzLX5X1eymdbJtQSmYgn+RPr/JOfsfYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9635e42a8ef64a5d83ef66181585a3270b99e1c8a5135d482d8d5605719ddc9","last_reissued_at":"2026-05-18T02:29:23.601235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:23.601235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Threshold Saturation for Spatially-Coupled LDPC and LDGM Codes on BMS Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew J. Young, Henry D. Pfister, Nicolas Macris, Santhosh Kumar","submitted_at":"2013-09-29T06:44:59Z","abstract_excerpt":"Spatially-coupled low-density parity-check (LDPC) codes, which were first introduced as LDPC convolutional codes, have been shown to exhibit excellent performance under low-complexity belief-propagation decoding. This phenomenon is now termed threshold saturation via spatial coupling. Spatially-coupled codes have been successfully applied in numerous areas. In particular, it was proven that spatially-coupled regular LDPC codes universally achieve capacity over the class of binary memoryless symmetric (BMS) channels under belief-propagation decoding.\n  Recently, potential functions have been us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7543","kind":"arxiv","version":2},"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":"1309.7543","created_at":"2026-05-18T02:29:23.601326+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7543v2","created_at":"2026-05-18T02:29:23.601326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7543","created_at":"2026-05-18T02:29:23.601326+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFRV4QVI55SK","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFRV4QVI55SKLWB6","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFRV4QVI","created_at":"2026-05-18T12:28:04.890932+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/VFRV4QVI55SKLWB66ZQYCWC2GJ","json":"https://pith.science/pith/VFRV4QVI55SKLWB66ZQYCWC2GJ.json","graph_json":"https://pith.science/api/pith-number/VFRV4QVI55SKLWB66ZQYCWC2GJ/graph.json","events_json":"https://pith.science/api/pith-number/VFRV4QVI55SKLWB66ZQYCWC2GJ/events.json","paper":"https://pith.science/paper/VFRV4QVI"},"agent_actions":{"view_html":"https://pith.science/pith/VFRV4QVI55SKLWB66ZQYCWC2GJ","download_json":"https://pith.science/pith/VFRV4QVI55SKLWB66ZQYCWC2GJ.json","view_paper":"https://pith.science/paper/VFRV4QVI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7543&json=true","fetch_graph":"https://pith.science/api/pith-number/VFRV4QVI55SKLWB66ZQYCWC2GJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VFRV4QVI55SKLWB66ZQYCWC2GJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFRV4QVI55SKLWB66ZQYCWC2GJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFRV4QVI55SKLWB66ZQYCWC2GJ/action/storage_attestation","attest_author":"https://pith.science/pith/VFRV4QVI55SKLWB66ZQYCWC2GJ/action/author_attestation","sign_citation":"https://pith.science/pith/VFRV4QVI55SKLWB66ZQYCWC2GJ/action/citation_signature","submit_replication":"https://pith.science/pith/VFRV4QVI55SKLWB66ZQYCWC2GJ/action/replication_record"}},"created_at":"2026-05-18T02:29:23.601326+00:00","updated_at":"2026-05-18T02:29:23.601326+00:00"}