{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FFVS4FNDINIFBJVCJXX6JS6UXZ","short_pith_number":"pith:FFVS4FND","schema_version":"1.0","canonical_sha256":"296b2e15a3435050a6a24defe4cbd4be65ab6b4009ee24cb942b69019acefc75","source":{"kind":"arxiv","id":"1512.01132","version":1},"attestation_state":"computed","paper":{"title":"Spatially-coupled Split-component Codes with Iterative Algebraic Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dmitri Truhachev, Frank Kschischang, Lei M. Zhang","submitted_at":"2015-12-03T15:59:31Z","abstract_excerpt":"We analyze a class of high performance, low decoding-data-flow error-correcting codes suitable for high bit-rate optical-fiber communication systems. A spatially-coupled split-component ensemble is defined, generalizing from the most important codes of this class, staircase codes and braided block codes, and preserving a deterministic partitioning of component-code bits over code blocks. Our analysis focuses on low-complexity iterative algebraic decoding, which, for the binary erasure channel, is equivalent to a generalization of the peeling decoder. Using the differential equation method, we "},"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.01132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-03T15:59:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"59da3f4973a348b2ff2bd7e79c31797cc8601f0a92e15c815e4ffffb33e15831","abstract_canon_sha256":"3e7caa81a9e76e6275601e9464ca0b07ff9dc3098573937b16ea67f9d3ec0093"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:18.863899Z","signature_b64":"/5isGE9NJ+N5bYiNlQ3bMaRHP1MDdd9/6hz30+N2SPwwj1KoRl6GvbBQW478WUgqvzD3jK3hWHtZLNIvnB6/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"296b2e15a3435050a6a24defe4cbd4be65ab6b4009ee24cb942b69019acefc75","last_reissued_at":"2026-05-18T01:25:18.863080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:18.863080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spatially-coupled Split-component Codes with Iterative Algebraic Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dmitri Truhachev, Frank Kschischang, Lei M. Zhang","submitted_at":"2015-12-03T15:59:31Z","abstract_excerpt":"We analyze a class of high performance, low decoding-data-flow error-correcting codes suitable for high bit-rate optical-fiber communication systems. A spatially-coupled split-component ensemble is defined, generalizing from the most important codes of this class, staircase codes and braided block codes, and preserving a deterministic partitioning of component-code bits over code blocks. Our analysis focuses on low-complexity iterative algebraic decoding, which, for the binary erasure channel, is equivalent to a generalization of the peeling decoder. Using the differential equation method, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01132","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":"1512.01132","created_at":"2026-05-18T01:25:18.863214+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.01132v1","created_at":"2026-05-18T01:25:18.863214+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01132","created_at":"2026-05-18T01:25:18.863214+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFVS4FNDINIF","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFVS4FNDINIFBJVC","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFVS4FND","created_at":"2026-05-18T12:29:19.899920+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/FFVS4FNDINIFBJVCJXX6JS6UXZ","json":"https://pith.science/pith/FFVS4FNDINIFBJVCJXX6JS6UXZ.json","graph_json":"https://pith.science/api/pith-number/FFVS4FNDINIFBJVCJXX6JS6UXZ/graph.json","events_json":"https://pith.science/api/pith-number/FFVS4FNDINIFBJVCJXX6JS6UXZ/events.json","paper":"https://pith.science/paper/FFVS4FND"},"agent_actions":{"view_html":"https://pith.science/pith/FFVS4FNDINIFBJVCJXX6JS6UXZ","download_json":"https://pith.science/pith/FFVS4FNDINIFBJVCJXX6JS6UXZ.json","view_paper":"https://pith.science/paper/FFVS4FND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.01132&json=true","fetch_graph":"https://pith.science/api/pith-number/FFVS4FNDINIFBJVCJXX6JS6UXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/FFVS4FNDINIFBJVCJXX6JS6UXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFVS4FNDINIFBJVCJXX6JS6UXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFVS4FNDINIFBJVCJXX6JS6UXZ/action/storage_attestation","attest_author":"https://pith.science/pith/FFVS4FNDINIFBJVCJXX6JS6UXZ/action/author_attestation","sign_citation":"https://pith.science/pith/FFVS4FNDINIFBJVCJXX6JS6UXZ/action/citation_signature","submit_replication":"https://pith.science/pith/FFVS4FNDINIFBJVCJXX6JS6UXZ/action/replication_record"}},"created_at":"2026-05-18T01:25:18.863214+00:00","updated_at":"2026-05-18T01:25:18.863214+00:00"}