{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZZVXYQZW26MTA7O2ZNLTQQIMZ5","short_pith_number":"pith:ZZVXYQZW","schema_version":"1.0","canonical_sha256":"ce6b7c4336d799307ddacb5738410ccf4d4c01e77c87f3db0cb3f623cab03040","source":{"kind":"arxiv","id":"1512.09180","version":3},"attestation_state":"computed","paper":{"title":"Deterministic and Ensemble-Based Spatially-Coupled Product Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Christian H\\\"ager, Fredrik Br\\\"annstr\\\"om, Henry D. Pfister","submitted_at":"2015-12-30T23:11:50Z","abstract_excerpt":"Several authors have proposed spatially-coupled (or convolutional-like) variants of product codes (PCs). In this paper, we focus on a parametrized family of generalized PCs that recovers some of these codes (e.g., staircase and block-wise braided codes) as special cases and study the iterative decoding performance over the binary erasure channel. Even though our code construction is deterministic (and not based on a randomized ensemble), we show that it is still possible to rigorously derive the density evolution (DE) equations that govern the asymptotic performance. The obtained DE equations "},"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":"1512.09180","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-30T23:11:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f3573788434d01fd4811d611fef819dd3009755e2d79cb7e430d035316aacee4","abstract_canon_sha256":"1db5708e1861ed8003e40525d8ce8ff975744a5cc385c32b4066f63e8b2d76e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:06.733633Z","signature_b64":"KhQcTAVVaoSrOHHhsJKGuSZYhvZbVU/fjopawDpCC/H6ACwww+1M0CM5FbAG7LlBTDvePzNRuU7k4C7HhoO1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce6b7c4336d799307ddacb5738410ccf4d4c01e77c87f3db0cb3f623cab03040","last_reissued_at":"2026-05-18T01:16:06.733122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:06.733122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic and Ensemble-Based Spatially-Coupled Product Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Christian H\\\"ager, Fredrik Br\\\"annstr\\\"om, Henry D. Pfister","submitted_at":"2015-12-30T23:11:50Z","abstract_excerpt":"Several authors have proposed spatially-coupled (or convolutional-like) variants of product codes (PCs). In this paper, we focus on a parametrized family of generalized PCs that recovers some of these codes (e.g., staircase and block-wise braided codes) as special cases and study the iterative decoding performance over the binary erasure channel. Even though our code construction is deterministic (and not based on a randomized ensemble), we show that it is still possible to rigorously derive the density evolution (DE) equations that govern the asymptotic performance. The obtained DE equations "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09180","kind":"arxiv","version":3},"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":"1512.09180","created_at":"2026-05-18T01:16:06.733196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.09180v3","created_at":"2026-05-18T01:16:06.733196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09180","created_at":"2026-05-18T01:16:06.733196+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZVXYQZW26MT","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZVXYQZW26MTA7O2","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZVXYQZW","created_at":"2026-05-18T12:29:52.810259+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/ZZVXYQZW26MTA7O2ZNLTQQIMZ5","json":"https://pith.science/pith/ZZVXYQZW26MTA7O2ZNLTQQIMZ5.json","graph_json":"https://pith.science/api/pith-number/ZZVXYQZW26MTA7O2ZNLTQQIMZ5/graph.json","events_json":"https://pith.science/api/pith-number/ZZVXYQZW26MTA7O2ZNLTQQIMZ5/events.json","paper":"https://pith.science/paper/ZZVXYQZW"},"agent_actions":{"view_html":"https://pith.science/pith/ZZVXYQZW26MTA7O2ZNLTQQIMZ5","download_json":"https://pith.science/pith/ZZVXYQZW26MTA7O2ZNLTQQIMZ5.json","view_paper":"https://pith.science/paper/ZZVXYQZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.09180&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZVXYQZW26MTA7O2ZNLTQQIMZ5/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZVXYQZW26MTA7O2ZNLTQQIMZ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZVXYQZW26MTA7O2ZNLTQQIMZ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZVXYQZW26MTA7O2ZNLTQQIMZ5/action/storage_attestation","attest_author":"https://pith.science/pith/ZZVXYQZW26MTA7O2ZNLTQQIMZ5/action/author_attestation","sign_citation":"https://pith.science/pith/ZZVXYQZW26MTA7O2ZNLTQQIMZ5/action/citation_signature","submit_replication":"https://pith.science/pith/ZZVXYQZW26MTA7O2ZNLTQQIMZ5/action/replication_record"}},"created_at":"2026-05-18T01:16:06.733196+00:00","updated_at":"2026-05-18T01:16:06.733196+00:00"}