{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IKBWLJRFMTMG5544KT3GMMYDI4","short_pith_number":"pith:IKBWLJRF","canonical_record":{"source":{"id":"1708.06081","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-21T05:43:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f0eb332130a2ce0d54cc1086e69fa4a1a369e7b5e46c8bcd70898991a7ee830d","abstract_canon_sha256":"bbdb35387ba453801067673c985ab487e82cb9992e0800eb3197adfaf18e7c3e"},"schema_version":"1.0"},"canonical_sha256":"428365a62564d86ef79c54f666330347272ce7ac3bdb8315cb8453ce675df3b2","source":{"kind":"arxiv","id":"1708.06081","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06081","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06081v1","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06081","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"IKBWLJRFMTMG","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IKBWLJRFMTMG5544","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IKBWLJRF","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IKBWLJRFMTMG5544KT3GMMYDI4","target":"record","payload":{"canonical_record":{"source":{"id":"1708.06081","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-21T05:43:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f0eb332130a2ce0d54cc1086e69fa4a1a369e7b5e46c8bcd70898991a7ee830d","abstract_canon_sha256":"bbdb35387ba453801067673c985ab487e82cb9992e0800eb3197adfaf18e7c3e"},"schema_version":"1.0"},"canonical_sha256":"428365a62564d86ef79c54f666330347272ce7ac3bdb8315cb8453ce675df3b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:43.306186Z","signature_b64":"MVOIHHe9LKUg8srmjYZ4j/T1PTmXM6V34Wb+cXlvQvKWltPY/cLwHdM4ObMG+C3S2PUTGNPNhS14yYqeBqlcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"428365a62564d86ef79c54f666330347272ce7ac3bdb8315cb8453ce675df3b2","last_reissued_at":"2026-05-18T00:37:43.305489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:43.305489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.06081","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:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OYCOmqX6/aUx4FZu2shWCfIRxLxLBCIiNnZTRrSdvNF1sKkplE7rxlhiawIqtnt6YR3l7odxCDEURW0KV2hLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:22:43.731215Z"},"content_sha256":"9a716c1d9356f3ff54585cc1e5dd3b73b3d7280e34de025e5508581eda4fdbbc","schema_version":"1.0","event_id":"sha256:9a716c1d9356f3ff54585cc1e5dd3b73b3d7280e34de025e5508581eda4fdbbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IKBWLJRFMTMG5544KT3GMMYDI4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Block Markov Superposition Transmission of BCH Codes with Iterative Erasures-and-Errors Decoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nina Lin, Suihua Cai, Xiao Ma","submitted_at":"2017-08-21T05:43:41Z","abstract_excerpt":"In this paper, we present the block Markov superposition transmission of BCH (BMST-BCH) codes, which can be constructed to obtain a very low error floor. To reduce the implementation complexity, we design a low complexity iterative sliding-window decoding algorithm, in which only binary and/or erasure messages are processed and exchanged between processing units. The error floor can be predicted by a genie-aided lower bound, while the waterfall performance can be analyzed by the density evolution method. To evaluate the error floor of the constructed BMST-BCH codes at a very low bit error rate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06081","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:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GUotF1KoCj6D5WDFddzmjbX5RAdMlIxP3pIJJ5TGDcW3O3NT9YufhN/8jiEmhFMQhSGBsAHEDpI1s8nzRnmOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:22:43.731606Z"},"content_sha256":"6a68f76738ba694539eb0f42021c6c5744aff652ad80563b432cc630001fe3c6","schema_version":"1.0","event_id":"sha256:6a68f76738ba694539eb0f42021c6c5744aff652ad80563b432cc630001fe3c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IKBWLJRFMTMG5544KT3GMMYDI4/bundle.json","state_url":"https://pith.science/pith/IKBWLJRFMTMG5544KT3GMMYDI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IKBWLJRFMTMG5544KT3GMMYDI4/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-23T12:22:43Z","links":{"resolver":"https://pith.science/pith/IKBWLJRFMTMG5544KT3GMMYDI4","bundle":"https://pith.science/pith/IKBWLJRFMTMG5544KT3GMMYDI4/bundle.json","state":"https://pith.science/pith/IKBWLJRFMTMG5544KT3GMMYDI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IKBWLJRFMTMG5544KT3GMMYDI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IKBWLJRFMTMG5544KT3GMMYDI4","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":"bbdb35387ba453801067673c985ab487e82cb9992e0800eb3197adfaf18e7c3e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-21T05:43:41Z","title_canon_sha256":"f0eb332130a2ce0d54cc1086e69fa4a1a369e7b5e46c8bcd70898991a7ee830d"},"schema_version":"1.0","source":{"id":"1708.06081","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06081","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06081v1","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06081","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"IKBWLJRFMTMG","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IKBWLJRFMTMG5544","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IKBWLJRF","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:6a68f76738ba694539eb0f42021c6c5744aff652ad80563b432cc630001fe3c6","target":"graph","created_at":"2026-05-18T00:37:43Z","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 present the block Markov superposition transmission of BCH (BMST-BCH) codes, which can be constructed to obtain a very low error floor. To reduce the implementation complexity, we design a low complexity iterative sliding-window decoding algorithm, in which only binary and/or erasure messages are processed and exchanged between processing units. The error floor can be predicted by a genie-aided lower bound, while the waterfall performance can be analyzed by the density evolution method. To evaluate the error floor of the constructed BMST-BCH codes at a very low bit error rate","authors_text":"Nina Lin, Suihua Cai, Xiao Ma","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-21T05:43:41Z","title":"Block Markov Superposition Transmission of BCH Codes with Iterative Erasures-and-Errors Decoders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06081","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:9a716c1d9356f3ff54585cc1e5dd3b73b3d7280e34de025e5508581eda4fdbbc","target":"record","created_at":"2026-05-18T00:37:43Z","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":"bbdb35387ba453801067673c985ab487e82cb9992e0800eb3197adfaf18e7c3e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-21T05:43:41Z","title_canon_sha256":"f0eb332130a2ce0d54cc1086e69fa4a1a369e7b5e46c8bcd70898991a7ee830d"},"schema_version":"1.0","source":{"id":"1708.06081","kind":"arxiv","version":1}},"canonical_sha256":"428365a62564d86ef79c54f666330347272ce7ac3bdb8315cb8453ce675df3b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"428365a62564d86ef79c54f666330347272ce7ac3bdb8315cb8453ce675df3b2","first_computed_at":"2026-05-18T00:37:43.305489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:43.305489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MVOIHHe9LKUg8srmjYZ4j/T1PTmXM6V34Wb+cXlvQvKWltPY/cLwHdM4ObMG+C3S2PUTGNPNhS14yYqeBqlcDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:43.306186Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06081","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a716c1d9356f3ff54585cc1e5dd3b73b3d7280e34de025e5508581eda4fdbbc","sha256:6a68f76738ba694539eb0f42021c6c5744aff652ad80563b432cc630001fe3c6"],"state_sha256":"f1a74be408933720e9cfc6f47839e2d5664660d26482e9c16b03766bdbd64b66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F1lecPnohsPzraU3teqC8VkGtFI7np+FhR7DGgv7BOW1G/MazZiHCn9JF35yn8j/OtVZI0J407MXg3WlFDpoAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:22:43.733711Z","bundle_sha256":"32f9cbdac241e4803dd80f1b35cf10cf218605d8609cfb5393d643d30c1c44ef"}}