{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HS63BWZI7UZQPOLKPMAXAIENQZ","short_pith_number":"pith:HS63BWZI","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"},"canonical_sha256":"3cbdb0db28fd3307b96a7b0170208d8666554c1970f1bd971550c537c2b99c18","source":{"kind":"arxiv","id":"1501.01327","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01327","created_at":"2026-05-18T02:29:54Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01327v1","created_at":"2026-05-18T02:29:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01327","created_at":"2026-05-18T02:29:54Z"},{"alias_kind":"pith_short_12","alias_value":"HS63BWZI7UZQ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HS63BWZI7UZQPOLK","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HS63BWZI","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HS63BWZI7UZQPOLKPMAXAIENQZ","target":"record","payload":{"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"},"canonical_sha256":"3cbdb0db28fd3307b96a7b0170208d8666554c1970f1bd971550c537c2b99c18","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"},"source_kind":"arxiv","source_id":"1501.01327","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-18T02:29:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L1xYUy28NzHF80/CM61qzn4pNDXQfdNk8cxabsTP8tGUuyKIspdWFhuyueTnnZg+0EnYX1skR/OgBL2KkBpECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T03:35:59.655327Z"},"content_sha256":"07783e2a818b53feafd8855b7ef46f40f139b3fcb1bd912e5bc00e919da36392","schema_version":"1.0","event_id":"sha256:07783e2a818b53feafd8855b7ef46f40f139b3fcb1bd912e5bc00e919da36392"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HS63BWZI7UZQPOLKPMAXAIENQZ","target":"graph","payload":{"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"},"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-18T02:29:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YOEv9eagyOdiibup0ZzDpzQoc+oVjJOHRm5h1vOowUug8TZj0pBz7OzsVmsJsN0oIogl18ImgpE7G/yREL1uAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T03:35:59.655693Z"},"content_sha256":"4b2af234adff90ae1f772b6cb6f097eda9541c1f289ae362c728795644a1f0a1","schema_version":"1.0","event_id":"sha256:4b2af234adff90ae1f772b6cb6f097eda9541c1f289ae362c728795644a1f0a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HS63BWZI7UZQPOLKPMAXAIENQZ/bundle.json","state_url":"https://pith.science/pith/HS63BWZI7UZQPOLKPMAXAIENQZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HS63BWZI7UZQPOLKPMAXAIENQZ/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-30T03:35:59Z","links":{"resolver":"https://pith.science/pith/HS63BWZI7UZQPOLKPMAXAIENQZ","bundle":"https://pith.science/pith/HS63BWZI7UZQPOLKPMAXAIENQZ/bundle.json","state":"https://pith.science/pith/HS63BWZI7UZQPOLKPMAXAIENQZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HS63BWZI7UZQPOLKPMAXAIENQZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HS63BWZI7UZQPOLKPMAXAIENQZ","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":"e5ad3f2736a45043e96ede307f51bc7b9408b0857e223201644cc2536451f4a0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-06T22:19:02Z","title_canon_sha256":"af00b4da9c0124d7728299d8ce3deb6f93c4396d0b77d79537947cfc35d3ec55"},"schema_version":"1.0","source":{"id":"1501.01327","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01327","created_at":"2026-05-18T02:29:54Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01327v1","created_at":"2026-05-18T02:29:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01327","created_at":"2026-05-18T02:29:54Z"},{"alias_kind":"pith_short_12","alias_value":"HS63BWZI7UZQ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HS63BWZI7UZQPOLK","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HS63BWZI","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:4b2af234adff90ae1f772b6cb6f097eda9541c1f289ae362c728795644a1f0a1","target":"graph","created_at":"2026-05-18T02:29:54Z","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":"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","authors_text":"Maheshanand Bhaintwal, Rama Krishna Bandi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-06T22:19:02Z","title":"Cyclic codes over $\\mathbb{Z}_4+u\\mathbb{Z}_4$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01327","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:07783e2a818b53feafd8855b7ef46f40f139b3fcb1bd912e5bc00e919da36392","target":"record","created_at":"2026-05-18T02:29:54Z","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":"e5ad3f2736a45043e96ede307f51bc7b9408b0857e223201644cc2536451f4a0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-06T22:19:02Z","title_canon_sha256":"af00b4da9c0124d7728299d8ce3deb6f93c4396d0b77d79537947cfc35d3ec55"},"schema_version":"1.0","source":{"id":"1501.01327","kind":"arxiv","version":1}},"canonical_sha256":"3cbdb0db28fd3307b96a7b0170208d8666554c1970f1bd971550c537c2b99c18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cbdb0db28fd3307b96a7b0170208d8666554c1970f1bd971550c537c2b99c18","first_computed_at":"2026-05-18T02:29:54.518675Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:54.518675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qIhT29JGMfLWJ+aKueNtPG5nnTXVAF+Gc3urx4DBoUb8TTPPHR7JvTCYsmeLxkyUQZ5oZzhwZ8BtuE8A/hHLCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:54.519085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.01327","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07783e2a818b53feafd8855b7ef46f40f139b3fcb1bd912e5bc00e919da36392","sha256:4b2af234adff90ae1f772b6cb6f097eda9541c1f289ae362c728795644a1f0a1"],"state_sha256":"ccf511f5dc69ad95768d874983b56bc4ec317d912f6d4123053050d3f37adf15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NBns53C1kB82WhtrBPj9Lb9uDaPDAXDdss7enNlTmpidwni2sS7JLB6Uj79r+t+jCa1ZuwmjRKWDCo6G+fZmDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T03:35:59.657687Z","bundle_sha256":"8b813ad57e42ffb3e7cb1945e684e829a717c1f95a4484db68f97d315269cfa1"}}