{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Q67BCTG3LED2DWUJEPNMMBQDUM","short_pith_number":"pith:Q67BCTG3","schema_version":"1.0","canonical_sha256":"87be114cdb5907a1da8923dac60603a31a10c5cae27f47664bf98805b6b56d48","source":{"kind":"arxiv","id":"1606.04601","version":2},"attestation_state":"computed","paper":{"title":"Cyclic codes over $\\mathbb{Z}_4[u]/\\langle u^k\\rangle$ of odd length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cao Yuan, Li Qingguo","submitted_at":"2016-06-15T00:58:19Z","abstract_excerpt":"Let $R=\\mathbb{Z}_{4}[u]/\\langle u^k\\rangle=\\mathbb{Z}_{4}+u\\mathbb{Z}_{4}+\\ldots+u^{k-1}\\mathbb{Z}_{4}$ ($u^k=0$) where $k\\in \\mathbb{Z}^{+}$ satisfies $k\\geq 2$. For any odd positive integer $n$, it is known that cyclic codes over $R$ of length $n$ are identified with ideals of the ring $R[x]/\\langle x^{n}-1\\rangle$. In this paper, an explicit representation for each cyclic code over $R$ of length $n$ is provided and a formula to count the number of codewords in each code is given. Then a formula to calculate the number of cyclic codes over $R$ of length $n$ is obtained. Precisely, the dual "},"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":"1606.04601","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-15T00:58:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"277f955155ed0df847f9162f32e5a57c2ba00f327bf4ed26e336d6937ecdd10d","abstract_canon_sha256":"acb7e7163f427016747aeba6bb4548009b898924d0e88a96472f7d0a8c237816"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:22.335271Z","signature_b64":"3UNl+K1RoAbNy/liQ8zVZXEyn2xdxL5hFeM84UyMn2lXRcy8K/TKLLCMeJA+tpotBWdyMxBi5VpQr46IWbkzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87be114cdb5907a1da8923dac60603a31a10c5cae27f47664bf98805b6b56d48","last_reissued_at":"2026-05-18T01:12:22.334937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:22.334937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cyclic codes over $\\mathbb{Z}_4[u]/\\langle u^k\\rangle$ of odd length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cao Yuan, Li Qingguo","submitted_at":"2016-06-15T00:58:19Z","abstract_excerpt":"Let $R=\\mathbb{Z}_{4}[u]/\\langle u^k\\rangle=\\mathbb{Z}_{4}+u\\mathbb{Z}_{4}+\\ldots+u^{k-1}\\mathbb{Z}_{4}$ ($u^k=0$) where $k\\in \\mathbb{Z}^{+}$ satisfies $k\\geq 2$. For any odd positive integer $n$, it is known that cyclic codes over $R$ of length $n$ are identified with ideals of the ring $R[x]/\\langle x^{n}-1\\rangle$. In this paper, an explicit representation for each cyclic code over $R$ of length $n$ is provided and a formula to count the number of codewords in each code is given. Then a formula to calculate the number of cyclic codes over $R$ of length $n$ is obtained. Precisely, the dual "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04601","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.04601","created_at":"2026-05-18T01:12:22.334991+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.04601v2","created_at":"2026-05-18T01:12:22.334991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04601","created_at":"2026-05-18T01:12:22.334991+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q67BCTG3LED2","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q67BCTG3LED2DWUJ","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q67BCTG3","created_at":"2026-05-18T12:30:39.010887+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/Q67BCTG3LED2DWUJEPNMMBQDUM","json":"https://pith.science/pith/Q67BCTG3LED2DWUJEPNMMBQDUM.json","graph_json":"https://pith.science/api/pith-number/Q67BCTG3LED2DWUJEPNMMBQDUM/graph.json","events_json":"https://pith.science/api/pith-number/Q67BCTG3LED2DWUJEPNMMBQDUM/events.json","paper":"https://pith.science/paper/Q67BCTG3"},"agent_actions":{"view_html":"https://pith.science/pith/Q67BCTG3LED2DWUJEPNMMBQDUM","download_json":"https://pith.science/pith/Q67BCTG3LED2DWUJEPNMMBQDUM.json","view_paper":"https://pith.science/paper/Q67BCTG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.04601&json=true","fetch_graph":"https://pith.science/api/pith-number/Q67BCTG3LED2DWUJEPNMMBQDUM/graph.json","fetch_events":"https://pith.science/api/pith-number/Q67BCTG3LED2DWUJEPNMMBQDUM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q67BCTG3LED2DWUJEPNMMBQDUM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q67BCTG3LED2DWUJEPNMMBQDUM/action/storage_attestation","attest_author":"https://pith.science/pith/Q67BCTG3LED2DWUJEPNMMBQDUM/action/author_attestation","sign_citation":"https://pith.science/pith/Q67BCTG3LED2DWUJEPNMMBQDUM/action/citation_signature","submit_replication":"https://pith.science/pith/Q67BCTG3LED2DWUJEPNMMBQDUM/action/replication_record"}},"created_at":"2026-05-18T01:12:22.334991+00:00","updated_at":"2026-05-18T01:12:22.334991+00:00"}