{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3OG7IZM63QP4OT2NZTKAW2PAL2","short_pith_number":"pith:3OG7IZM6","canonical_record":{"source":{"id":"1312.3368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-11T22:58:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"51fe992efe527835d320b66bb7dee78ffe46ebea0c01150b5130b3d020bdb071","abstract_canon_sha256":"e6f809bd11501636219edd7a1bfb61a5a813287e3fbc9feba22821b71513d644"},"schema_version":"1.0"},"canonical_sha256":"db8df4659edc1fc74f4dccd40b69e05e91fe3c4bccef711f3c578ef8fbea8f92","source":{"kind":"arxiv","id":"1312.3368","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3368","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3368v1","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3368","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"3OG7IZM63QP4","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3OG7IZM63QP4OT2N","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3OG7IZM6","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3OG7IZM63QP4OT2NZTKAW2PAL2","target":"record","payload":{"canonical_record":{"source":{"id":"1312.3368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-11T22:58:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"51fe992efe527835d320b66bb7dee78ffe46ebea0c01150b5130b3d020bdb071","abstract_canon_sha256":"e6f809bd11501636219edd7a1bfb61a5a813287e3fbc9feba22821b71513d644"},"schema_version":"1.0"},"canonical_sha256":"db8df4659edc1fc74f4dccd40b69e05e91fe3c4bccef711f3c578ef8fbea8f92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:52.446605Z","signature_b64":"21PfQxr1GninK+BQXfNqetkT5D/K7heDR9VGEr2YK6WfoMKSlGJ4evTvr+RkIzRM8v4GI2CnL+npam5uWpDvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db8df4659edc1fc74f4dccd40b69e05e91fe3c4bccef711f3c578ef8fbea8f92","last_reissued_at":"2026-05-18T00:57:52.446066Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:52.446066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.3368","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:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A6vwDsOzu7prxwSJ5cyKNb7xTLKt3ML2YaNXJvHjVJ/iGhOuV5mzhwJHVJ95+nlHoTiIlPM5Q+8R8+x7rfnqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T02:34:31.403928Z"},"content_sha256":"b5d6cf9a6f73ba098ed9742c5fadeb40956d2d3d6ebb2682e7b82965cc9cc865","schema_version":"1.0","event_id":"sha256:b5d6cf9a6f73ba098ed9742c5fadeb40956d2d3d6ebb2682e7b82965cc9cc865"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3OG7IZM63QP4OT2NZTKAW2PAL2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Codes on Graphs Constructed by Connecting Spatially Coupled Chains","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, Dmitri Truhachev, Michael Lentmaier","submitted_at":"2013-12-11T22:58:28Z","abstract_excerpt":"A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) codes is presented. The proposed code ensembles are described by protographs, comprised of several protograph-based chains characterizing individual SC-LDPC codes. We demonstrate that code ensembles obtained by connecting appropriately chosen SC-LDPC code chains at specific points have improved iterative decoding thresholds compared to those of single SC-LDPC coupled chains. In addition, it is shown that the improved decoding properties of the connected ensembles result in reduced decoding complexity requir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3368","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:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c4Wzgmo87B672xBtq0TSI1Lskx3ArrqkKO2lwJobHDZ8MIAvDHO7ed21HmK9HtM8pVSYg54LMxPmmZvQzS9wCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T02:34:31.404690Z"},"content_sha256":"dcb6bfc21d6423e8121cb6e94fd086fbc6c0accd0dc1ce22fde8c76429333be5","schema_version":"1.0","event_id":"sha256:dcb6bfc21d6423e8121cb6e94fd086fbc6c0accd0dc1ce22fde8c76429333be5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3OG7IZM63QP4OT2NZTKAW2PAL2/bundle.json","state_url":"https://pith.science/pith/3OG7IZM63QP4OT2NZTKAW2PAL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3OG7IZM63QP4OT2NZTKAW2PAL2/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-05-20T02:34:31Z","links":{"resolver":"https://pith.science/pith/3OG7IZM63QP4OT2NZTKAW2PAL2","bundle":"https://pith.science/pith/3OG7IZM63QP4OT2NZTKAW2PAL2/bundle.json","state":"https://pith.science/pith/3OG7IZM63QP4OT2NZTKAW2PAL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3OG7IZM63QP4OT2NZTKAW2PAL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3OG7IZM63QP4OT2NZTKAW2PAL2","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":"e6f809bd11501636219edd7a1bfb61a5a813287e3fbc9feba22821b71513d644","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-11T22:58:28Z","title_canon_sha256":"51fe992efe527835d320b66bb7dee78ffe46ebea0c01150b5130b3d020bdb071"},"schema_version":"1.0","source":{"id":"1312.3368","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3368","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3368v1","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3368","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"3OG7IZM63QP4","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3OG7IZM63QP4OT2N","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3OG7IZM6","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:dcb6bfc21d6423e8121cb6e94fd086fbc6c0accd0dc1ce22fde8c76429333be5","target":"graph","created_at":"2026-05-18T00:57:52Z","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":"A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) codes is presented. The proposed code ensembles are described by protographs, comprised of several protograph-based chains characterizing individual SC-LDPC codes. We demonstrate that code ensembles obtained by connecting appropriately chosen SC-LDPC code chains at specific points have improved iterative decoding thresholds compared to those of single SC-LDPC coupled chains. In addition, it is shown that the improved decoding properties of the connected ensembles result in reduced decoding complexity requir","authors_text":"Daniel J. Costello Jr, David G. M. Mitchell, Dmitri Truhachev, Michael Lentmaier","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-11T22:58:28Z","title":"New Codes on Graphs Constructed by Connecting Spatially Coupled Chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3368","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:b5d6cf9a6f73ba098ed9742c5fadeb40956d2d3d6ebb2682e7b82965cc9cc865","target":"record","created_at":"2026-05-18T00:57:52Z","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":"e6f809bd11501636219edd7a1bfb61a5a813287e3fbc9feba22821b71513d644","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-11T22:58:28Z","title_canon_sha256":"51fe992efe527835d320b66bb7dee78ffe46ebea0c01150b5130b3d020bdb071"},"schema_version":"1.0","source":{"id":"1312.3368","kind":"arxiv","version":1}},"canonical_sha256":"db8df4659edc1fc74f4dccd40b69e05e91fe3c4bccef711f3c578ef8fbea8f92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db8df4659edc1fc74f4dccd40b69e05e91fe3c4bccef711f3c578ef8fbea8f92","first_computed_at":"2026-05-18T00:57:52.446066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:52.446066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"21PfQxr1GninK+BQXfNqetkT5D/K7heDR9VGEr2YK6WfoMKSlGJ4evTvr+RkIzRM8v4GI2CnL+npam5uWpDvBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:52.446605Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3368","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5d6cf9a6f73ba098ed9742c5fadeb40956d2d3d6ebb2682e7b82965cc9cc865","sha256:dcb6bfc21d6423e8121cb6e94fd086fbc6c0accd0dc1ce22fde8c76429333be5"],"state_sha256":"a65efcfe47747412f4697742c7d12fd870d1195ba1ee73ccb051473e9877d951"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zK33ZjNqqRn0XxVWwboDuD4C5wscIUhVemmNiSzxlVZunIEh+dZhp8WpLkMl4P/Yc3lIZ5XeBRuMJlVmMnZ1Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T02:34:31.409473Z","bundle_sha256":"a18f9858ffc04c860ccad7ab315926a393cfe3698b76b00c11e91d4ab07565be"}}