{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:U5K5JHCCADDG6G6OUKNJ7GFJZV","short_pith_number":"pith:U5K5JHCC","canonical_record":{"source":{"id":"1308.4809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-22T09:46:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dcc4c929e881c15cdf4d55697d107ad4a3fd88480f0d1853bfe0789e60586a64","abstract_canon_sha256":"5df0aca1479bf9179e404bac52acdf31913ea27a6deb1e54d31698d7a38d76f6"},"schema_version":"1.0"},"canonical_sha256":"a755d49c4200c66f1bcea29a9f98a9cd575dbb98e04eb209a453c77851cb60a6","source":{"kind":"arxiv","id":"1308.4809","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4809","created_at":"2026-05-18T03:15:19Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4809v1","created_at":"2026-05-18T03:15:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4809","created_at":"2026-05-18T03:15:19Z"},{"alias_kind":"pith_short_12","alias_value":"U5K5JHCCADDG","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U5K5JHCCADDG6G6O","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U5K5JHCC","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:U5K5JHCCADDG6G6OUKNJ7GFJZV","target":"record","payload":{"canonical_record":{"source":{"id":"1308.4809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-22T09:46:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dcc4c929e881c15cdf4d55697d107ad4a3fd88480f0d1853bfe0789e60586a64","abstract_canon_sha256":"5df0aca1479bf9179e404bac52acdf31913ea27a6deb1e54d31698d7a38d76f6"},"schema_version":"1.0"},"canonical_sha256":"a755d49c4200c66f1bcea29a9f98a9cd575dbb98e04eb209a453c77851cb60a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:19.709608Z","signature_b64":"d1K7qVWgniDTwsZL26d55puL3kG78kJVbyM6hF4/A8rvExQmpKxYgeYZPNZou/96lfM+tX9S71XuQs/d01gNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a755d49c4200c66f1bcea29a9f98a9cd575dbb98e04eb209a453c77851cb60a6","last_reissued_at":"2026-05-18T03:15:19.708684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:19.708684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.4809","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-18T03:15:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WsgwoyA0EoTDCLwSYl5tOsHb4cy616ta+gtY6DoX5JAMtN6aAKWBKlN2A4v/c6MDSPjkAbb0mIaDoAiftlbvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:11:22.084952Z"},"content_sha256":"7cb5a6c44d229c1add285e6bac01e8fe4676c1812cfbecb316d880e52f1f9032","schema_version":"1.0","event_id":"sha256:7cb5a6c44d229c1add285e6bac01e8fe4676c1812cfbecb316d880e52f1f9032"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:U5K5JHCCADDG6G6OUKNJ7GFJZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Block Markov Superposition Transmission: Construction of Big Convolutional Codes from Short Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chulong Liang, Kechao Huang, Qiutao Zhuang, Xiao Ma","submitted_at":"2013-08-22T09:46:36Z","abstract_excerpt":"A construction of big convolutional codes from short codes called block Markov superposition transmission (BMST) is proposed. The BMST is very similar to superposition blockMarkov encoding (SBME), which has been widely used to prove multiuser coding theorems. The encoding process of BMST can be as fast as that of the involved short code, while the decoding process can be implemented as an iterative sliding-window decoding algorithm with a tunable delay. More importantly, the performance of BMST can be simply lower-bounded in terms of the transmission memory given that the performance of the sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4809","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-18T03:15:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7QENEtJHF2G2vQdP41bxY8m65ok4eGlus+J7vhGMD/IbNwNYSYiFeXbfMOtmXko5hgLVshu/pwBfVmcRVL0pAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:11:22.085767Z"},"content_sha256":"3df52d413a82a6b76bd5e90700f53a8098932f223d00d9db2b7747c11c7a86f9","schema_version":"1.0","event_id":"sha256:3df52d413a82a6b76bd5e90700f53a8098932f223d00d9db2b7747c11c7a86f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U5K5JHCCADDG6G6OUKNJ7GFJZV/bundle.json","state_url":"https://pith.science/pith/U5K5JHCCADDG6G6OUKNJ7GFJZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U5K5JHCCADDG6G6OUKNJ7GFJZV/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-09T19:11:22Z","links":{"resolver":"https://pith.science/pith/U5K5JHCCADDG6G6OUKNJ7GFJZV","bundle":"https://pith.science/pith/U5K5JHCCADDG6G6OUKNJ7GFJZV/bundle.json","state":"https://pith.science/pith/U5K5JHCCADDG6G6OUKNJ7GFJZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U5K5JHCCADDG6G6OUKNJ7GFJZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:U5K5JHCCADDG6G6OUKNJ7GFJZV","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":"5df0aca1479bf9179e404bac52acdf31913ea27a6deb1e54d31698d7a38d76f6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-22T09:46:36Z","title_canon_sha256":"dcc4c929e881c15cdf4d55697d107ad4a3fd88480f0d1853bfe0789e60586a64"},"schema_version":"1.0","source":{"id":"1308.4809","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4809","created_at":"2026-05-18T03:15:19Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4809v1","created_at":"2026-05-18T03:15:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4809","created_at":"2026-05-18T03:15:19Z"},{"alias_kind":"pith_short_12","alias_value":"U5K5JHCCADDG","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U5K5JHCCADDG6G6O","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U5K5JHCC","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:3df52d413a82a6b76bd5e90700f53a8098932f223d00d9db2b7747c11c7a86f9","target":"graph","created_at":"2026-05-18T03:15:19Z","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 construction of big convolutional codes from short codes called block Markov superposition transmission (BMST) is proposed. The BMST is very similar to superposition blockMarkov encoding (SBME), which has been widely used to prove multiuser coding theorems. The encoding process of BMST can be as fast as that of the involved short code, while the decoding process can be implemented as an iterative sliding-window decoding algorithm with a tunable delay. More importantly, the performance of BMST can be simply lower-bounded in terms of the transmission memory given that the performance of the sh","authors_text":"Chulong Liang, Kechao Huang, Qiutao Zhuang, Xiao Ma","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-22T09:46:36Z","title":"Block Markov Superposition Transmission: Construction of Big Convolutional Codes from Short Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4809","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:7cb5a6c44d229c1add285e6bac01e8fe4676c1812cfbecb316d880e52f1f9032","target":"record","created_at":"2026-05-18T03:15:19Z","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":"5df0aca1479bf9179e404bac52acdf31913ea27a6deb1e54d31698d7a38d76f6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-22T09:46:36Z","title_canon_sha256":"dcc4c929e881c15cdf4d55697d107ad4a3fd88480f0d1853bfe0789e60586a64"},"schema_version":"1.0","source":{"id":"1308.4809","kind":"arxiv","version":1}},"canonical_sha256":"a755d49c4200c66f1bcea29a9f98a9cd575dbb98e04eb209a453c77851cb60a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a755d49c4200c66f1bcea29a9f98a9cd575dbb98e04eb209a453c77851cb60a6","first_computed_at":"2026-05-18T03:15:19.708684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:19.708684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d1K7qVWgniDTwsZL26d55puL3kG78kJVbyM6hF4/A8rvExQmpKxYgeYZPNZou/96lfM+tX9S71XuQs/d01gNAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:19.709608Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.4809","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cb5a6c44d229c1add285e6bac01e8fe4676c1812cfbecb316d880e52f1f9032","sha256:3df52d413a82a6b76bd5e90700f53a8098932f223d00d9db2b7747c11c7a86f9"],"state_sha256":"76794b7994f4b5e8a19571ac608881f926e17eaf46eb5e51fe0934324ec9539b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9nhCTUbICwb+TxBp+4gC8Blb5ksUDWm6PMhmiJ5dBhIJvZTYO2t6wjvf1mpR0MFAI5ttCxyFbV3gQzIYsO5dDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:11:22.090202Z","bundle_sha256":"c820bec6a27e301770dd0df204a581d808f4465784c18c3cb2017b0cd6757fea"}}