{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:D7V6XHTBL2FKOIEACCU5ZSFVUI","short_pith_number":"pith:D7V6XHTB","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"},"canonical_sha256":"1febeb9e615e8aa7208010a9dcc8b5a2006ff680ed63c243e3ca1755f70b90ce","source":{"kind":"arxiv","id":"1410.8837","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8837","created_at":"2026-05-18T01:28:05Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8837v2","created_at":"2026-05-18T01:28:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8837","created_at":"2026-05-18T01:28:05Z"},{"alias_kind":"pith_short_12","alias_value":"D7V6XHTBL2FK","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"D7V6XHTBL2FKOIEA","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"D7V6XHTB","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:D7V6XHTBL2FKOIEACCU5ZSFVUI","target":"record","payload":{"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"},"canonical_sha256":"1febeb9e615e8aa7208010a9dcc8b5a2006ff680ed63c243e3ca1755f70b90ce","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"},"source_kind":"arxiv","source_id":"1410.8837","source_version":2,"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-18T01:28:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZivfOzcR2p/wc/Cghy2+GfHemGI9xohUbCS9ZyhnxS5bitVhMsT+oLm9AcdHr2EsByNzTfnTuJhYqH2DvS9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:27:40.195619Z"},"content_sha256":"875ecca8dad6f4cc9b1dfc365ab5d8d79c3e757c5fcd79c15e1b0a3c1709bc95","schema_version":"1.0","event_id":"sha256:875ecca8dad6f4cc9b1dfc365ab5d8d79c3e757c5fcd79c15e1b0a3c1709bc95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:D7V6XHTBL2FKOIEACCU5ZSFVUI","target":"graph","payload":{"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"},"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-18T01:28:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"08DKeUICUcJav4QpMDbjTF5SrSFd7P4lQ48STZwI5Bsx5dtaO/0DAc4HeLSkLh5/6uEUztH6qV7HDuSglGpLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:27:40.196022Z"},"content_sha256":"aebda9180ac7a92d2ce89239fa2569c38ceb8ae6d8a1609bae8f9dc2b5baa52b","schema_version":"1.0","event_id":"sha256:aebda9180ac7a92d2ce89239fa2569c38ceb8ae6d8a1609bae8f9dc2b5baa52b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D7V6XHTBL2FKOIEACCU5ZSFVUI/bundle.json","state_url":"https://pith.science/pith/D7V6XHTBL2FKOIEACCU5ZSFVUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D7V6XHTBL2FKOIEACCU5ZSFVUI/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-27T16:27:40Z","links":{"resolver":"https://pith.science/pith/D7V6XHTBL2FKOIEACCU5ZSFVUI","bundle":"https://pith.science/pith/D7V6XHTBL2FKOIEACCU5ZSFVUI/bundle.json","state":"https://pith.science/pith/D7V6XHTBL2FKOIEACCU5ZSFVUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D7V6XHTBL2FKOIEACCU5ZSFVUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:D7V6XHTBL2FKOIEACCU5ZSFVUI","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":"89ff72313b77320fc10c027b3fcc60b6801d92770c8c3174ad038ad501e7b8f6","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-31T18:26:39Z","title_canon_sha256":"7b0979b04b6995d371941a1301cdd1b33ef22afa894123055e767e37e7869c1c"},"schema_version":"1.0","source":{"id":"1410.8837","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8837","created_at":"2026-05-18T01:28:05Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8837v2","created_at":"2026-05-18T01:28:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8837","created_at":"2026-05-18T01:28:05Z"},{"alias_kind":"pith_short_12","alias_value":"D7V6XHTBL2FK","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"D7V6XHTBL2FKOIEA","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"D7V6XHTB","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:aebda9180ac7a92d2ce89239fa2569c38ceb8ae6d8a1609bae8f9dc2b5baa52b","target":"graph","created_at":"2026-05-18T01:28:05Z","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":"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","authors_text":"Gregory J. Puleo, Han Mao Kiah, Olgica Milenkovic","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-31T18:26:39Z","title":"Codes for DNA Storage Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8837","kind":"arxiv","version":2},"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:875ecca8dad6f4cc9b1dfc365ab5d8d79c3e757c5fcd79c15e1b0a3c1709bc95","target":"record","created_at":"2026-05-18T01:28:05Z","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":"89ff72313b77320fc10c027b3fcc60b6801d92770c8c3174ad038ad501e7b8f6","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-31T18:26:39Z","title_canon_sha256":"7b0979b04b6995d371941a1301cdd1b33ef22afa894123055e767e37e7869c1c"},"schema_version":"1.0","source":{"id":"1410.8837","kind":"arxiv","version":2}},"canonical_sha256":"1febeb9e615e8aa7208010a9dcc8b5a2006ff680ed63c243e3ca1755f70b90ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1febeb9e615e8aa7208010a9dcc8b5a2006ff680ed63c243e3ca1755f70b90ce","first_computed_at":"2026-05-18T01:28:05.765062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:05.765062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iMAcMIszG8ujdx2girzdZGBvZ+ZMLJcm4U6LINIJA6JI/VkPGucTUW3CRPJEwM1JafgIcWOH5woqiyd3znCZBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:05.765914Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.8837","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:875ecca8dad6f4cc9b1dfc365ab5d8d79c3e757c5fcd79c15e1b0a3c1709bc95","sha256:aebda9180ac7a92d2ce89239fa2569c38ceb8ae6d8a1609bae8f9dc2b5baa52b"],"state_sha256":"ebd7413735884371843f78966a5cf18231e9917724c251716abfe0355c84ccbc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FuYBWVAAhLG9/UmKF/C0b3vLzUdIVo5J85qgMlq8HOkrVsrPT8nyPt/Tk9ckxKEGCiwHHStJD/wXZ6nCVh46DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T16:27:40.197929Z","bundle_sha256":"b55c21b76ab4227eef071e646eaf06baf3fd956c5aafa03d123a5096705069a3"}}