{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HS63BWZI7UZQPOLKPMAXAIENQZ","short_pith_number":"pith:HS63BWZI","schema_version":"1.0","canonical_sha256":"3cbdb0db28fd3307b96a7b0170208d8666554c1970f1bd971550c537c2b99c18","source":{"kind":"arxiv","id":"1501.01327","version":1},"attestation_state":"computed","paper":{"title":"Cyclic codes over $\\mathbb{Z}_4+u\\mathbb{Z}_4$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Maheshanand Bhaintwal, Rama Krishna Bandi","submitted_at":"2015-01-06T22:19:02Z","abstract_excerpt":"In this paper, we have studied cyclic codes over the ring $R=\\mathbb{Z}_4+u\\mathbb{Z}_4$, $u^2=0$. We have considered cyclic codes of odd lengths. A sufficient condition for a cyclic code over $R$ to be a $\\mathbb{Z}_4$-free module is presented. We have provided the general form of the generators of a cyclic code over $R$ and determined a formula for the ranks of such codes. In this paper we have mainly focused on principally generated cyclic codes of odd length over $R$. We have determined a necessary condition and a sufficient condition for cyclic codes of odd lengths over $R$ to be $R$-free"},"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":"1501.01327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-06T22:19:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"af00b4da9c0124d7728299d8ce3deb6f93c4396d0b77d79537947cfc35d3ec55","abstract_canon_sha256":"e5ad3f2736a45043e96ede307f51bc7b9408b0857e223201644cc2536451f4a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:54.519085Z","signature_b64":"qIhT29JGMfLWJ+aKueNtPG5nnTXVAF+Gc3urx4DBoUb8TTPPHR7JvTCYsmeLxkyUQZ5oZzhwZ8BtuE8A/hHLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cbdb0db28fd3307b96a7b0170208d8666554c1970f1bd971550c537c2b99c18","last_reissued_at":"2026-05-18T02:29:54.518675Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:54.518675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cyclic codes over $\\mathbb{Z}_4+u\\mathbb{Z}_4$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Maheshanand Bhaintwal, Rama Krishna Bandi","submitted_at":"2015-01-06T22:19:02Z","abstract_excerpt":"In this paper, we have studied cyclic codes over the ring $R=\\mathbb{Z}_4+u\\mathbb{Z}_4$, $u^2=0$. We have considered cyclic codes of odd lengths. A sufficient condition for a cyclic code over $R$ to be a $\\mathbb{Z}_4$-free module is presented. We have provided the general form of the generators of a cyclic code over $R$ and determined a formula for the ranks of such codes. In this paper we have mainly focused on principally generated cyclic codes of odd length over $R$. We have determined a necessary condition and a sufficient condition for cyclic codes of odd lengths over $R$ to be $R$-free"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01327","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":"1501.01327","created_at":"2026-05-18T02:29:54.518748+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01327v1","created_at":"2026-05-18T02:29:54.518748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01327","created_at":"2026-05-18T02:29:54.518748+00:00"},{"alias_kind":"pith_short_12","alias_value":"HS63BWZI7UZQ","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HS63BWZI7UZQPOLK","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HS63BWZI","created_at":"2026-05-18T12:29:25.134429+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/HS63BWZI7UZQPOLKPMAXAIENQZ","json":"https://pith.science/pith/HS63BWZI7UZQPOLKPMAXAIENQZ.json","graph_json":"https://pith.science/api/pith-number/HS63BWZI7UZQPOLKPMAXAIENQZ/graph.json","events_json":"https://pith.science/api/pith-number/HS63BWZI7UZQPOLKPMAXAIENQZ/events.json","paper":"https://pith.science/paper/HS63BWZI"},"agent_actions":{"view_html":"https://pith.science/pith/HS63BWZI7UZQPOLKPMAXAIENQZ","download_json":"https://pith.science/pith/HS63BWZI7UZQPOLKPMAXAIENQZ.json","view_paper":"https://pith.science/paper/HS63BWZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01327&json=true","fetch_graph":"https://pith.science/api/pith-number/HS63BWZI7UZQPOLKPMAXAIENQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/HS63BWZI7UZQPOLKPMAXAIENQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HS63BWZI7UZQPOLKPMAXAIENQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HS63BWZI7UZQPOLKPMAXAIENQZ/action/storage_attestation","attest_author":"https://pith.science/pith/HS63BWZI7UZQPOLKPMAXAIENQZ/action/author_attestation","sign_citation":"https://pith.science/pith/HS63BWZI7UZQPOLKPMAXAIENQZ/action/citation_signature","submit_replication":"https://pith.science/pith/HS63BWZI7UZQPOLKPMAXAIENQZ/action/replication_record"}},"created_at":"2026-05-18T02:29:54.518748+00:00","updated_at":"2026-05-18T02:29:54.518748+00:00"}