{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:OMIIFX3GK6YT2KF4YDPUBMCOZX","short_pith_number":"pith:OMIIFX3G","canonical_record":{"source":{"id":"2107.06440","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-07-14T00:58:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a8b4ec0cd3b7595d486de5765c81e4c0d23bcc656fde16f70e9bb4e06cebd0c8","abstract_canon_sha256":"7c18099da28cf6c3269607d27d0aba0d6248000c5b94225007967e92c8c2c562"},"schema_version":"1.0"},"canonical_sha256":"731082df6657b13d28bcc0df40b04ecddeebda8958e2409172618ad57b6d804d","source":{"kind":"arxiv","id":"2107.06440","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.06440","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"arxiv_version","alias_value":"2107.06440v2","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.06440","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"pith_short_12","alias_value":"OMIIFX3GK6YT","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"pith_short_16","alias_value":"OMIIFX3GK6YT2KF4","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"pith_short_8","alias_value":"OMIIFX3G","created_at":"2026-07-05T08:57:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:OMIIFX3GK6YT2KF4YDPUBMCOZX","target":"record","payload":{"canonical_record":{"source":{"id":"2107.06440","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-07-14T00:58:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a8b4ec0cd3b7595d486de5765c81e4c0d23bcc656fde16f70e9bb4e06cebd0c8","abstract_canon_sha256":"7c18099da28cf6c3269607d27d0aba0d6248000c5b94225007967e92c8c2c562"},"schema_version":"1.0"},"canonical_sha256":"731082df6657b13d28bcc0df40b04ecddeebda8958e2409172618ad57b6d804d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:57:22.034885Z","signature_b64":"g0hbQenRgIxl4qeyxeu2DgfPHYsZINVcKNeAZJTIopYfNP9LxKTGzv4yc+dCgq6vytHvdlohSGuHGoLljgXQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"731082df6657b13d28bcc0df40b04ecddeebda8958e2409172618ad57b6d804d","last_reissued_at":"2026-07-05T08:57:22.034473Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:57:22.034473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.06440","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-07-05T08:57:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mQt7bnlAS/N2DY9SzCEAwfYDIdnFA2eB0PhHym8/2BFa0MHeugJH6kzv+53pQV8kars3xjrHTmgbhTDf4cuAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T16:27:28.204907Z"},"content_sha256":"d87a42d0d6c0075b48f435f99799958f99ddea94bb55008bfc766a9699bd9eb9","schema_version":"1.0","event_id":"sha256:d87a42d0d6c0075b48f435f99799958f99ddea94bb55008bfc766a9699bd9eb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:OMIIFX3GK6YT2KF4YDPUBMCOZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Henry D. Pfister, Sergey Yekhanin, Sivakanth Gopi, Sundara Rajan Srinivasavaradhan","submitted_at":"2021-07-14T00:58:26Z","abstract_excerpt":"Sequencing a DNA strand, as part of the read process in DNA storage, produces multiple noisy copies which can be combined to produce better estimates of the original strand; this is called trace reconstruction. One can reduce the error rate further by introducing redundancy in the write sequence and this is called coded trace reconstruction. In this paper, we model the DNA storage channel as an insertion-deletion-substitution (IDS) channel and design both encoding schemes and low-complexity decoding algorithms for coded trace reconstruction.\n  We introduce Trellis BMA, a new reconstruction alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.06440","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.06440/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"},"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-07-05T08:57:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kz10gXqGF9GYryWXPqdGZ2F0mFDbY6S2KHZFzz7Adr2MD8v7K5EZ5Nmi7je6s2CUXexjcVqcaliwwGajHr19AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T16:27:28.205234Z"},"content_sha256":"71acbbafab47552b973e8d7156d803a6c7109b56ed21aded187a63dca0b5e5dd","schema_version":"1.0","event_id":"sha256:71acbbafab47552b973e8d7156d803a6c7109b56ed21aded187a63dca0b5e5dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OMIIFX3GK6YT2KF4YDPUBMCOZX/bundle.json","state_url":"https://pith.science/pith/OMIIFX3GK6YT2KF4YDPUBMCOZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OMIIFX3GK6YT2KF4YDPUBMCOZX/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-07-31T16:27:28Z","links":{"resolver":"https://pith.science/pith/OMIIFX3GK6YT2KF4YDPUBMCOZX","bundle":"https://pith.science/pith/OMIIFX3GK6YT2KF4YDPUBMCOZX/bundle.json","state":"https://pith.science/pith/OMIIFX3GK6YT2KF4YDPUBMCOZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OMIIFX3GK6YT2KF4YDPUBMCOZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:OMIIFX3GK6YT2KF4YDPUBMCOZX","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":"7c18099da28cf6c3269607d27d0aba0d6248000c5b94225007967e92c8c2c562","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-07-14T00:58:26Z","title_canon_sha256":"a8b4ec0cd3b7595d486de5765c81e4c0d23bcc656fde16f70e9bb4e06cebd0c8"},"schema_version":"1.0","source":{"id":"2107.06440","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.06440","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"arxiv_version","alias_value":"2107.06440v2","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.06440","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"pith_short_12","alias_value":"OMIIFX3GK6YT","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"pith_short_16","alias_value":"OMIIFX3GK6YT2KF4","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"pith_short_8","alias_value":"OMIIFX3G","created_at":"2026-07-05T08:57:22Z"}],"graph_snapshots":[{"event_id":"sha256:71acbbafab47552b973e8d7156d803a6c7109b56ed21aded187a63dca0b5e5dd","target":"graph","created_at":"2026-07-05T08:57:22Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2107.06440/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sequencing a DNA strand, as part of the read process in DNA storage, produces multiple noisy copies which can be combined to produce better estimates of the original strand; this is called trace reconstruction. One can reduce the error rate further by introducing redundancy in the write sequence and this is called coded trace reconstruction. In this paper, we model the DNA storage channel as an insertion-deletion-substitution (IDS) channel and design both encoding schemes and low-complexity decoding algorithms for coded trace reconstruction.\n  We introduce Trellis BMA, a new reconstruction alg","authors_text":"Henry D. Pfister, Sergey Yekhanin, Sivakanth Gopi, Sundara Rajan Srinivasavaradhan","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-07-14T00:58:26Z","title":"Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.06440","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:d87a42d0d6c0075b48f435f99799958f99ddea94bb55008bfc766a9699bd9eb9","target":"record","created_at":"2026-07-05T08:57:22Z","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":"7c18099da28cf6c3269607d27d0aba0d6248000c5b94225007967e92c8c2c562","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-07-14T00:58:26Z","title_canon_sha256":"a8b4ec0cd3b7595d486de5765c81e4c0d23bcc656fde16f70e9bb4e06cebd0c8"},"schema_version":"1.0","source":{"id":"2107.06440","kind":"arxiv","version":2}},"canonical_sha256":"731082df6657b13d28bcc0df40b04ecddeebda8958e2409172618ad57b6d804d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"731082df6657b13d28bcc0df40b04ecddeebda8958e2409172618ad57b6d804d","first_computed_at":"2026-07-05T08:57:22.034473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:57:22.034473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g0hbQenRgIxl4qeyxeu2DgfPHYsZINVcKNeAZJTIopYfNP9LxKTGzv4yc+dCgq6vytHvdlohSGuHGoLljgXQAg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:57:22.034885Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.06440","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d87a42d0d6c0075b48f435f99799958f99ddea94bb55008bfc766a9699bd9eb9","sha256:71acbbafab47552b973e8d7156d803a6c7109b56ed21aded187a63dca0b5e5dd"],"state_sha256":"47c51ba4492e7e5f1df894989ce282d9671f1377cabd4679ae487f4d1b7775fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8HwDi5Qn4ABctlscevEhd7FlXyNFgkH78e51fV3yuV10ZPoIhD6icjg5Jo+7m/oJULXkgCpiWqXm/GxBK1/7Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T16:27:28.208460Z","bundle_sha256":"06921cbe9ef591516df1b356d259f829978362650f2e4efeb4021ca9b37ea9c5"}}