{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ALTCACEZX6X7Y6TLU24RL6G2GD","short_pith_number":"pith:ALTCACEZ","canonical_record":{"source":{"id":"1801.04882","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-15T17:31:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bd4931d11021f646bd8c5d070e7d3d802c7e98f0c1b365a850d8383512c62b14","abstract_canon_sha256":"3d2ad2ddea91193c0e81f6c5972c86e0a9996c3b93025b10f6f1cd2ad354ca13"},"schema_version":"1.0"},"canonical_sha256":"02e6200899bfaffc7a6ba6b915f8da30d08f1e094fbaaa1077164a9a6b09a919","source":{"kind":"arxiv","id":"1801.04882","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04882","created_at":"2026-05-18T00:16:21Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04882v3","created_at":"2026-05-18T00:16:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04882","created_at":"2026-05-18T00:16:21Z"},{"alias_kind":"pith_short_12","alias_value":"ALTCACEZX6X7","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ALTCACEZX6X7Y6TL","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ALTCACEZ","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ALTCACEZX6X7Y6TLU24RL6G2GD","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04882","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-15T17:31:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bd4931d11021f646bd8c5d070e7d3d802c7e98f0c1b365a850d8383512c62b14","abstract_canon_sha256":"3d2ad2ddea91193c0e81f6c5972c86e0a9996c3b93025b10f6f1cd2ad354ca13"},"schema_version":"1.0"},"canonical_sha256":"02e6200899bfaffc7a6ba6b915f8da30d08f1e094fbaaa1077164a9a6b09a919","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:21.311242Z","signature_b64":"BFzyn8mmtUp7V19rjbcAutS2sLCSN87Oa2k9AOFerKqVQ9f1Of8Za0RnNort5HiQygFMAR+KXv6W3YYC1c8XDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02e6200899bfaffc7a6ba6b915f8da30d08f1e094fbaaa1077164a9a6b09a919","last_reissued_at":"2026-05-18T00:16:21.310881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:21.310881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04882","source_version":3,"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-18T00:16:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CX3Te50owy5/OUM5/lR70Q0CPSIPduK+6+9Qp8SKXglL65RNb2zMdeXtZstYFjcctKnbGh8z7hKsoyZyAK9RBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:38:10.596873Z"},"content_sha256":"725461d940b80b7d722e8e9188ac3be645d49612351919b1700c966a4d90adf7","schema_version":"1.0","event_id":"sha256:725461d940b80b7d722e8e9188ac3be645d49612351919b1700c966a4d90adf7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ALTCACEZX6X7Y6TLU24RL6G2GD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coding over Sets for DNA Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andreas Lenz, Antonia Wachter-Zeh, Eitan Yaakobi, Paul H. Siegel","submitted_at":"2018-01-15T17:31:08Z","abstract_excerpt":"In this paper, we study error-correcting codes for the storage of data in synthetic deoxyribonucleic acid (DNA). We investigate a storage model where data is represented by an unordered set of $M$ sequences, each of length $L$. Errors within that model are losses of whole sequences and point errors inside the sequences, such as substitutions, insertions and deletions. We propose code constructions which can correct these errors with efficient encoders and decoders. By deriving upper bounds on the cardinalities of these codes using sphere packing arguments, we show that many of our codes are cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04882","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":""},"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-18T00:16:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dXO7i+Hx3lp2bwlnW2WcIdlxFg+tArtcOlTsqis47PCzPGHGYYiIuI2S25ouqueXlZ54SriL+X8Q2TMrx90XAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:38:10.597218Z"},"content_sha256":"31e40b3cd755cc678c57552d0d85307f55b23cf35a171db94a7b0798aef75ee4","schema_version":"1.0","event_id":"sha256:31e40b3cd755cc678c57552d0d85307f55b23cf35a171db94a7b0798aef75ee4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ALTCACEZX6X7Y6TLU24RL6G2GD/bundle.json","state_url":"https://pith.science/pith/ALTCACEZX6X7Y6TLU24RL6G2GD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ALTCACEZX6X7Y6TLU24RL6G2GD/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-05T11:38:10Z","links":{"resolver":"https://pith.science/pith/ALTCACEZX6X7Y6TLU24RL6G2GD","bundle":"https://pith.science/pith/ALTCACEZX6X7Y6TLU24RL6G2GD/bundle.json","state":"https://pith.science/pith/ALTCACEZX6X7Y6TLU24RL6G2GD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ALTCACEZX6X7Y6TLU24RL6G2GD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ALTCACEZX6X7Y6TLU24RL6G2GD","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":"3d2ad2ddea91193c0e81f6c5972c86e0a9996c3b93025b10f6f1cd2ad354ca13","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-15T17:31:08Z","title_canon_sha256":"bd4931d11021f646bd8c5d070e7d3d802c7e98f0c1b365a850d8383512c62b14"},"schema_version":"1.0","source":{"id":"1801.04882","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04882","created_at":"2026-05-18T00:16:21Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04882v3","created_at":"2026-05-18T00:16:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04882","created_at":"2026-05-18T00:16:21Z"},{"alias_kind":"pith_short_12","alias_value":"ALTCACEZX6X7","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ALTCACEZX6X7Y6TL","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ALTCACEZ","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:31e40b3cd755cc678c57552d0d85307f55b23cf35a171db94a7b0798aef75ee4","target":"graph","created_at":"2026-05-18T00:16:21Z","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":"In this paper, we study error-correcting codes for the storage of data in synthetic deoxyribonucleic acid (DNA). We investigate a storage model where data is represented by an unordered set of $M$ sequences, each of length $L$. Errors within that model are losses of whole sequences and point errors inside the sequences, such as substitutions, insertions and deletions. We propose code constructions which can correct these errors with efficient encoders and decoders. By deriving upper bounds on the cardinalities of these codes using sphere packing arguments, we show that many of our codes are cl","authors_text":"Andreas Lenz, Antonia Wachter-Zeh, Eitan Yaakobi, Paul H. Siegel","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-15T17:31:08Z","title":"Coding over Sets for DNA Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04882","kind":"arxiv","version":3},"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:725461d940b80b7d722e8e9188ac3be645d49612351919b1700c966a4d90adf7","target":"record","created_at":"2026-05-18T00:16:21Z","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":"3d2ad2ddea91193c0e81f6c5972c86e0a9996c3b93025b10f6f1cd2ad354ca13","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-15T17:31:08Z","title_canon_sha256":"bd4931d11021f646bd8c5d070e7d3d802c7e98f0c1b365a850d8383512c62b14"},"schema_version":"1.0","source":{"id":"1801.04882","kind":"arxiv","version":3}},"canonical_sha256":"02e6200899bfaffc7a6ba6b915f8da30d08f1e094fbaaa1077164a9a6b09a919","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02e6200899bfaffc7a6ba6b915f8da30d08f1e094fbaaa1077164a9a6b09a919","first_computed_at":"2026-05-18T00:16:21.310881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:21.310881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BFzyn8mmtUp7V19rjbcAutS2sLCSN87Oa2k9AOFerKqVQ9f1Of8Za0RnNort5HiQygFMAR+KXv6W3YYC1c8XDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:21.311242Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04882","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:725461d940b80b7d722e8e9188ac3be645d49612351919b1700c966a4d90adf7","sha256:31e40b3cd755cc678c57552d0d85307f55b23cf35a171db94a7b0798aef75ee4"],"state_sha256":"397efaef3cee4a5161a310737fe770c3636e401eeb852cc81db970d7ffe5ee21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/z0tkfSd9qp+kWFLmtjNvkt25Zf4OcurF7vuvWib17kNTIORgkBo7nn6L/XukYCQQK0QeOBeh6VLw9WWswUzAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:38:10.599297Z","bundle_sha256":"28a488d9b2f9bacf7f97506c692a215144b4179883f2e90d3d9b081f07b6e455"}}