{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LXRZZLHVZC2YTGD5V6BP6SILUU","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":"bb994e0af2627ac135d393ed7baa1353e40e95ce11ab8e7650772523973db609","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-14T14:23:41Z","title_canon_sha256":"27752c1521508d5743b0a8c7b8069c3344c180a3a0468a8210d2367018c36884"},"schema_version":"1.0","source":{"id":"1812.06798","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06798","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06798v1","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06798","created_at":"2026-05-17T23:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"LXRZZLHVZC2Y","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LXRZZLHVZC2YTGD5","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LXRZZLHV","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:6b31dfb39ea9309257a5d838d0709dda8fc34b135dbe2bc7829272d12a73c455","target":"graph","created_at":"2026-05-17T23:58:09Z","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 describe properties and constructions of constraint-based codes for DNA-based data storage which account for the maximum repetition length and AT/GC balance. We present algorithms for computing the number of sequences with maximum repetition length and AT/GC balance constraint. We describe routines for translating binary runlength limited and/or balanced strings into DNA strands, and compute the efficiency of such routines. We show that the implementation of AT/GC-balanced codes is straightforward accomplished with binary balanced codes. We present codes that account for both the maximum re","authors_text":"Kees A. Schouhamer Immink, Kui Cai","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-14T14:23:41Z","title":"Properties and constructions of constrained codes for DNA-based data storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06798","kind":"arxiv","version":1},"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:29ec215353ad6f3ef824975dc3c571de38f73f6c3c9787997633ed409bb18eb6","target":"record","created_at":"2026-05-17T23:58:09Z","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":"bb994e0af2627ac135d393ed7baa1353e40e95ce11ab8e7650772523973db609","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-14T14:23:41Z","title_canon_sha256":"27752c1521508d5743b0a8c7b8069c3344c180a3a0468a8210d2367018c36884"},"schema_version":"1.0","source":{"id":"1812.06798","kind":"arxiv","version":1}},"canonical_sha256":"5de39cacf5c8b589987daf82ff490ba5288d4eb4b022c9c326eced07590edf90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5de39cacf5c8b589987daf82ff490ba5288d4eb4b022c9c326eced07590edf90","first_computed_at":"2026-05-17T23:58:09.337640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:09.337640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3VBJZHPWdwV2s4e7Jh8+92knZdiqTAcH+W/pUA8j/Cig2f+w9qnztQpBZFHr0VNnTeXg9AfzFcshMvepXIMWCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:09.338236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.06798","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29ec215353ad6f3ef824975dc3c571de38f73f6c3c9787997633ed409bb18eb6","sha256:6b31dfb39ea9309257a5d838d0709dda8fc34b135dbe2bc7829272d12a73c455"],"state_sha256":"82e5fb2623aec2ba53ae5a16b74bee4ba89777b7391b7435f3894d1abc5d686d"}