{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BCIWEFM5YRQZ54MZQLKZAGS2ZX","short_pith_number":"pith:BCIWEFM5","canonical_record":{"source":{"id":"1501.07133","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-28T15:07:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ca3546f0b26ae5bfb1c720a55d25fa9dc6602603194e8ab4188a14d7d85f01a4","abstract_canon_sha256":"2e71b7d1d81df08ab7ed69e0542b7646c5222e63c10510cdc2025c218823a13d"},"schema_version":"1.0"},"canonical_sha256":"089162159dc4619ef19982d5901a5acdc2c4a212e977baf4b7a762ffceb8e80e","source":{"kind":"arxiv","id":"1501.07133","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07133","created_at":"2026-05-18T01:16:29Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07133v2","created_at":"2026-05-18T01:16:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07133","created_at":"2026-05-18T01:16:29Z"},{"alias_kind":"pith_short_12","alias_value":"BCIWEFM5YRQZ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BCIWEFM5YRQZ54MZ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BCIWEFM5","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BCIWEFM5YRQZ54MZQLKZAGS2ZX","target":"record","payload":{"canonical_record":{"source":{"id":"1501.07133","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-28T15:07:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ca3546f0b26ae5bfb1c720a55d25fa9dc6602603194e8ab4188a14d7d85f01a4","abstract_canon_sha256":"2e71b7d1d81df08ab7ed69e0542b7646c5222e63c10510cdc2025c218823a13d"},"schema_version":"1.0"},"canonical_sha256":"089162159dc4619ef19982d5901a5acdc2c4a212e977baf4b7a762ffceb8e80e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:29.863459Z","signature_b64":"tQpFDZw+Bx2b9SmW1LZIJ/inhF8ppGGyQEoWaHpiyALnxZwbcxfWSPuG0BppRdeP7YUSKUKz8aCHNCVyg2arBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"089162159dc4619ef19982d5901a5acdc2c4a212e977baf4b7a762ffceb8e80e","last_reissued_at":"2026-05-18T01:16:29.862983Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:29.862983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.07133","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-05-18T01:16:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AtgySMEk9JBOGOyejGsoZZvNvNQbfLNeSgnycM2YvIfRbIrm1XtebnMJqnpx2oZkNtQmpOcht6UOEOCgfmhqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:18:35.222115Z"},"content_sha256":"e917eadd559ba3e1e3c5c512c405168384f5aa38a6916e0f22b1fb1e1b3d9ebb","schema_version":"1.0","event_id":"sha256:e917eadd559ba3e1e3c5c512c405168384f5aa38a6916e0f22b1fb1e1b3d9ebb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BCIWEFM5YRQZ54MZQLKZAGS2ZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Optimal Family of Codes for Archival DNA Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dixita Limbachiya, Madhav Khakhar, Manish K Gupta, Vijay Dhameliya","submitted_at":"2015-01-28T15:07:30Z","abstract_excerpt":"DNA based storage systems received attention by many researchers. This includes archival and re-writable random access DNA based storage systems. In this work, we have developed an efficient technique to encode the data into DNA sequence by using non-linear families of ternary codes. In particular, we proposes an algorithm to encode data into DNA with high information storage density and better error correction using a sub code of Golay code. Theoretically, 115 exabytes (EB) data can be stored in one gram of DNA by our method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07133","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":""},"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-18T01:16:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"obstGCLw+eD5bu06PlsoEJQWRbTceXpI+BPnXZO9T1QOtmFNeSp4CJJe5jKwc/Nr8BMdhqv95yFfZRO31cIhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:18:35.222556Z"},"content_sha256":"17a28195eb3fc9ced2031b6efacab5e90866a1c477aecd4e6dfe3c48de091583","schema_version":"1.0","event_id":"sha256:17a28195eb3fc9ced2031b6efacab5e90866a1c477aecd4e6dfe3c48de091583"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCIWEFM5YRQZ54MZQLKZAGS2ZX/bundle.json","state_url":"https://pith.science/pith/BCIWEFM5YRQZ54MZQLKZAGS2ZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCIWEFM5YRQZ54MZQLKZAGS2ZX/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-05-31T12:18:35Z","links":{"resolver":"https://pith.science/pith/BCIWEFM5YRQZ54MZQLKZAGS2ZX","bundle":"https://pith.science/pith/BCIWEFM5YRQZ54MZQLKZAGS2ZX/bundle.json","state":"https://pith.science/pith/BCIWEFM5YRQZ54MZQLKZAGS2ZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCIWEFM5YRQZ54MZQLKZAGS2ZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BCIWEFM5YRQZ54MZQLKZAGS2ZX","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":"2e71b7d1d81df08ab7ed69e0542b7646c5222e63c10510cdc2025c218823a13d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-28T15:07:30Z","title_canon_sha256":"ca3546f0b26ae5bfb1c720a55d25fa9dc6602603194e8ab4188a14d7d85f01a4"},"schema_version":"1.0","source":{"id":"1501.07133","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07133","created_at":"2026-05-18T01:16:29Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07133v2","created_at":"2026-05-18T01:16:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07133","created_at":"2026-05-18T01:16:29Z"},{"alias_kind":"pith_short_12","alias_value":"BCIWEFM5YRQZ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BCIWEFM5YRQZ54MZ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BCIWEFM5","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:17a28195eb3fc9ced2031b6efacab5e90866a1c477aecd4e6dfe3c48de091583","target":"graph","created_at":"2026-05-18T01:16:29Z","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":"DNA based storage systems received attention by many researchers. This includes archival and re-writable random access DNA based storage systems. In this work, we have developed an efficient technique to encode the data into DNA sequence by using non-linear families of ternary codes. In particular, we proposes an algorithm to encode data into DNA with high information storage density and better error correction using a sub code of Golay code. Theoretically, 115 exabytes (EB) data can be stored in one gram of DNA by our method.","authors_text":"Dixita Limbachiya, Madhav Khakhar, Manish K Gupta, Vijay Dhameliya","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-28T15:07:30Z","title":"On Optimal Family of Codes for Archival DNA Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07133","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:e917eadd559ba3e1e3c5c512c405168384f5aa38a6916e0f22b1fb1e1b3d9ebb","target":"record","created_at":"2026-05-18T01:16:29Z","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":"2e71b7d1d81df08ab7ed69e0542b7646c5222e63c10510cdc2025c218823a13d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-28T15:07:30Z","title_canon_sha256":"ca3546f0b26ae5bfb1c720a55d25fa9dc6602603194e8ab4188a14d7d85f01a4"},"schema_version":"1.0","source":{"id":"1501.07133","kind":"arxiv","version":2}},"canonical_sha256":"089162159dc4619ef19982d5901a5acdc2c4a212e977baf4b7a762ffceb8e80e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"089162159dc4619ef19982d5901a5acdc2c4a212e977baf4b7a762ffceb8e80e","first_computed_at":"2026-05-18T01:16:29.862983Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:29.862983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tQpFDZw+Bx2b9SmW1LZIJ/inhF8ppGGyQEoWaHpiyALnxZwbcxfWSPuG0BppRdeP7YUSKUKz8aCHNCVyg2arBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:29.863459Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.07133","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e917eadd559ba3e1e3c5c512c405168384f5aa38a6916e0f22b1fb1e1b3d9ebb","sha256:17a28195eb3fc9ced2031b6efacab5e90866a1c477aecd4e6dfe3c48de091583"],"state_sha256":"a80c361705b844df83babd2769fe4ba2710073b16bf244a7607d1e9efe6cec70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nAVWCC1Og+sn+Vc0aa1oVF5eonB9j7oc7MBs7BTn9cCFfRfk7QvKeewTmTJoNMCwR7xp9504JnVQ12eIoQIuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:18:35.226699Z","bundle_sha256":"07cdcb4020e795e4a0e653151b1df7405925fbcbd3256988b50706b5459826a0"}}