{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EYO3ZMRANKK42CMOLIGNVDP3MC","short_pith_number":"pith:EYO3ZMRA","canonical_record":{"source":{"id":"1806.04367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-12T07:24:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e8986d4086283f00e05cad2d9a734313acaf2ae92220297357313d9aee64a013","abstract_canon_sha256":"51f0d822be1b8c4f4d5cac355b9d1c6d166aeb9dfd404befebebe9e3af0cb1b5"},"schema_version":"1.0"},"canonical_sha256":"261dbcb2206a95cd098e5a0cda8dfb60956b316c2ab8ecef1bb59993341a947f","source":{"kind":"arxiv","id":"1806.04367","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04367","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04367v1","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04367","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"EYO3ZMRANKK4","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EYO3ZMRANKK42CMO","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EYO3ZMRA","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EYO3ZMRANKK42CMOLIGNVDP3MC","target":"record","payload":{"canonical_record":{"source":{"id":"1806.04367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-12T07:24:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e8986d4086283f00e05cad2d9a734313acaf2ae92220297357313d9aee64a013","abstract_canon_sha256":"51f0d822be1b8c4f4d5cac355b9d1c6d166aeb9dfd404befebebe9e3af0cb1b5"},"schema_version":"1.0"},"canonical_sha256":"261dbcb2206a95cd098e5a0cda8dfb60956b316c2ab8ecef1bb59993341a947f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:35.736787Z","signature_b64":"w4VgmS1Lj9CBDlhUHrJsJwXKFM+hx3kZVAFSI63v8IMCtFtAjS81JasB32rSiHy2sUMrw2g5/wfVASGGvk8+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"261dbcb2206a95cd098e5a0cda8dfb60956b316c2ab8ecef1bb59993341a947f","last_reissued_at":"2026-05-18T00:13:35.735852Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:35.735852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.04367","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-18T00:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XUf6JTb+tCaSaPs22YZfEN9664VT/3D51OZti6D37uVpgsl4W1YV7DAdooaqOFoorHJnLi0bBCq/DZ0ZPueUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:57:21.220894Z"},"content_sha256":"67f20493b6996958ef5bedec05bb4c4aade47f43a5b6cd3504a4259b5cfc33a9","schema_version":"1.0","event_id":"sha256:67f20493b6996958ef5bedec05bb4c4aade47f43a5b6cd3504a4259b5cfc33a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EYO3ZMRANKK42CMOLIGNVDP3MC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reversible Codes and Its Application to Reversible DNA Codes over $F_{4^k}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jin Li, Lei Chen, Zhonghua Sun","submitted_at":"2018-06-12T07:24:50Z","abstract_excerpt":"Coterm polynomials are introduced by Oztas et al. [a novel approach for constructing reversible codes and applications to DNA codes over the ring $F_2[u]/(u^{2k}-1)$, Finite Fields and Their Applications 46 (2017).pp. 217-234.], which generate reversible codes. In this paper, we generalize the coterm polynomials and construct some reversible codes which are optimal codes by using $m$-quasi-reciprocal polynomials. Moreover, we give a map from DNA $k$-bases to the elements of $F_{4^k}$, and construct reversible DNA codes over $F_{4^k}$ by DNA-$m$-quasi-reciprocal polynomials."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04367","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-18T00:13:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xd9xuYk/KWHeIWoeePFa3ocVahQvX9sZMz+kdHjMJeZ09sYnN7pOfNcQCWMgTrYQ9YoKRCAq4uiwXGE5KbUeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:57:21.221659Z"},"content_sha256":"ea49b08d487e8b738feeff933be89de6ac5f6c060334efc188e1b349685f1192","schema_version":"1.0","event_id":"sha256:ea49b08d487e8b738feeff933be89de6ac5f6c060334efc188e1b349685f1192"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EYO3ZMRANKK42CMOLIGNVDP3MC/bundle.json","state_url":"https://pith.science/pith/EYO3ZMRANKK42CMOLIGNVDP3MC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EYO3ZMRANKK42CMOLIGNVDP3MC/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-11T08:57:21Z","links":{"resolver":"https://pith.science/pith/EYO3ZMRANKK42CMOLIGNVDP3MC","bundle":"https://pith.science/pith/EYO3ZMRANKK42CMOLIGNVDP3MC/bundle.json","state":"https://pith.science/pith/EYO3ZMRANKK42CMOLIGNVDP3MC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EYO3ZMRANKK42CMOLIGNVDP3MC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EYO3ZMRANKK42CMOLIGNVDP3MC","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":"51f0d822be1b8c4f4d5cac355b9d1c6d166aeb9dfd404befebebe9e3af0cb1b5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-12T07:24:50Z","title_canon_sha256":"e8986d4086283f00e05cad2d9a734313acaf2ae92220297357313d9aee64a013"},"schema_version":"1.0","source":{"id":"1806.04367","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04367","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04367v1","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04367","created_at":"2026-05-18T00:13:35Z"},{"alias_kind":"pith_short_12","alias_value":"EYO3ZMRANKK4","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EYO3ZMRANKK42CMO","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EYO3ZMRA","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:ea49b08d487e8b738feeff933be89de6ac5f6c060334efc188e1b349685f1192","target":"graph","created_at":"2026-05-18T00:13:35Z","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":"Coterm polynomials are introduced by Oztas et al. [a novel approach for constructing reversible codes and applications to DNA codes over the ring $F_2[u]/(u^{2k}-1)$, Finite Fields and Their Applications 46 (2017).pp. 217-234.], which generate reversible codes. In this paper, we generalize the coterm polynomials and construct some reversible codes which are optimal codes by using $m$-quasi-reciprocal polynomials. Moreover, we give a map from DNA $k$-bases to the elements of $F_{4^k}$, and construct reversible DNA codes over $F_{4^k}$ by DNA-$m$-quasi-reciprocal polynomials.","authors_text":"Jin Li, Lei Chen, Zhonghua Sun","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-12T07:24:50Z","title":"Reversible Codes and Its Application to Reversible DNA Codes over $F_{4^k}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04367","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:67f20493b6996958ef5bedec05bb4c4aade47f43a5b6cd3504a4259b5cfc33a9","target":"record","created_at":"2026-05-18T00:13:35Z","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":"51f0d822be1b8c4f4d5cac355b9d1c6d166aeb9dfd404befebebe9e3af0cb1b5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-12T07:24:50Z","title_canon_sha256":"e8986d4086283f00e05cad2d9a734313acaf2ae92220297357313d9aee64a013"},"schema_version":"1.0","source":{"id":"1806.04367","kind":"arxiv","version":1}},"canonical_sha256":"261dbcb2206a95cd098e5a0cda8dfb60956b316c2ab8ecef1bb59993341a947f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"261dbcb2206a95cd098e5a0cda8dfb60956b316c2ab8ecef1bb59993341a947f","first_computed_at":"2026-05-18T00:13:35.735852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:35.735852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w4VgmS1Lj9CBDlhUHrJsJwXKFM+hx3kZVAFSI63v8IMCtFtAjS81JasB32rSiHy2sUMrw2g5/wfVASGGvk8+Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:35.736787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04367","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67f20493b6996958ef5bedec05bb4c4aade47f43a5b6cd3504a4259b5cfc33a9","sha256:ea49b08d487e8b738feeff933be89de6ac5f6c060334efc188e1b349685f1192"],"state_sha256":"0287e5959f8724f95871be81fa50a509affc97166517e14da9763ac6b291f66d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IZOZehUQCeMaRG0EX5rmBNpo4WD+0La7eLZKUpmcankjfOG2HS8O8CX5m2/v3keFC+JvJCrYhtLvfNCUiBbUCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:57:21.226267Z","bundle_sha256":"2c572ce36073b85dcd384dab4ec3345da9bc9dcc95f8ad7b0704b8eb7ba6a0f8"}}