{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EGR363ECOJV422GYUVKC2DUI72","short_pith_number":"pith:EGR363EC","canonical_record":{"source":{"id":"1506.00740","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-02T03:22:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bf570c20e0b43187cd954d81798b63ca13f00133c477ef379834422e35d4d989","abstract_canon_sha256":"6daad75ca730a36c3665873b0e4e24145d308efe439c7ac7dd1beed8443ff1cd"},"schema_version":"1.0"},"canonical_sha256":"21a3bf6c82726bcd68d8a5542d0e88fe8f56e894731c9a2fed1a4263a279385a","source":{"kind":"arxiv","id":"1506.00740","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00740","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00740v5","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00740","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"EGR363ECOJV4","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EGR363ECOJV422GY","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EGR363EC","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EGR363ECOJV422GYUVKC2DUI72","target":"record","payload":{"canonical_record":{"source":{"id":"1506.00740","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-02T03:22:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bf570c20e0b43187cd954d81798b63ca13f00133c477ef379834422e35d4d989","abstract_canon_sha256":"6daad75ca730a36c3665873b0e4e24145d308efe439c7ac7dd1beed8443ff1cd"},"schema_version":"1.0"},"canonical_sha256":"21a3bf6c82726bcd68d8a5542d0e88fe8f56e894731c9a2fed1a4263a279385a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:58.259239Z","signature_b64":"0UYDaL7eK601zxLl2qqpbPJMhbwyKyxlugXA9dPmy10gAR0eP1WlB3IMHuEy+ThlF3cXlhDbZ81TPIBpshHqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21a3bf6c82726bcd68d8a5542d0e88fe8f56e894731c9a2fed1a4263a279385a","last_reissued_at":"2026-05-18T00:54:58.258764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:58.258764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.00740","source_version":5,"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:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B70O1AOVFmxfCQ5gEqegIbXAUq2I7XZT0E4faG/Iwo/Hz5zMgkW3tA+OMXoyCGmTc3Q1WioRhi1sZS1h+6VpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:16:55.793969Z"},"content_sha256":"0780d0db3128989f9df025e09ac266a431d1b70c6afe47de4214e9659602d748","schema_version":"1.0","event_id":"sha256:0780d0db3128989f9df025e09ac266a431d1b70c6afe47de4214e9659602d748"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EGR363ECOJV422GYUVKC2DUI72","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymmetric Lee Distance Codes for DNA-Based Storage","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Han Mao Kiah, Olgica Milenkovic, Ryan Gabrys","submitted_at":"2015-06-02T03:22:39Z","abstract_excerpt":"We consider a new family of codes, termed asymmetric Lee distance codes, that arise in the design and implementation of DNA-based storage systems and systems with parallel string transmission protocols. The codewords are defined over a quaternary alphabet, although the results carry over to other alphabet sizes; furthermore, symbol confusability is dictated by their underlying binary representation. Our contributions are two-fold. First, we demonstrate that the new distance represents a linear combination of the Lee and Hamming distance and derive upper bounds on the size of the codes under th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00740","kind":"arxiv","version":5},"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:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rr8oNXTh6H+5ZCCIW2GHfl/zXrNyrxDUZvOQL9jYqPAysmg5BUsrHGROSOn8awj+vpd09d/9kRMRMxWYCkx+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:16:55.794311Z"},"content_sha256":"5c1fdf4f5fc7f0f8a5e10b8801256f7dc2412aa7d4c9a42414f0252a3b294637","schema_version":"1.0","event_id":"sha256:5c1fdf4f5fc7f0f8a5e10b8801256f7dc2412aa7d4c9a42414f0252a3b294637"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EGR363ECOJV422GYUVKC2DUI72/bundle.json","state_url":"https://pith.science/pith/EGR363ECOJV422GYUVKC2DUI72/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EGR363ECOJV422GYUVKC2DUI72/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-26T01:16:55Z","links":{"resolver":"https://pith.science/pith/EGR363ECOJV422GYUVKC2DUI72","bundle":"https://pith.science/pith/EGR363ECOJV422GYUVKC2DUI72/bundle.json","state":"https://pith.science/pith/EGR363ECOJV422GYUVKC2DUI72/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EGR363ECOJV422GYUVKC2DUI72/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EGR363ECOJV422GYUVKC2DUI72","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":"6daad75ca730a36c3665873b0e4e24145d308efe439c7ac7dd1beed8443ff1cd","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-02T03:22:39Z","title_canon_sha256":"bf570c20e0b43187cd954d81798b63ca13f00133c477ef379834422e35d4d989"},"schema_version":"1.0","source":{"id":"1506.00740","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00740","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00740v5","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00740","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"EGR363ECOJV4","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EGR363ECOJV422GY","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EGR363EC","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:5c1fdf4f5fc7f0f8a5e10b8801256f7dc2412aa7d4c9a42414f0252a3b294637","target":"graph","created_at":"2026-05-18T00:54:58Z","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 consider a new family of codes, termed asymmetric Lee distance codes, that arise in the design and implementation of DNA-based storage systems and systems with parallel string transmission protocols. The codewords are defined over a quaternary alphabet, although the results carry over to other alphabet sizes; furthermore, symbol confusability is dictated by their underlying binary representation. Our contributions are two-fold. First, we demonstrate that the new distance represents a linear combination of the Lee and Hamming distance and derive upper bounds on the size of the codes under th","authors_text":"Han Mao Kiah, Olgica Milenkovic, Ryan Gabrys","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-02T03:22:39Z","title":"Asymmetric Lee Distance Codes for DNA-Based Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00740","kind":"arxiv","version":5},"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:0780d0db3128989f9df025e09ac266a431d1b70c6afe47de4214e9659602d748","target":"record","created_at":"2026-05-18T00:54:58Z","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":"6daad75ca730a36c3665873b0e4e24145d308efe439c7ac7dd1beed8443ff1cd","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-02T03:22:39Z","title_canon_sha256":"bf570c20e0b43187cd954d81798b63ca13f00133c477ef379834422e35d4d989"},"schema_version":"1.0","source":{"id":"1506.00740","kind":"arxiv","version":5}},"canonical_sha256":"21a3bf6c82726bcd68d8a5542d0e88fe8f56e894731c9a2fed1a4263a279385a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21a3bf6c82726bcd68d8a5542d0e88fe8f56e894731c9a2fed1a4263a279385a","first_computed_at":"2026-05-18T00:54:58.258764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:58.258764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0UYDaL7eK601zxLl2qqpbPJMhbwyKyxlugXA9dPmy10gAR0eP1WlB3IMHuEy+ThlF3cXlhDbZ81TPIBpshHqCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:58.259239Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00740","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0780d0db3128989f9df025e09ac266a431d1b70c6afe47de4214e9659602d748","sha256:5c1fdf4f5fc7f0f8a5e10b8801256f7dc2412aa7d4c9a42414f0252a3b294637"],"state_sha256":"93bfa8a42c83b362f77b1b18c3be72a51889b9a89088bf187c76710b577d1691"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5q2/uyY7oKfW9VbURyCOXqlqGXDK2lZCVsl6qXOm+XrPukaOI2948Fgwtyeiimc6xf5QfqMkXfZ6R0QR/sJxCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T01:16:55.796271Z","bundle_sha256":"7b09ef4840d6f221e98d726f210d2910c341b6463c9ed5e29b6ea8d4f178278d"}}