{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LXRZZLHVZC2YTGD5V6BP6SILUU","short_pith_number":"pith:LXRZZLHV","canonical_record":{"source":{"id":"1812.06798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-14T14:23:41Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"27752c1521508d5743b0a8c7b8069c3344c180a3a0468a8210d2367018c36884","abstract_canon_sha256":"bb994e0af2627ac135d393ed7baa1353e40e95ce11ab8e7650772523973db609"},"schema_version":"1.0"},"canonical_sha256":"5de39cacf5c8b589987daf82ff490ba5288d4eb4b022c9c326eced07590edf90","source":{"kind":"arxiv","id":"1812.06798","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LXRZZLHVZC2YTGD5V6BP6SILUU","target":"record","payload":{"canonical_record":{"source":{"id":"1812.06798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-14T14:23:41Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"27752c1521508d5743b0a8c7b8069c3344c180a3a0468a8210d2367018c36884","abstract_canon_sha256":"bb994e0af2627ac135d393ed7baa1353e40e95ce11ab8e7650772523973db609"},"schema_version":"1.0"},"canonical_sha256":"5de39cacf5c8b589987daf82ff490ba5288d4eb4b022c9c326eced07590edf90","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:09.338236Z","signature_b64":"3VBJZHPWdwV2s4e7Jh8+92knZdiqTAcH+W/pUA8j/Cig2f+w9qnztQpBZFHr0VNnTeXg9AfzFcshMvepXIMWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5de39cacf5c8b589987daf82ff490ba5288d4eb4b022c9c326eced07590edf90","last_reissued_at":"2026-05-17T23:58:09.337640Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:09.337640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.06798","source_version":1,"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-17T23:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e1B42P7vVk39IWXHJKUoHrfi9cyp/ddW1aVLj6lRNbmOXxphAah1DWlyUlAQDK9KqXbOjby+q2I81Mw7VlYfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T18:05:49.515483Z"},"content_sha256":"29ec215353ad6f3ef824975dc3c571de38f73f6c3c9787997633ed409bb18eb6","schema_version":"1.0","event_id":"sha256:29ec215353ad6f3ef824975dc3c571de38f73f6c3c9787997633ed409bb18eb6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LXRZZLHVZC2YTGD5V6BP6SILUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Properties and constructions of constrained codes for DNA-based data storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Kees A. Schouhamer Immink, Kui Cai","submitted_at":"2018-12-14T14:23:41Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06798","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"},"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-17T23:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BuNl/igeScH6Trf29OvuXXCFuuTq0RwyBqAzdO7M/NvE6wifFTovVKuJxF2IYhrma5DFEvH0mjUCZZKVR6IPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T18:05:49.515824Z"},"content_sha256":"6b31dfb39ea9309257a5d838d0709dda8fc34b135dbe2bc7829272d12a73c455","schema_version":"1.0","event_id":"sha256:6b31dfb39ea9309257a5d838d0709dda8fc34b135dbe2bc7829272d12a73c455"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LXRZZLHVZC2YTGD5V6BP6SILUU/bundle.json","state_url":"https://pith.science/pith/LXRZZLHVZC2YTGD5V6BP6SILUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LXRZZLHVZC2YTGD5V6BP6SILUU/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-01T18:05:49Z","links":{"resolver":"https://pith.science/pith/LXRZZLHVZC2YTGD5V6BP6SILUU","bundle":"https://pith.science/pith/LXRZZLHVZC2YTGD5V6BP6SILUU/bundle.json","state":"https://pith.science/pith/LXRZZLHVZC2YTGD5V6BP6SILUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LXRZZLHVZC2YTGD5V6BP6SILUU/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r9T/BPPZmJN/7Nf59crF8GoloNJ71xeMefsKsIP+haE/58Bpj1oreH7dKIRrcrxNWjxAeOEtZ4ZUZNZBlFsCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T18:05:49.517676Z","bundle_sha256":"a1e7e133a86540708eb0a3e7d451b2cd99720952cce4df0d625c269b8e017a90"}}