{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RXZZ546WXWJTZHMNI2NSEBJPFZ","short_pith_number":"pith:RXZZ546W","canonical_record":{"source":{"id":"1407.5366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-21T03:26:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3280e700db298dc4ca1f8af53e9845c15dcb4d1a8bc487228e9cf2b394cd059e","abstract_canon_sha256":"7acfd55305675556d3cf97010fc3412ae0ded79a52ee96a76b1402d42889defc"},"schema_version":"1.0"},"canonical_sha256":"8df39ef3d6bd933c9d8d469b22052f2e706b7d4b99ddd501d20a5753ecd050e0","source":{"kind":"arxiv","id":"1407.5366","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5366","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5366v1","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5366","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"RXZZ546WXWJT","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RXZZ546WXWJTZHMN","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RXZZ546W","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RXZZ546WXWJTZHMNI2NSEBJPFZ","target":"record","payload":{"canonical_record":{"source":{"id":"1407.5366","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-21T03:26:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3280e700db298dc4ca1f8af53e9845c15dcb4d1a8bc487228e9cf2b394cd059e","abstract_canon_sha256":"7acfd55305675556d3cf97010fc3412ae0ded79a52ee96a76b1402d42889defc"},"schema_version":"1.0"},"canonical_sha256":"8df39ef3d6bd933c9d8d469b22052f2e706b7d4b99ddd501d20a5753ecd050e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:41.218015Z","signature_b64":"JCb/MNfQyveOyBsEGtLzRb6EtHQ6XTUhNPvVarBYfdqT3GHJoGEZESpx5lUWxFkSg9pnbdIGmRykoDJvDv0+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8df39ef3d6bd933c9d8d469b22052f2e706b7d4b99ddd501d20a5753ecd050e0","last_reissued_at":"2026-05-18T00:58:41.217218Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:41.217218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.5366","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hzUxK27unUkimtSgxCRl/iSSo1HJK12VT66HulVGxg2JuhqhS3IdkuuhfejJ7VsrkZZvfp36FcUvbqDabdxrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:10:34.877132Z"},"content_sha256":"c6943902deafbfbd5f299d9c5a1f8e03b8409987fc0302109b4e8df4161a6bbf","schema_version":"1.0","event_id":"sha256:c6943902deafbfbd5f299d9c5a1f8e03b8409987fc0302109b4e8df4161a6bbf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RXZZ546WXWJTZHMNI2NSEBJPFZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spatially Coupled LDPC Codes Constructed from Protographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel J. Costello Jr, David G. M. Mitchell, Michael Lentmaier","submitted_at":"2014-07-21T03:26:27Z","abstract_excerpt":"In this paper, we construct protograph-based spatially coupled low-density parity-check (SC-LDPC) codes by coupling together a series of L disjoint, or uncoupled, LDPC code Tanner graphs into a single coupled chain. By varying L, we obtain a flexible family of code ensembles with varying rates and frame lengths that can share the same encoding and decoding architecture for arbitrary L. We demonstrate that the resulting codes combine the best features of optimized irregular and regular codes in one design: capacity approaching iterative belief propagation (BP) decoding thresholds and linear gro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5366","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:58:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZniVJ/sP0UaZrtmfOdInf72g7NS+U5eCikb1Z6H0CpOdqyPYRA7VoW6R60QW2dXFvEqxF/E9p+Ch9yjpdRTOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:10:34.877488Z"},"content_sha256":"cf35d9e2c41824f479dc8649782fbf708941e26ae31e162ec4ec589ad051259c","schema_version":"1.0","event_id":"sha256:cf35d9e2c41824f479dc8649782fbf708941e26ae31e162ec4ec589ad051259c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RXZZ546WXWJTZHMNI2NSEBJPFZ/bundle.json","state_url":"https://pith.science/pith/RXZZ546WXWJTZHMNI2NSEBJPFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RXZZ546WXWJTZHMNI2NSEBJPFZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T22:10:34Z","links":{"resolver":"https://pith.science/pith/RXZZ546WXWJTZHMNI2NSEBJPFZ","bundle":"https://pith.science/pith/RXZZ546WXWJTZHMNI2NSEBJPFZ/bundle.json","state":"https://pith.science/pith/RXZZ546WXWJTZHMNI2NSEBJPFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RXZZ546WXWJTZHMNI2NSEBJPFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RXZZ546WXWJTZHMNI2NSEBJPFZ","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":"7acfd55305675556d3cf97010fc3412ae0ded79a52ee96a76b1402d42889defc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-21T03:26:27Z","title_canon_sha256":"3280e700db298dc4ca1f8af53e9845c15dcb4d1a8bc487228e9cf2b394cd059e"},"schema_version":"1.0","source":{"id":"1407.5366","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5366","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5366v1","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5366","created_at":"2026-05-18T00:58:41Z"},{"alias_kind":"pith_short_12","alias_value":"RXZZ546WXWJT","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RXZZ546WXWJTZHMN","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RXZZ546W","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:cf35d9e2c41824f479dc8649782fbf708941e26ae31e162ec4ec589ad051259c","target":"graph","created_at":"2026-05-18T00:58:41Z","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":"In this paper, we construct protograph-based spatially coupled low-density parity-check (SC-LDPC) codes by coupling together a series of L disjoint, or uncoupled, LDPC code Tanner graphs into a single coupled chain. By varying L, we obtain a flexible family of code ensembles with varying rates and frame lengths that can share the same encoding and decoding architecture for arbitrary L. We demonstrate that the resulting codes combine the best features of optimized irregular and regular codes in one design: capacity approaching iterative belief propagation (BP) decoding thresholds and linear gro","authors_text":"Daniel J. Costello Jr, David G. M. Mitchell, Michael Lentmaier","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-21T03:26:27Z","title":"Spatially Coupled LDPC Codes Constructed from Protographs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5366","kind":"arxiv","version":1},"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:c6943902deafbfbd5f299d9c5a1f8e03b8409987fc0302109b4e8df4161a6bbf","target":"record","created_at":"2026-05-18T00:58:41Z","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":"7acfd55305675556d3cf97010fc3412ae0ded79a52ee96a76b1402d42889defc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-21T03:26:27Z","title_canon_sha256":"3280e700db298dc4ca1f8af53e9845c15dcb4d1a8bc487228e9cf2b394cd059e"},"schema_version":"1.0","source":{"id":"1407.5366","kind":"arxiv","version":1}},"canonical_sha256":"8df39ef3d6bd933c9d8d469b22052f2e706b7d4b99ddd501d20a5753ecd050e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8df39ef3d6bd933c9d8d469b22052f2e706b7d4b99ddd501d20a5753ecd050e0","first_computed_at":"2026-05-18T00:58:41.217218Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:41.217218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JCb/MNfQyveOyBsEGtLzRb6EtHQ6XTUhNPvVarBYfdqT3GHJoGEZESpx5lUWxFkSg9pnbdIGmRykoDJvDv0+Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:41.218015Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5366","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6943902deafbfbd5f299d9c5a1f8e03b8409987fc0302109b4e8df4161a6bbf","sha256:cf35d9e2c41824f479dc8649782fbf708941e26ae31e162ec4ec589ad051259c"],"state_sha256":"2569b55be884f37b4b8cefacc763491c1bc063d704b7b5f61f700250ad09a1bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KSs0KlkxJmFIYZl16L97F3ZoUB0gqVeQ5hvNqnh3iaTz7q0Xt0gMkgQxmPhAAoXalkb3FfkL2oRluAhNEcBDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:10:34.879382Z","bundle_sha256":"e99cc68fda956465e30adc0a867d9c7c8249967eea37eb7232681b3b1a4a5f0d"}}