{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QQFUJGUWOP3S3HVOCHRQEOOTRC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e55d36841fbdb67e95a0f1fba552392ebf559c87f1eadc2dc81614f841996ac0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-16T20:24:31Z","title_canon_sha256":"503888d7f6809fe98699a17b28a4c85b7690be5523903f6f00996074f45be708"},"schema_version":"1.0","source":{"id":"1107.3253","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3253","created_at":"2026-05-18T04:11:17Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3253v2","created_at":"2026-05-18T04:11:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3253","created_at":"2026-05-18T04:11:17Z"},{"alias_kind":"pith_short_12","alias_value":"QQFUJGUWOP3S","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QQFUJGUWOP3S3HVO","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QQFUJGUW","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:9d2c09def066cfb4b4d5ace88450f1177a498d93667af7e51f9d458940aa1020","target":"graph","created_at":"2026-05-18T04:11:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Recently, it has been observed that terminated low-density-parity-check (LDPC) convolutional codes (or spatially-coupled codes) appear to approach capacity universally across the class of binary memoryless channels. This is facilitated by the \"threshold saturation\" effect whereby the belief-propagation (BP) threshold of the spatially-coupled ensemble is boosted to the maximum a-posteriori (MAP) threshold of the underlying constituent ensemble.\n  In this paper, we consider the universality of spatially-coupled codes over intersymbol-interference (ISI) channels under joint iterative decoding. Mo","authors_text":"Arvind Yedla, Henry D. Pfister, Krishna R. Narayanan, Phong S. Nguyen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-16T20:24:31Z","title":"Spatially-Coupled Codes and Threshold Saturation on Intersymbol-Interference Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3253","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e1b1f245b99b96d8890fce0f303c2ac4471712697a6d1407d2f4f7af049f9815","target":"record","created_at":"2026-05-18T04:11:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e55d36841fbdb67e95a0f1fba552392ebf559c87f1eadc2dc81614f841996ac0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-07-16T20:24:31Z","title_canon_sha256":"503888d7f6809fe98699a17b28a4c85b7690be5523903f6f00996074f45be708"},"schema_version":"1.0","source":{"id":"1107.3253","kind":"arxiv","version":2}},"canonical_sha256":"840b449a9673f72d9eae11e30239d38890fc9c3a274b41cc8115c5fa1624c4a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"840b449a9673f72d9eae11e30239d38890fc9c3a274b41cc8115c5fa1624c4a7","first_computed_at":"2026-05-18T04:11:17.715538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:17.715538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QMkKpZ8lwkPP5qIPsBpKp+duXFIJEyvIEWK1uee6ayq1mdYWDCKGR9FMxAwI8/7iUmtzwFbKaS1eMNTI7UumDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:17.716190Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.3253","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1b1f245b99b96d8890fce0f303c2ac4471712697a6d1407d2f4f7af049f9815","sha256:9d2c09def066cfb4b4d5ace88450f1177a498d93667af7e51f9d458940aa1020"],"state_sha256":"e577810a952cdf8f881f7f61274cd8201554a5ca60e4d70faa85c045360fa26f"}