{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:57YSEMMCJDSNREZANFP7CXP4GJ","short_pith_number":"pith:57YSEMMC","canonical_record":{"source":{"id":"1402.7170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-28T09:10:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bb579efc68f1f797411d1126a28b1202cdb6f496f695514d737f9cd8783b4905","abstract_canon_sha256":"db5df1f823dc2c7a933d60e17a4f1f736db76b22aba16dba0634dde3f78b77a4"},"schema_version":"1.0"},"canonical_sha256":"eff122318248e4d89320695ff15dfc3264c3028cec721cd0fffb663c030e9c39","source":{"kind":"arxiv","id":"1402.7170","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.7170","created_at":"2026-05-18T02:57:34Z"},{"alias_kind":"arxiv_version","alias_value":"1402.7170v1","created_at":"2026-05-18T02:57:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7170","created_at":"2026-05-18T02:57:34Z"},{"alias_kind":"pith_short_12","alias_value":"57YSEMMCJDSN","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"57YSEMMCJDSNREZA","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"57YSEMMC","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:57YSEMMCJDSNREZANFP7CXP4GJ","target":"record","payload":{"canonical_record":{"source":{"id":"1402.7170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-28T09:10:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bb579efc68f1f797411d1126a28b1202cdb6f496f695514d737f9cd8783b4905","abstract_canon_sha256":"db5df1f823dc2c7a933d60e17a4f1f736db76b22aba16dba0634dde3f78b77a4"},"schema_version":"1.0"},"canonical_sha256":"eff122318248e4d89320695ff15dfc3264c3028cec721cd0fffb663c030e9c39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:34.766541Z","signature_b64":"90DfMJSiTi+37RVreozxh2Ups8xSzc80ImUfmON+GlLgrtDtILBJmv23geuQdKwD3r++KzAwGkte8BlhfqIFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eff122318248e4d89320695ff15dfc3264c3028cec721cd0fffb663c030e9c39","last_reissued_at":"2026-05-18T02:57:34.765845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:34.765845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.7170","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-18T02:57:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wKNj+G2CQHeJ+l8wWHp/rnKuGnJUNwCMCB7v6B2ftaHMWRv7lY/sfGUzA9AH8MD5uLo6X8QqYn6ZI/kgyHayBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:19:54.018391Z"},"content_sha256":"8db87b3fe673e75d3b493cd74b8cfef1c1e684e9b3e21fb0ca008740e5ede6bf","schema_version":"1.0","event_id":"sha256:8db87b3fe673e75d3b493cd74b8cfef1c1e684e9b3e21fb0ca008740e5ede6bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:57YSEMMCJDSNREZANFP7CXP4GJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving the Finite-Length Performance of Spatially Coupled LDPC Codes by Connecting Multiple Code 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, Pablo M. Olmos","submitted_at":"2014-02-28T09:10:34Z","abstract_excerpt":"In this paper, we analyze the finite-length performance of codes on graphs constructed by connecting spatially coupled low-density parity-check (SC-LDPC) code chains. Successive (peeling) decoding is considered for the binary erasure channel (BEC). The evolution of the undecoded portion of the bipartite graph remaining after each iteration is analyzed as a dynamical system. When connecting short SC-LDPC chains, we show that, in addition to superior iterative decoding thresholds, connected chain ensembles have better finite-length performance than single chain ensembles of the same rate and len"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7170","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-18T02:57:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ow5P9kqRrnb92iU7+PRBduLnRsP3+fXqNEcpQDiucHpF+qZFktrIp+ATmuA2y1NqPC92K1tQ/Jv77Ty37pS5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:19:54.019091Z"},"content_sha256":"97e38d7ef13c5cc10ee90342d629c8241fa648f98bed7d17f2bb9fba765898a5","schema_version":"1.0","event_id":"sha256:97e38d7ef13c5cc10ee90342d629c8241fa648f98bed7d17f2bb9fba765898a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/57YSEMMCJDSNREZANFP7CXP4GJ/bundle.json","state_url":"https://pith.science/pith/57YSEMMCJDSNREZANFP7CXP4GJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/57YSEMMCJDSNREZANFP7CXP4GJ/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-25T21:19:54Z","links":{"resolver":"https://pith.science/pith/57YSEMMCJDSNREZANFP7CXP4GJ","bundle":"https://pith.science/pith/57YSEMMCJDSNREZANFP7CXP4GJ/bundle.json","state":"https://pith.science/pith/57YSEMMCJDSNREZANFP7CXP4GJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/57YSEMMCJDSNREZANFP7CXP4GJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:57YSEMMCJDSNREZANFP7CXP4GJ","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":"db5df1f823dc2c7a933d60e17a4f1f736db76b22aba16dba0634dde3f78b77a4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-28T09:10:34Z","title_canon_sha256":"bb579efc68f1f797411d1126a28b1202cdb6f496f695514d737f9cd8783b4905"},"schema_version":"1.0","source":{"id":"1402.7170","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.7170","created_at":"2026-05-18T02:57:34Z"},{"alias_kind":"arxiv_version","alias_value":"1402.7170v1","created_at":"2026-05-18T02:57:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7170","created_at":"2026-05-18T02:57:34Z"},{"alias_kind":"pith_short_12","alias_value":"57YSEMMCJDSN","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"57YSEMMCJDSNREZA","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"57YSEMMC","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:97e38d7ef13c5cc10ee90342d629c8241fa648f98bed7d17f2bb9fba765898a5","target":"graph","created_at":"2026-05-18T02:57:34Z","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 analyze the finite-length performance of codes on graphs constructed by connecting spatially coupled low-density parity-check (SC-LDPC) code chains. Successive (peeling) decoding is considered for the binary erasure channel (BEC). The evolution of the undecoded portion of the bipartite graph remaining after each iteration is analyzed as a dynamical system. When connecting short SC-LDPC chains, we show that, in addition to superior iterative decoding thresholds, connected chain ensembles have better finite-length performance than single chain ensembles of the same rate and len","authors_text":"Daniel J. Costello Jr, David G. M. Mitchell, Dmitri Truhachev, Pablo M. Olmos","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-28T09:10:34Z","title":"Improving the Finite-Length Performance of Spatially Coupled LDPC Codes by Connecting Multiple Code Chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7170","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:8db87b3fe673e75d3b493cd74b8cfef1c1e684e9b3e21fb0ca008740e5ede6bf","target":"record","created_at":"2026-05-18T02:57:34Z","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":"db5df1f823dc2c7a933d60e17a4f1f736db76b22aba16dba0634dde3f78b77a4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-02-28T09:10:34Z","title_canon_sha256":"bb579efc68f1f797411d1126a28b1202cdb6f496f695514d737f9cd8783b4905"},"schema_version":"1.0","source":{"id":"1402.7170","kind":"arxiv","version":1}},"canonical_sha256":"eff122318248e4d89320695ff15dfc3264c3028cec721cd0fffb663c030e9c39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eff122318248e4d89320695ff15dfc3264c3028cec721cd0fffb663c030e9c39","first_computed_at":"2026-05-18T02:57:34.765845Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:34.765845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"90DfMJSiTi+37RVreozxh2Ups8xSzc80ImUfmON+GlLgrtDtILBJmv23geuQdKwD3r++KzAwGkte8BlhfqIFAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:34.766541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.7170","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8db87b3fe673e75d3b493cd74b8cfef1c1e684e9b3e21fb0ca008740e5ede6bf","sha256:97e38d7ef13c5cc10ee90342d629c8241fa648f98bed7d17f2bb9fba765898a5"],"state_sha256":"f08508a37e4dedab81aae1db8d13aa6b8ad2712f9b9bba06a819818c787850ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TOLLWLScbNLkg+angPK0KphqgHpbgPxBdoZ/vvB1qaZ9u/4PIxD5DgBQ8KhP1XaVIF+XOjtvyACoWrN+5IFTAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:19:54.022876Z","bundle_sha256":"3ac2ec0cf237813862a33524233a766d3fd86cff7ae61142c3d419381bd4e538"}}