{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:J2M4WVFFYELMZKKJ63WRDAKM6K","short_pith_number":"pith:J2M4WVFF","canonical_record":{"source":{"id":"1405.2524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-11T11:47:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"50d2b06d2bb0556503a238082560b494f48eb8a81bf9ee1d92d9ff472cff0fe6","abstract_canon_sha256":"ca87435bb367d81c248deb8d727d2ba74fea63f983ea23dbe053e5a9eaacdc71"},"schema_version":"1.0"},"canonical_sha256":"4e99cb54a5c116cca949f6ed11814cf2a1e1daa6a13c15d74eb25beda3ffdeff","source":{"kind":"arxiv","id":"1405.2524","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2524","created_at":"2026-05-18T02:52:05Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2524v1","created_at":"2026-05-18T02:52:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2524","created_at":"2026-05-18T02:52:05Z"},{"alias_kind":"pith_short_12","alias_value":"J2M4WVFFYELM","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J2M4WVFFYELMZKKJ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J2M4WVFF","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:J2M4WVFFYELMZKKJ63WRDAKM6K","target":"record","payload":{"canonical_record":{"source":{"id":"1405.2524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-11T11:47:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"50d2b06d2bb0556503a238082560b494f48eb8a81bf9ee1d92d9ff472cff0fe6","abstract_canon_sha256":"ca87435bb367d81c248deb8d727d2ba74fea63f983ea23dbe053e5a9eaacdc71"},"schema_version":"1.0"},"canonical_sha256":"4e99cb54a5c116cca949f6ed11814cf2a1e1daa6a13c15d74eb25beda3ffdeff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:05.339877Z","signature_b64":"H5SFde8Axntco+ENNqilpgOy8zOY30kVxvE108FBveZKgp3+NCPnOZ4cg6yI3mmHI9GcqzZCxP8Elqk0wCbDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e99cb54a5c116cca949f6ed11814cf2a1e1daa6a13c15d74eb25beda3ffdeff","last_reissued_at":"2026-05-18T02:52:05.339345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:05.339345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.2524","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:52:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UbsexBZnhOi4MDwLSTaV71LYt5HmwAsgN3PFfjkO2ldLbqG8ue9bqkWzF793dEWU10wBIYsja+7BCDYP3/YhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:33:23.745546Z"},"content_sha256":"7b36ee76c48b7b36e8f6fbaf893276d730c17bf443e7f1ed227c8ba1836faa48","schema_version":"1.0","event_id":"sha256:7b36ee76c48b7b36e8f6fbaf893276d730c17bf443e7f1ed227c8ba1836faa48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:J2M4WVFFYELMZKKJ63WRDAKM6K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spatial Coupling of Generator Matrix: A General Approach to Design of Good Codes at a Target BER","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baoming Bai, Chulong Liang, Qiutao Zhuang, Xiao Ma","submitted_at":"2014-05-11T11:47:52Z","abstract_excerpt":"For any given short code (referred to as the basic code), block Markov superposition transmission (BMST) provides a simple way to obtain predictable extra coding gain by spatial coupling the generator matrix of the basic code. This paper presents a systematic design methodology for BMST systems to approach the channel capacity at any given target bit-error-rate (BER) of interest. To simplify the design, we choose the basic code as the Cartesian product of a short block code. The encoding memory is then inferred from the genie-aided lower bound according to the performance gap of the short bloc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2524","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:52:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g67ZNS/wWDD0+6xzpDFavITZJ5sMZAEzLPbFLActY5DMAs+UfSXoXXZx7heTe7E2TGHHUkFmDgqs/nlr+vjwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:33:23.746252Z"},"content_sha256":"43abc2261cdddac835a3bfe54000eec0429b8fda56d64ca42d0ca491c2dbd101","schema_version":"1.0","event_id":"sha256:43abc2261cdddac835a3bfe54000eec0429b8fda56d64ca42d0ca491c2dbd101"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2M4WVFFYELMZKKJ63WRDAKM6K/bundle.json","state_url":"https://pith.science/pith/J2M4WVFFYELMZKKJ63WRDAKM6K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2M4WVFFYELMZKKJ63WRDAKM6K/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-09T04:33:23Z","links":{"resolver":"https://pith.science/pith/J2M4WVFFYELMZKKJ63WRDAKM6K","bundle":"https://pith.science/pith/J2M4WVFFYELMZKKJ63WRDAKM6K/bundle.json","state":"https://pith.science/pith/J2M4WVFFYELMZKKJ63WRDAKM6K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2M4WVFFYELMZKKJ63WRDAKM6K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:J2M4WVFFYELMZKKJ63WRDAKM6K","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":"ca87435bb367d81c248deb8d727d2ba74fea63f983ea23dbe053e5a9eaacdc71","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-11T11:47:52Z","title_canon_sha256":"50d2b06d2bb0556503a238082560b494f48eb8a81bf9ee1d92d9ff472cff0fe6"},"schema_version":"1.0","source":{"id":"1405.2524","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2524","created_at":"2026-05-18T02:52:05Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2524v1","created_at":"2026-05-18T02:52:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2524","created_at":"2026-05-18T02:52:05Z"},{"alias_kind":"pith_short_12","alias_value":"J2M4WVFFYELM","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J2M4WVFFYELMZKKJ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J2M4WVFF","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:43abc2261cdddac835a3bfe54000eec0429b8fda56d64ca42d0ca491c2dbd101","target":"graph","created_at":"2026-05-18T02:52:05Z","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":"For any given short code (referred to as the basic code), block Markov superposition transmission (BMST) provides a simple way to obtain predictable extra coding gain by spatial coupling the generator matrix of the basic code. This paper presents a systematic design methodology for BMST systems to approach the channel capacity at any given target bit-error-rate (BER) of interest. To simplify the design, we choose the basic code as the Cartesian product of a short block code. The encoding memory is then inferred from the genie-aided lower bound according to the performance gap of the short bloc","authors_text":"Baoming Bai, Chulong Liang, Qiutao Zhuang, Xiao Ma","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-11T11:47:52Z","title":"Spatial Coupling of Generator Matrix: A General Approach to Design of Good Codes at a Target BER"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2524","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:7b36ee76c48b7b36e8f6fbaf893276d730c17bf443e7f1ed227c8ba1836faa48","target":"record","created_at":"2026-05-18T02:52:05Z","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":"ca87435bb367d81c248deb8d727d2ba74fea63f983ea23dbe053e5a9eaacdc71","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-11T11:47:52Z","title_canon_sha256":"50d2b06d2bb0556503a238082560b494f48eb8a81bf9ee1d92d9ff472cff0fe6"},"schema_version":"1.0","source":{"id":"1405.2524","kind":"arxiv","version":1}},"canonical_sha256":"4e99cb54a5c116cca949f6ed11814cf2a1e1daa6a13c15d74eb25beda3ffdeff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e99cb54a5c116cca949f6ed11814cf2a1e1daa6a13c15d74eb25beda3ffdeff","first_computed_at":"2026-05-18T02:52:05.339345Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:05.339345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H5SFde8Axntco+ENNqilpgOy8zOY30kVxvE108FBveZKgp3+NCPnOZ4cg6yI3mmHI9GcqzZCxP8Elqk0wCbDDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:05.339877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.2524","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b36ee76c48b7b36e8f6fbaf893276d730c17bf443e7f1ed227c8ba1836faa48","sha256:43abc2261cdddac835a3bfe54000eec0429b8fda56d64ca42d0ca491c2dbd101"],"state_sha256":"cb8339bbc6005b1877af5921aa5eca8b4a0cfa5c79f2b451307e7d90e9995541"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jnrLtG1vY42YuP/cF1kzjeQ5uIeynMES5ez8k1jn0MrK37G2QqRAXPB1VgrJViuPRamOjNXJBZKAbnQ8A+MqBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:33:23.749957Z","bundle_sha256":"3225059f98d7d6bd4cfa33838d77c5434dd8c624451688c2b61a22326f114a59"}}