{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7MB4WOMZZE7M2HJJGCPLP4SA7Y","short_pith_number":"pith:7MB4WOMZ","canonical_record":{"source":{"id":"1902.09808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-26T09:07:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"87d17e0237c7f065aecf3a5091708b889cec71d8fba2203ba8b575dedc7080ce","abstract_canon_sha256":"0d0a3c20a0a121185088785bd058f7b22540cd49466734da3c92d89ed5f495eb"},"schema_version":"1.0"},"canonical_sha256":"fb03cb3999c93ecd1d29309eb7f240fe017027d96c0bafe16df4fc3cd37754de","source":{"kind":"arxiv","id":"1902.09808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.09808","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"arxiv_version","alias_value":"1902.09808v1","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09808","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"pith_short_12","alias_value":"7MB4WOMZZE7M","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7MB4WOMZZE7M2HJJ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7MB4WOMZ","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7MB4WOMZZE7M2HJJGCPLP4SA7Y","target":"record","payload":{"canonical_record":{"source":{"id":"1902.09808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-26T09:07:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"87d17e0237c7f065aecf3a5091708b889cec71d8fba2203ba8b575dedc7080ce","abstract_canon_sha256":"0d0a3c20a0a121185088785bd058f7b22540cd49466734da3c92d89ed5f495eb"},"schema_version":"1.0"},"canonical_sha256":"fb03cb3999c93ecd1d29309eb7f240fe017027d96c0bafe16df4fc3cd37754de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:35.309694Z","signature_b64":"zkhkZPtLdFTXkOxOtA8hGnrv+heA5tvRssByn2/gIlRfVOhwDl0XfPPmPebbbQKRSi5eQ1CdnRpp2HQ0l5JXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb03cb3999c93ecd1d29309eb7f240fe017027d96c0bafe16df4fc3cd37754de","last_reissued_at":"2026-05-17T23:52:35.309210Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:35.309210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.09808","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-17T23:52:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sBVahlm/jzPoD51DVEZc03WtZzwLJZ7vdIKoSIWPxpv5AYevgr31Vz3KExwU9POm7ZhTdOwHuMouDpC0FxHXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:53:28.021476Z"},"content_sha256":"11409a275c645a267c4a553834bd5c5e5db78748e73fb476e9b722ec0795586f","schema_version":"1.0","event_id":"sha256:11409a275c645a267c4a553834bd5c5e5db78748e73fb476e9b722ec0795586f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7MB4WOMZZE7M2HJJGCPLP4SA7Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Statistical Learning Aided Decoding of BMST of Tail-Biting Convolutional Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baodian Wei, Suihua Cai, Wenchao Lin, Xiao Ma","submitted_at":"2019-02-26T09:07:35Z","abstract_excerpt":"This paper is concerned with block Markov superposition transmission (BMST) of tail-biting convolutional code (TBCC). We propose a new decoding algorithm for BMST-TBCC, which integrates a serial list Viterbi algorithm (SLVA) with a soft check instead of conventional cyclic redundancy check (CRC). The basic idea is that, compared with an erroneous candidate codeword, the correct candidate codeword for the first sub-frame has less influence on the output of Viterbi algorithm for the second sub-frame. The threshold is then determined by statistical learning based on the introduced empirical diver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09808","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-17T23:52:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LhToSm4V5D4iS8vZhHRkX0YaCQ+loJDSQ/dh5IZYTtn9FeEM2E9t2bv9lNuAy7x7R5e+K/v7hIkqiRLrpgSzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:53:28.021818Z"},"content_sha256":"dbb5b47bbc02966d3887ee221723a2e5782408b3be9c318418bf99ce0c49b126","schema_version":"1.0","event_id":"sha256:dbb5b47bbc02966d3887ee221723a2e5782408b3be9c318418bf99ce0c49b126"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7MB4WOMZZE7M2HJJGCPLP4SA7Y/bundle.json","state_url":"https://pith.science/pith/7MB4WOMZZE7M2HJJGCPLP4SA7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7MB4WOMZZE7M2HJJGCPLP4SA7Y/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-23T16:53:28Z","links":{"resolver":"https://pith.science/pith/7MB4WOMZZE7M2HJJGCPLP4SA7Y","bundle":"https://pith.science/pith/7MB4WOMZZE7M2HJJGCPLP4SA7Y/bundle.json","state":"https://pith.science/pith/7MB4WOMZZE7M2HJJGCPLP4SA7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7MB4WOMZZE7M2HJJGCPLP4SA7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7MB4WOMZZE7M2HJJGCPLP4SA7Y","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":"0d0a3c20a0a121185088785bd058f7b22540cd49466734da3c92d89ed5f495eb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-26T09:07:35Z","title_canon_sha256":"87d17e0237c7f065aecf3a5091708b889cec71d8fba2203ba8b575dedc7080ce"},"schema_version":"1.0","source":{"id":"1902.09808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.09808","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"arxiv_version","alias_value":"1902.09808v1","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09808","created_at":"2026-05-17T23:52:35Z"},{"alias_kind":"pith_short_12","alias_value":"7MB4WOMZZE7M","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7MB4WOMZZE7M2HJJ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7MB4WOMZ","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:dbb5b47bbc02966d3887ee221723a2e5782408b3be9c318418bf99ce0c49b126","target":"graph","created_at":"2026-05-17T23:52:35Z","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":"This paper is concerned with block Markov superposition transmission (BMST) of tail-biting convolutional code (TBCC). We propose a new decoding algorithm for BMST-TBCC, which integrates a serial list Viterbi algorithm (SLVA) with a soft check instead of conventional cyclic redundancy check (CRC). The basic idea is that, compared with an erroneous candidate codeword, the correct candidate codeword for the first sub-frame has less influence on the output of Viterbi algorithm for the second sub-frame. The threshold is then determined by statistical learning based on the introduced empirical diver","authors_text":"Baodian Wei, Suihua Cai, Wenchao Lin, Xiao Ma","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-26T09:07:35Z","title":"Statistical Learning Aided Decoding of BMST of Tail-Biting Convolutional Code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09808","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:11409a275c645a267c4a553834bd5c5e5db78748e73fb476e9b722ec0795586f","target":"record","created_at":"2026-05-17T23:52:35Z","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":"0d0a3c20a0a121185088785bd058f7b22540cd49466734da3c92d89ed5f495eb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-26T09:07:35Z","title_canon_sha256":"87d17e0237c7f065aecf3a5091708b889cec71d8fba2203ba8b575dedc7080ce"},"schema_version":"1.0","source":{"id":"1902.09808","kind":"arxiv","version":1}},"canonical_sha256":"fb03cb3999c93ecd1d29309eb7f240fe017027d96c0bafe16df4fc3cd37754de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb03cb3999c93ecd1d29309eb7f240fe017027d96c0bafe16df4fc3cd37754de","first_computed_at":"2026-05-17T23:52:35.309210Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:35.309210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zkhkZPtLdFTXkOxOtA8hGnrv+heA5tvRssByn2/gIlRfVOhwDl0XfPPmPebbbQKRSi5eQ1CdnRpp2HQ0l5JXAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:35.309694Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.09808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11409a275c645a267c4a553834bd5c5e5db78748e73fb476e9b722ec0795586f","sha256:dbb5b47bbc02966d3887ee221723a2e5782408b3be9c318418bf99ce0c49b126"],"state_sha256":"f3d295f07035f0dfa2ddf0abf8278b10419680c5b2a6d55f3c52b95346d6086f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pVWhdYpiXG+JNrDxYw8kSw1TfxYIPXJKHEIW2Q7by3gKKLvAIwxX61dJmER6q4iPNU7kxPX1ucyLGIAH2OxuAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:53:28.023653Z","bundle_sha256":"8f474cf070a56686ad6cc60cc625a4c9a7229a16472f6f12a5ef85c61d803181"}}