{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BKTJSEHIDRA5DKJFGIV3WWAEZ6","short_pith_number":"pith:BKTJSEHI","schema_version":"1.0","canonical_sha256":"0aa69910e81c41d1a925322bbb5804cf8fa9210f9a7a159c62a57c1ef74b9079","source":{"kind":"arxiv","id":"2111.14452","version":3},"attestation_state":"computed","paper":{"title":"Concatenated Codes for Multiple Reads of a DNA Sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Andreas Lenz, Antonia Wachter-Zeh, Eirik Rosnes, Issam Maarouf, Lorenz Welter","submitted_at":"2021-11-29T11:07:14Z","abstract_excerpt":"Decoding sequences that stem from multiple transmissions of a codeword over an insertion, deletion, and substitution channel is a critical component of efficient deoxyribonucleic acid (DNA) data storage systems. In this paper, we consider a concatenated coding scheme with an outer nonbinary low-density parity-check code or a polar code and either an inner convolutional code or a time-varying block code. We propose two novel decoding algorithms for inference from multiple received sequences, both combining the inner code and channel to a joint hidden Markov model to infer symbolwise a posterior"},"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":"2111.14452","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-11-29T11:07:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"36ae27be45dd0b34af4b506ea2ef670a998d1b0e5a32bf583b57384b4b36d415","abstract_canon_sha256":"09832825e3358fe7626d257740b9f5ece8beceaee0c7515b1f674fed6420c7fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:56:13.253782Z","signature_b64":"xdcBwZUdxJcCw+nf13RO12JB6UMm8JtwuGXUIyEywLVgYjI/GY1WLTtayPQuxgNKg79SmLyem19ZOcBA053jDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0aa69910e81c41d1a925322bbb5804cf8fa9210f9a7a159c62a57c1ef74b9079","last_reissued_at":"2026-07-05T04:56:13.253303Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:56:13.253303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concatenated Codes for Multiple Reads of a DNA Sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Andreas Lenz, Antonia Wachter-Zeh, Eirik Rosnes, Issam Maarouf, Lorenz Welter","submitted_at":"2021-11-29T11:07:14Z","abstract_excerpt":"Decoding sequences that stem from multiple transmissions of a codeword over an insertion, deletion, and substitution channel is a critical component of efficient deoxyribonucleic acid (DNA) data storage systems. In this paper, we consider a concatenated coding scheme with an outer nonbinary low-density parity-check code or a polar code and either an inner convolutional code or a time-varying block code. We propose two novel decoding algorithms for inference from multiple received sequences, both combining the inner code and channel to a joint hidden Markov model to infer symbolwise a posterior"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.14452","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.14452/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2111.14452","created_at":"2026-07-05T04:56:13.253369+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.14452v3","created_at":"2026-07-05T04:56:13.253369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.14452","created_at":"2026-07-05T04:56:13.253369+00:00"},{"alias_kind":"pith_short_12","alias_value":"BKTJSEHIDRA5","created_at":"2026-07-05T04:56:13.253369+00:00"},{"alias_kind":"pith_short_16","alias_value":"BKTJSEHIDRA5DKJF","created_at":"2026-07-05T04:56:13.253369+00:00"},{"alias_kind":"pith_short_8","alias_value":"BKTJSEHI","created_at":"2026-07-05T04:56:13.253369+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28802","citing_title":"Salami Slicing Trellis for Synchronization Errors in DNA Coding","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BKTJSEHIDRA5DKJFGIV3WWAEZ6","json":"https://pith.science/pith/BKTJSEHIDRA5DKJFGIV3WWAEZ6.json","graph_json":"https://pith.science/api/pith-number/BKTJSEHIDRA5DKJFGIV3WWAEZ6/graph.json","events_json":"https://pith.science/api/pith-number/BKTJSEHIDRA5DKJFGIV3WWAEZ6/events.json","paper":"https://pith.science/paper/BKTJSEHI"},"agent_actions":{"view_html":"https://pith.science/pith/BKTJSEHIDRA5DKJFGIV3WWAEZ6","download_json":"https://pith.science/pith/BKTJSEHIDRA5DKJFGIV3WWAEZ6.json","view_paper":"https://pith.science/paper/BKTJSEHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.14452&json=true","fetch_graph":"https://pith.science/api/pith-number/BKTJSEHIDRA5DKJFGIV3WWAEZ6/graph.json","fetch_events":"https://pith.science/api/pith-number/BKTJSEHIDRA5DKJFGIV3WWAEZ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BKTJSEHIDRA5DKJFGIV3WWAEZ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BKTJSEHIDRA5DKJFGIV3WWAEZ6/action/storage_attestation","attest_author":"https://pith.science/pith/BKTJSEHIDRA5DKJFGIV3WWAEZ6/action/author_attestation","sign_citation":"https://pith.science/pith/BKTJSEHIDRA5DKJFGIV3WWAEZ6/action/citation_signature","submit_replication":"https://pith.science/pith/BKTJSEHIDRA5DKJFGIV3WWAEZ6/action/replication_record"}},"created_at":"2026-07-05T04:56:13.253369+00:00","updated_at":"2026-07-05T04:56:13.253369+00:00"}