{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:D7V6XHTBL2FKOIEACCU5ZSFVUI","short_pith_number":"pith:D7V6XHTB","schema_version":"1.0","canonical_sha256":"1febeb9e615e8aa7208010a9dcc8b5a2006ff680ed63c243e3ca1755f70b90ce","source":{"kind":"arxiv","id":"1410.8837","version":2},"attestation_state":"computed","paper":{"title":"Codes for DNA Storage Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Gregory J. Puleo, Han Mao Kiah, Olgica Milenkovic","submitted_at":"2014-10-31T18:26:39Z","abstract_excerpt":"We consider the problem of assembling a sequence based on a collection of its substrings observed through a noisy channel. The mathematical basis of the problem is the construction and design of sequences that may be discriminated based on a collection of their substrings observed through a noisy channel. We explain the connection between the sequence reconstruction problem and the problem of DNA synthesis and sequencing, and introduce the notion of a DNA storage channel. We analyze the number of sequence equivalence classes under the channel mapping and propose new asymmetric coding technique"},"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":"1410.8837","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-31T18:26:39Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"7b0979b04b6995d371941a1301cdd1b33ef22afa894123055e767e37e7869c1c","abstract_canon_sha256":"89ff72313b77320fc10c027b3fcc60b6801d92770c8c3174ad038ad501e7b8f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:05.765914Z","signature_b64":"iMAcMIszG8ujdx2girzdZGBvZ+ZMLJcm4U6LINIJA6JI/VkPGucTUW3CRPJEwM1JafgIcWOH5woqiyd3znCZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1febeb9e615e8aa7208010a9dcc8b5a2006ff680ed63c243e3ca1755f70b90ce","last_reissued_at":"2026-05-18T01:28:05.765062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:05.765062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Codes for DNA Storage Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Gregory J. Puleo, Han Mao Kiah, Olgica Milenkovic","submitted_at":"2014-10-31T18:26:39Z","abstract_excerpt":"We consider the problem of assembling a sequence based on a collection of its substrings observed through a noisy channel. The mathematical basis of the problem is the construction and design of sequences that may be discriminated based on a collection of their substrings observed through a noisy channel. We explain the connection between the sequence reconstruction problem and the problem of DNA synthesis and sequencing, and introduce the notion of a DNA storage channel. We analyze the number of sequence equivalence classes under the channel mapping and propose new asymmetric coding technique"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8837","kind":"arxiv","version":2},"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":"1410.8837","created_at":"2026-05-18T01:28:05.765196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.8837v2","created_at":"2026-05-18T01:28:05.765196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8837","created_at":"2026-05-18T01:28:05.765196+00:00"},{"alias_kind":"pith_short_12","alias_value":"D7V6XHTBL2FK","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"D7V6XHTBL2FKOIEA","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"D7V6XHTB","created_at":"2026-05-18T12:28:25.294606+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/D7V6XHTBL2FKOIEACCU5ZSFVUI","json":"https://pith.science/pith/D7V6XHTBL2FKOIEACCU5ZSFVUI.json","graph_json":"https://pith.science/api/pith-number/D7V6XHTBL2FKOIEACCU5ZSFVUI/graph.json","events_json":"https://pith.science/api/pith-number/D7V6XHTBL2FKOIEACCU5ZSFVUI/events.json","paper":"https://pith.science/paper/D7V6XHTB"},"agent_actions":{"view_html":"https://pith.science/pith/D7V6XHTBL2FKOIEACCU5ZSFVUI","download_json":"https://pith.science/pith/D7V6XHTBL2FKOIEACCU5ZSFVUI.json","view_paper":"https://pith.science/paper/D7V6XHTB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.8837&json=true","fetch_graph":"https://pith.science/api/pith-number/D7V6XHTBL2FKOIEACCU5ZSFVUI/graph.json","fetch_events":"https://pith.science/api/pith-number/D7V6XHTBL2FKOIEACCU5ZSFVUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D7V6XHTBL2FKOIEACCU5ZSFVUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D7V6XHTBL2FKOIEACCU5ZSFVUI/action/storage_attestation","attest_author":"https://pith.science/pith/D7V6XHTBL2FKOIEACCU5ZSFVUI/action/author_attestation","sign_citation":"https://pith.science/pith/D7V6XHTBL2FKOIEACCU5ZSFVUI/action/citation_signature","submit_replication":"https://pith.science/pith/D7V6XHTBL2FKOIEACCU5ZSFVUI/action/replication_record"}},"created_at":"2026-05-18T01:28:05.765196+00:00","updated_at":"2026-05-18T01:28:05.765196+00:00"}