{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZDNEBBYWMKZYXVOQG5B2XNDJEN","short_pith_number":"pith:ZDNEBBYW","schema_version":"1.0","canonical_sha256":"c8da40871662b38bd5d03743abb469236dae206eea11b5da2ab958227fc32f15","source":{"kind":"arxiv","id":"1603.04055","version":1},"attestation_state":"computed","paper":{"title":"Construction of cyclic DNA codes over the Ring $\\Z_4[u]/\\langle u^2-1 \\rangle $ Based on the deletion distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abhay Kumar Singh, Sukhamoy Pattanayak","submitted_at":"2016-03-13T18:00:34Z","abstract_excerpt":"In this paper, we develop the theory for constructing DNA cyclic codes of odd length over $R=\\Z_4[u]/\\langle u^2-1 \\rangle$ based on the deletion distance. Firstly, we relate DNA pairs with a special 16 elements of ring $R$. Cyclic codes of odd length over $R$ satisfy the reverse constraint and the reverse-complement constraint are discussed in this paper. We also study the $GC$-content of these codes and their deletion distance. The paper concludes with some examples of cyclic DNA codes with $GC$-content and their respective deletion distance."},"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":"1603.04055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-13T18:00:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fec838ab84ecbb0ccf4620b91a8b545d0e4856414d78d8b97814e9dcea974bab","abstract_canon_sha256":"454598f3160953bc7d74c8c4c7b68373fa3f04112bd753f68a9353ebcb9e8023"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:09.542177Z","signature_b64":"sPMXMVVRPGoQ2RsPPCHoG3CNQn7Hm34aalCMuGWeO4siWuhDTl8I8YTCFeKo1SDFsbQdzBdu0iVi4J4F4tusDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8da40871662b38bd5d03743abb469236dae206eea11b5da2ab958227fc32f15","last_reissued_at":"2026-05-18T01:19:09.541220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:09.541220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction of cyclic DNA codes over the Ring $\\Z_4[u]/\\langle u^2-1 \\rangle $ Based on the deletion distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abhay Kumar Singh, Sukhamoy Pattanayak","submitted_at":"2016-03-13T18:00:34Z","abstract_excerpt":"In this paper, we develop the theory for constructing DNA cyclic codes of odd length over $R=\\Z_4[u]/\\langle u^2-1 \\rangle$ based on the deletion distance. Firstly, we relate DNA pairs with a special 16 elements of ring $R$. Cyclic codes of odd length over $R$ satisfy the reverse constraint and the reverse-complement constraint are discussed in this paper. We also study the $GC$-content of these codes and their deletion distance. The paper concludes with some examples of cyclic DNA codes with $GC$-content and their respective deletion distance."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04055","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":"1603.04055","created_at":"2026-05-18T01:19:09.541374+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.04055v1","created_at":"2026-05-18T01:19:09.541374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04055","created_at":"2026-05-18T01:19:09.541374+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDNEBBYWMKZY","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDNEBBYWMKZYXVOQ","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDNEBBYW","created_at":"2026-05-18T12:30:53.716459+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/ZDNEBBYWMKZYXVOQG5B2XNDJEN","json":"https://pith.science/pith/ZDNEBBYWMKZYXVOQG5B2XNDJEN.json","graph_json":"https://pith.science/api/pith-number/ZDNEBBYWMKZYXVOQG5B2XNDJEN/graph.json","events_json":"https://pith.science/api/pith-number/ZDNEBBYWMKZYXVOQG5B2XNDJEN/events.json","paper":"https://pith.science/paper/ZDNEBBYW"},"agent_actions":{"view_html":"https://pith.science/pith/ZDNEBBYWMKZYXVOQG5B2XNDJEN","download_json":"https://pith.science/pith/ZDNEBBYWMKZYXVOQG5B2XNDJEN.json","view_paper":"https://pith.science/paper/ZDNEBBYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.04055&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDNEBBYWMKZYXVOQG5B2XNDJEN/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDNEBBYWMKZYXVOQG5B2XNDJEN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDNEBBYWMKZYXVOQG5B2XNDJEN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDNEBBYWMKZYXVOQG5B2XNDJEN/action/storage_attestation","attest_author":"https://pith.science/pith/ZDNEBBYWMKZYXVOQG5B2XNDJEN/action/author_attestation","sign_citation":"https://pith.science/pith/ZDNEBBYWMKZYXVOQG5B2XNDJEN/action/citation_signature","submit_replication":"https://pith.science/pith/ZDNEBBYWMKZYXVOQG5B2XNDJEN/action/replication_record"}},"created_at":"2026-05-18T01:19:09.541374+00:00","updated_at":"2026-05-18T01:19:09.541374+00:00"}