{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7MB4WOMZZE7M2HJJGCPLP4SA7Y","short_pith_number":"pith:7MB4WOMZ","schema_version":"1.0","canonical_sha256":"fb03cb3999c93ecd1d29309eb7f240fe017027d96c0bafe16df4fc3cd37754de","source":{"kind":"arxiv","id":"1902.09808","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.09808","created_at":"2026-05-17T23:52:35.309281+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.09808v1","created_at":"2026-05-17T23:52:35.309281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09808","created_at":"2026-05-17T23:52:35.309281+00:00"},{"alias_kind":"pith_short_12","alias_value":"7MB4WOMZZE7M","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7MB4WOMZZE7M2HJJ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7MB4WOMZ","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7MB4WOMZZE7M2HJJGCPLP4SA7Y","json":"https://pith.science/pith/7MB4WOMZZE7M2HJJGCPLP4SA7Y.json","graph_json":"https://pith.science/api/pith-number/7MB4WOMZZE7M2HJJGCPLP4SA7Y/graph.json","events_json":"https://pith.science/api/pith-number/7MB4WOMZZE7M2HJJGCPLP4SA7Y/events.json","paper":"https://pith.science/paper/7MB4WOMZ"},"agent_actions":{"view_html":"https://pith.science/pith/7MB4WOMZZE7M2HJJGCPLP4SA7Y","download_json":"https://pith.science/pith/7MB4WOMZZE7M2HJJGCPLP4SA7Y.json","view_paper":"https://pith.science/paper/7MB4WOMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.09808&json=true","fetch_graph":"https://pith.science/api/pith-number/7MB4WOMZZE7M2HJJGCPLP4SA7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/7MB4WOMZZE7M2HJJGCPLP4SA7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7MB4WOMZZE7M2HJJGCPLP4SA7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7MB4WOMZZE7M2HJJGCPLP4SA7Y/action/storage_attestation","attest_author":"https://pith.science/pith/7MB4WOMZZE7M2HJJGCPLP4SA7Y/action/author_attestation","sign_citation":"https://pith.science/pith/7MB4WOMZZE7M2HJJGCPLP4SA7Y/action/citation_signature","submit_replication":"https://pith.science/pith/7MB4WOMZZE7M2HJJGCPLP4SA7Y/action/replication_record"}},"created_at":"2026-05-17T23:52:35.309281+00:00","updated_at":"2026-05-17T23:52:35.309281+00:00"}