{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FZUO3CQZM4MQFD36REIPDEUWJQ","short_pith_number":"pith:FZUO3CQZ","schema_version":"1.0","canonical_sha256":"2e68ed8a196719028f7e8910f192964c2559cad70d57f16122b88cd677506b15","source":{"kind":"arxiv","id":"2602.12800","version":3},"attestation_state":"computed","paper":{"title":"Concatenated Codes for Short-Molecule DNA Storage with Sequencing Channels of Positive Zero-Undetected-Error Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Albert Guill\\'en i F\\`abregas, Nir Weinberger, Ran Tamir","submitted_at":"2026-02-13T10:33:19Z","abstract_excerpt":"We study the amount of reliable information that can be stored in a DNA-based storage system with noisy sequencing, where each codeword is composed of short DNA molecules. We analyze a concatenated coding scheme, where the outer code is designed to handle the random sampling, while the inner code is designed to handle the random sequencing noise. We assume that the sequencing channel is symmetric and choose the inner coding scheme to be composed by a linear block code and a zero-undetected-error decoder. As a byproduct, the resulting optimal maximum-likelihood decoder land itself for an amenab"},"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":"2602.12800","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-02-13T10:33:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f30df76de290bfd79e6836ffc93cb62ca6d42892671fb4918812816f378e4c7b","abstract_canon_sha256":"793e10a2c93fb5578bdb93e178a18bf95cf0ac5ca5c70ee90585335f7d69fc3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:25.412940Z","signature_b64":"WXKkHCs800QtqgcPuuK8fWVWnIs+Z26cq7TjVAlvk2pZ5Xu8mkA/COSwio5Z2egn2Cr6JLky45rSFI3dn4fpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e68ed8a196719028f7e8910f192964c2559cad70d57f16122b88cd677506b15","last_reissued_at":"2026-05-20T00:04:25.411973Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:25.411973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concatenated Codes for Short-Molecule DNA Storage with Sequencing Channels of Positive Zero-Undetected-Error Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Albert Guill\\'en i F\\`abregas, Nir Weinberger, Ran Tamir","submitted_at":"2026-02-13T10:33:19Z","abstract_excerpt":"We study the amount of reliable information that can be stored in a DNA-based storage system with noisy sequencing, where each codeword is composed of short DNA molecules. We analyze a concatenated coding scheme, where the outer code is designed to handle the random sampling, while the inner code is designed to handle the random sequencing noise. We assume that the sequencing channel is symmetric and choose the inner coding scheme to be composed by a linear block code and a zero-undetected-error decoder. As a byproduct, the resulting optimal maximum-likelihood decoder land itself for an amenab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.12800","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/2602.12800/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":"2602.12800","created_at":"2026-05-20T00:04:25.412103+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.12800v3","created_at":"2026-05-20T00:04:25.412103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.12800","created_at":"2026-05-20T00:04:25.412103+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZUO3CQZM4MQ","created_at":"2026-05-20T00:04:25.412103+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZUO3CQZM4MQFD36","created_at":"2026-05-20T00:04:25.412103+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZUO3CQZ","created_at":"2026-05-20T00:04:25.412103+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/FZUO3CQZM4MQFD36REIPDEUWJQ","json":"https://pith.science/pith/FZUO3CQZM4MQFD36REIPDEUWJQ.json","graph_json":"https://pith.science/api/pith-number/FZUO3CQZM4MQFD36REIPDEUWJQ/graph.json","events_json":"https://pith.science/api/pith-number/FZUO3CQZM4MQFD36REIPDEUWJQ/events.json","paper":"https://pith.science/paper/FZUO3CQZ"},"agent_actions":{"view_html":"https://pith.science/pith/FZUO3CQZM4MQFD36REIPDEUWJQ","download_json":"https://pith.science/pith/FZUO3CQZM4MQFD36REIPDEUWJQ.json","view_paper":"https://pith.science/paper/FZUO3CQZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.12800&json=true","fetch_graph":"https://pith.science/api/pith-number/FZUO3CQZM4MQFD36REIPDEUWJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FZUO3CQZM4MQFD36REIPDEUWJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZUO3CQZM4MQFD36REIPDEUWJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZUO3CQZM4MQFD36REIPDEUWJQ/action/storage_attestation","attest_author":"https://pith.science/pith/FZUO3CQZM4MQFD36REIPDEUWJQ/action/author_attestation","sign_citation":"https://pith.science/pith/FZUO3CQZM4MQFD36REIPDEUWJQ/action/citation_signature","submit_replication":"https://pith.science/pith/FZUO3CQZM4MQFD36REIPDEUWJQ/action/replication_record"}},"created_at":"2026-05-20T00:04:25.412103+00:00","updated_at":"2026-05-20T00:04:25.412103+00:00"}