{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EYO3ZMRANKK42CMOLIGNVDP3MC","short_pith_number":"pith:EYO3ZMRA","schema_version":"1.0","canonical_sha256":"261dbcb2206a95cd098e5a0cda8dfb60956b316c2ab8ecef1bb59993341a947f","source":{"kind":"arxiv","id":"1806.04367","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.04367","created_at":"2026-05-18T00:13:35.736008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.04367v1","created_at":"2026-05-18T00:13:35.736008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04367","created_at":"2026-05-18T00:13:35.736008+00:00"},{"alias_kind":"pith_short_12","alias_value":"EYO3ZMRANKK4","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EYO3ZMRANKK42CMO","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EYO3ZMRA","created_at":"2026-05-18T12:32:22.470017+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/EYO3ZMRANKK42CMOLIGNVDP3MC","json":"https://pith.science/pith/EYO3ZMRANKK42CMOLIGNVDP3MC.json","graph_json":"https://pith.science/api/pith-number/EYO3ZMRANKK42CMOLIGNVDP3MC/graph.json","events_json":"https://pith.science/api/pith-number/EYO3ZMRANKK42CMOLIGNVDP3MC/events.json","paper":"https://pith.science/paper/EYO3ZMRA"},"agent_actions":{"view_html":"https://pith.science/pith/EYO3ZMRANKK42CMOLIGNVDP3MC","download_json":"https://pith.science/pith/EYO3ZMRANKK42CMOLIGNVDP3MC.json","view_paper":"https://pith.science/paper/EYO3ZMRA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.04367&json=true","fetch_graph":"https://pith.science/api/pith-number/EYO3ZMRANKK42CMOLIGNVDP3MC/graph.json","fetch_events":"https://pith.science/api/pith-number/EYO3ZMRANKK42CMOLIGNVDP3MC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EYO3ZMRANKK42CMOLIGNVDP3MC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EYO3ZMRANKK42CMOLIGNVDP3MC/action/storage_attestation","attest_author":"https://pith.science/pith/EYO3ZMRANKK42CMOLIGNVDP3MC/action/author_attestation","sign_citation":"https://pith.science/pith/EYO3ZMRANKK42CMOLIGNVDP3MC/action/citation_signature","submit_replication":"https://pith.science/pith/EYO3ZMRANKK42CMOLIGNVDP3MC/action/replication_record"}},"created_at":"2026-05-18T00:13:35.736008+00:00","updated_at":"2026-05-18T00:13:35.736008+00:00"}