{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CYKCTY3F7FXACUSF4IFLLU2G5P","short_pith_number":"pith:CYKCTY3F","canonical_record":{"source":{"id":"1601.05193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-20T08:03:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"06535f184f551c8d7f586ad3ef1552122e6cd58a61b1cf0367134930f80646dc","abstract_canon_sha256":"caf12557241337f8b40ac714a43643caba9ca073d7c9016db462c9b2a5feb0b0"},"schema_version":"1.0"},"canonical_sha256":"161429e365f96e015245e20ab5d346ebeeec9b54236de40efc333c51ca4f8343","source":{"kind":"arxiv","id":"1601.05193","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05193","created_at":"2026-05-18T01:22:15Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05193v1","created_at":"2026-05-18T01:22:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05193","created_at":"2026-05-18T01:22:15Z"},{"alias_kind":"pith_short_12","alias_value":"CYKCTY3F7FXA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CYKCTY3F7FXACUSF","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CYKCTY3F","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CYKCTY3F7FXACUSF4IFLLU2G5P","target":"record","payload":{"canonical_record":{"source":{"id":"1601.05193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-20T08:03:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"06535f184f551c8d7f586ad3ef1552122e6cd58a61b1cf0367134930f80646dc","abstract_canon_sha256":"caf12557241337f8b40ac714a43643caba9ca073d7c9016db462c9b2a5feb0b0"},"schema_version":"1.0"},"canonical_sha256":"161429e365f96e015245e20ab5d346ebeeec9b54236de40efc333c51ca4f8343","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:15.879500Z","signature_b64":"H+VYjmzKpgnf03D9d6mNeE2tsVWcLB1pncjCxlQ/SkiBhtjPfCNT//7I5VmOdqi8S/Ca6oYpcHazzJFSbJK0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"161429e365f96e015245e20ab5d346ebeeec9b54236de40efc333c51ca4f8343","last_reissued_at":"2026-05-18T01:22:15.878789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:15.878789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.05193","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-18T01:22:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X7LF3xUZ9JJURhLiNIjUvLfXjRhsyKBXfF13fAHQCYytTgZ+pwjVTcfZ3fCNQOpndl9PP+UOrAiuX/gGlYrrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:23:47.812235Z"},"content_sha256":"b6b47fc27c4214d1a232fbf479df733f47efde92390ad743ead448e9a0b7af1c","schema_version":"1.0","event_id":"sha256:b6b47fc27c4214d1a232fbf479df733f47efde92390ad743ead448e9a0b7af1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CYKCTY3F7FXACUSF4IFLLU2G5P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Systematic Block Markov Superposition Transmission of Repetition Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baoming Bai, Kechao Huang, Xiao Ma","submitted_at":"2016-01-20T08:03:39Z","abstract_excerpt":"In this paper, we propose systematic block Markov superposition transmission of repetition~(BMST-R) codes, which can support a wide range of code rates but maintain essentially the same encoding/decoding hardware structure. The systematic BMST-R codes resemble the classical rate-compatible punctured convolutional~(RCPC) codes, except that they are typically non-decodable by the Viterbi algorithm due to the huge constraint length induced by the block-oriented encoding process. The information sequence is partitioned equally into blocks and transmitted directly, while their replicas are interlea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05193","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-18T01:22:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w7P8WYUvxeP4d75tejoZRbss1ROehdgWGKieYy2RMbwqCInXZonFLiVc+QAX7HBCac9iCP+w7a83y9LKUNe6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:23:47.812992Z"},"content_sha256":"d380eab62e75277d6f53a03dad7a67ff2f5eccd63c190393c1855970fab99424","schema_version":"1.0","event_id":"sha256:d380eab62e75277d6f53a03dad7a67ff2f5eccd63c190393c1855970fab99424"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CYKCTY3F7FXACUSF4IFLLU2G5P/bundle.json","state_url":"https://pith.science/pith/CYKCTY3F7FXACUSF4IFLLU2G5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CYKCTY3F7FXACUSF4IFLLU2G5P/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:23:47Z","links":{"resolver":"https://pith.science/pith/CYKCTY3F7FXACUSF4IFLLU2G5P","bundle":"https://pith.science/pith/CYKCTY3F7FXACUSF4IFLLU2G5P/bundle.json","state":"https://pith.science/pith/CYKCTY3F7FXACUSF4IFLLU2G5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CYKCTY3F7FXACUSF4IFLLU2G5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CYKCTY3F7FXACUSF4IFLLU2G5P","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":"caf12557241337f8b40ac714a43643caba9ca073d7c9016db462c9b2a5feb0b0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-20T08:03:39Z","title_canon_sha256":"06535f184f551c8d7f586ad3ef1552122e6cd58a61b1cf0367134930f80646dc"},"schema_version":"1.0","source":{"id":"1601.05193","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05193","created_at":"2026-05-18T01:22:15Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05193v1","created_at":"2026-05-18T01:22:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05193","created_at":"2026-05-18T01:22:15Z"},{"alias_kind":"pith_short_12","alias_value":"CYKCTY3F7FXA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CYKCTY3F7FXACUSF","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CYKCTY3F","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:d380eab62e75277d6f53a03dad7a67ff2f5eccd63c190393c1855970fab99424","target":"graph","created_at":"2026-05-18T01:22:15Z","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 propose systematic block Markov superposition transmission of repetition~(BMST-R) codes, which can support a wide range of code rates but maintain essentially the same encoding/decoding hardware structure. The systematic BMST-R codes resemble the classical rate-compatible punctured convolutional~(RCPC) codes, except that they are typically non-decodable by the Viterbi algorithm due to the huge constraint length induced by the block-oriented encoding process. The information sequence is partitioned equally into blocks and transmitted directly, while their replicas are interlea","authors_text":"Baoming Bai, Kechao Huang, Xiao Ma","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-20T08:03:39Z","title":"Systematic Block Markov Superposition Transmission of Repetition Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05193","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:b6b47fc27c4214d1a232fbf479df733f47efde92390ad743ead448e9a0b7af1c","target":"record","created_at":"2026-05-18T01:22:15Z","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":"caf12557241337f8b40ac714a43643caba9ca073d7c9016db462c9b2a5feb0b0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-20T08:03:39Z","title_canon_sha256":"06535f184f551c8d7f586ad3ef1552122e6cd58a61b1cf0367134930f80646dc"},"schema_version":"1.0","source":{"id":"1601.05193","kind":"arxiv","version":1}},"canonical_sha256":"161429e365f96e015245e20ab5d346ebeeec9b54236de40efc333c51ca4f8343","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"161429e365f96e015245e20ab5d346ebeeec9b54236de40efc333c51ca4f8343","first_computed_at":"2026-05-18T01:22:15.878789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:15.878789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H+VYjmzKpgnf03D9d6mNeE2tsVWcLB1pncjCxlQ/SkiBhtjPfCNT//7I5VmOdqi8S/Ca6oYpcHazzJFSbJK0Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:15.879500Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05193","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6b47fc27c4214d1a232fbf479df733f47efde92390ad743ead448e9a0b7af1c","sha256:d380eab62e75277d6f53a03dad7a67ff2f5eccd63c190393c1855970fab99424"],"state_sha256":"d787de18f052ac5118f01fddab02ac8c3d89f3ed6af4bb3d2eaf79683ac069c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SzU3il3h5QsPcaLcXNGwL0ts7CAv/GfV2XREoU3NqqbHLDFD7C0EOZInjnkO5+6X7Y6eWU/sWFukRGAIgXDUAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:23:47.817337Z","bundle_sha256":"d81b4a231d0e90bb868c07d05a928055d361e27a81c5cf829e145e6de71ae5cc"}}