{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7WNBAHZGXIDEJKVP33IUGGZG6D","short_pith_number":"pith:7WNBAHZG","schema_version":"1.0","canonical_sha256":"fd9a101f26ba0644aaafded1431b26f0cdd76c4db2e05f9966115f07d8f535c1","source":{"kind":"arxiv","id":"1903.04122","version":1},"attestation_state":"computed","paper":{"title":"Clustering-Correcting Codes","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, Tal Shinkar","submitted_at":"2019-03-11T04:26:46Z","abstract_excerpt":"A new family of codes, called clustering-correcting codes, is presented in this paper. This family of codes is motivated by the special structure of data that is stored in DNA-based storage systems. The data stored in these systems has the form of unordered sequences, also called strands, and every strand is synthesized thousands to millions of times, where some of these copies are read back during sequencing. Due to the unordered structure of the strands, an important task in the decoding process is to place them in their correct order. This is usually accomplished by allocating a part of the"},"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":"1903.04122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-11T04:26:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"568b9bda4916298306d57550c1af5218b747689b6418f709204f0b6a52d5dbe7","abstract_canon_sha256":"cae321084239eea5d33932f76ef99352183547d4ccdefa4707221f0afb1f1f8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:38.621521Z","signature_b64":"eVIOMH+dDAqNmOfjFTfuZZA9oR4V8fYTANJC0eFfDpY5ZdQBJ46lZjMRoslhXpsaYtGe6iBNzuFnhFaQ2yv3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd9a101f26ba0644aaafded1431b26f0cdd76c4db2e05f9966115f07d8f535c1","last_reissued_at":"2026-05-17T23:51:38.620926Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:38.620926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering-Correcting Codes","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, Tal Shinkar","submitted_at":"2019-03-11T04:26:46Z","abstract_excerpt":"A new family of codes, called clustering-correcting codes, is presented in this paper. This family of codes is motivated by the special structure of data that is stored in DNA-based storage systems. The data stored in these systems has the form of unordered sequences, also called strands, and every strand is synthesized thousands to millions of times, where some of these copies are read back during sequencing. Due to the unordered structure of the strands, an important task in the decoding process is to place them in their correct order. This is usually accomplished by allocating a part of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04122","kind":"arxiv","version":1},"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":"1903.04122","created_at":"2026-05-17T23:51:38.621006+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.04122v1","created_at":"2026-05-17T23:51:38.621006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04122","created_at":"2026-05-17T23:51:38.621006+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WNBAHZGXIDE","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WNBAHZGXIDEJKVP","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WNBAHZG","created_at":"2026-05-18T12:33:12.712433+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/7WNBAHZGXIDEJKVP33IUGGZG6D","json":"https://pith.science/pith/7WNBAHZGXIDEJKVP33IUGGZG6D.json","graph_json":"https://pith.science/api/pith-number/7WNBAHZGXIDEJKVP33IUGGZG6D/graph.json","events_json":"https://pith.science/api/pith-number/7WNBAHZGXIDEJKVP33IUGGZG6D/events.json","paper":"https://pith.science/paper/7WNBAHZG"},"agent_actions":{"view_html":"https://pith.science/pith/7WNBAHZGXIDEJKVP33IUGGZG6D","download_json":"https://pith.science/pith/7WNBAHZGXIDEJKVP33IUGGZG6D.json","view_paper":"https://pith.science/paper/7WNBAHZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.04122&json=true","fetch_graph":"https://pith.science/api/pith-number/7WNBAHZGXIDEJKVP33IUGGZG6D/graph.json","fetch_events":"https://pith.science/api/pith-number/7WNBAHZGXIDEJKVP33IUGGZG6D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WNBAHZGXIDEJKVP33IUGGZG6D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WNBAHZGXIDEJKVP33IUGGZG6D/action/storage_attestation","attest_author":"https://pith.science/pith/7WNBAHZGXIDEJKVP33IUGGZG6D/action/author_attestation","sign_citation":"https://pith.science/pith/7WNBAHZGXIDEJKVP33IUGGZG6D/action/citation_signature","submit_replication":"https://pith.science/pith/7WNBAHZGXIDEJKVP33IUGGZG6D/action/replication_record"}},"created_at":"2026-05-17T23:51:38.621006+00:00","updated_at":"2026-05-17T23:51:38.621006+00:00"}