{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WQS3HRAGWB22RVB5EYOHFFCDAV","short_pith_number":"pith:WQS3HRAG","canonical_record":{"source":{"id":"1412.3751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-11T18:28:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cbc1e68890b14900e9948b3d0c055d01836fb31b52a44fedcd113c4ad6c94110","abstract_canon_sha256":"a32d19569c441ba11e7471e632e6e4d899e2df8c7bed938198bd0e34e928d9c0"},"schema_version":"1.0"},"canonical_sha256":"b425b3c406b075a8d43d261c7294430545a9575dec36e27ebbd5ae27261cc288","source":{"kind":"arxiv","id":"1412.3751","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3751","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3751v1","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3751","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"WQS3HRAGWB22","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WQS3HRAGWB22RVB5","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WQS3HRAG","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WQS3HRAGWB22RVB5EYOHFFCDAV","target":"record","payload":{"canonical_record":{"source":{"id":"1412.3751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-11T18:28:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cbc1e68890b14900e9948b3d0c055d01836fb31b52a44fedcd113c4ad6c94110","abstract_canon_sha256":"a32d19569c441ba11e7471e632e6e4d899e2df8c7bed938198bd0e34e928d9c0"},"schema_version":"1.0"},"canonical_sha256":"b425b3c406b075a8d43d261c7294430545a9575dec36e27ebbd5ae27261cc288","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:30.412281Z","signature_b64":"Fyo0fjNINrXh8Z1wqoTlQ5a1u2OX5/iATNkyhLkZV9B6hU9ZuM/PZlchhztK+nS+VEzkmfikgBD8mMxokZa4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b425b3c406b075a8d43d261c7294430545a9575dec36e27ebbd5ae27261cc288","last_reissued_at":"2026-05-18T02:31:30.411862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:30.411862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.3751","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:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z+uRXwIJkguqTMea9840hw2VeEkuvzGzCGZVFUxuFTwxXYvWuhVmDMxPUIj3C3Pl6sEKydtMV/9cOmo2Ijr9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T04:39:45.512705Z"},"content_sha256":"922229c9141e5a32c0d85715d620c88c69f72b8874c2866962f1b4e110d8d310","schema_version":"1.0","event_id":"sha256:922229c9141e5a32c0d85715d620c88c69f72b8874c2866962f1b4e110d8d310"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WQS3HRAGWB22RVB5EYOHFFCDAV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Negacyclic codes over Z4+uZ4","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":"2014-12-11T18:28:49Z","abstract_excerpt":"In this paper, we study negacyclic codes of odd length and of length $2^k$ over the ring $R=\\mathbb{Z}_4+u\\mathbb{Z}_4$, $u^2=0$. We give the complete structure of negacyclic codes for both the cases. We have obtained a minimal spanning set for negacyclic codes of odd lengths over $R$. A necessary and sufficient condition for negacyclic codes of odd lengths to be free is presented. We have determined the cardinality of negacyclic codes in each case. We have obtained the structure of the duals of negacyclic codes of length $2^k$ over $R$ and also characterized self-dual negacyclic codes of leng"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3751","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:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oh+jpVsAE4ixBGa6DskyjcSzRXkjlUdMsrufBB7+NpI/a1DRt0qNPa1u6DHEN6vrnM9tYsmhuq5L+hZO5vc3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T04:39:45.513046Z"},"content_sha256":"76732db63ee0aed1146297ea63463cd97e357a9050af950f1ebfe8202521dc53","schema_version":"1.0","event_id":"sha256:76732db63ee0aed1146297ea63463cd97e357a9050af950f1ebfe8202521dc53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WQS3HRAGWB22RVB5EYOHFFCDAV/bundle.json","state_url":"https://pith.science/pith/WQS3HRAGWB22RVB5EYOHFFCDAV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WQS3HRAGWB22RVB5EYOHFFCDAV/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-30T04:39:45Z","links":{"resolver":"https://pith.science/pith/WQS3HRAGWB22RVB5EYOHFFCDAV","bundle":"https://pith.science/pith/WQS3HRAGWB22RVB5EYOHFFCDAV/bundle.json","state":"https://pith.science/pith/WQS3HRAGWB22RVB5EYOHFFCDAV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WQS3HRAGWB22RVB5EYOHFFCDAV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WQS3HRAGWB22RVB5EYOHFFCDAV","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":"a32d19569c441ba11e7471e632e6e4d899e2df8c7bed938198bd0e34e928d9c0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-11T18:28:49Z","title_canon_sha256":"cbc1e68890b14900e9948b3d0c055d01836fb31b52a44fedcd113c4ad6c94110"},"schema_version":"1.0","source":{"id":"1412.3751","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3751","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3751v1","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3751","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"WQS3HRAGWB22","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WQS3HRAGWB22RVB5","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WQS3HRAG","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:76732db63ee0aed1146297ea63463cd97e357a9050af950f1ebfe8202521dc53","target":"graph","created_at":"2026-05-18T02:31:30Z","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 study negacyclic codes of odd length and of length $2^k$ over the ring $R=\\mathbb{Z}_4+u\\mathbb{Z}_4$, $u^2=0$. We give the complete structure of negacyclic codes for both the cases. We have obtained a minimal spanning set for negacyclic codes of odd lengths over $R$. A necessary and sufficient condition for negacyclic codes of odd lengths to be free is presented. We have determined the cardinality of negacyclic codes in each case. We have obtained the structure of the duals of negacyclic codes of length $2^k$ over $R$ and also characterized self-dual negacyclic codes of leng","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":"2014-12-11T18:28:49Z","title":"Negacyclic codes over Z4+uZ4"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3751","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:922229c9141e5a32c0d85715d620c88c69f72b8874c2866962f1b4e110d8d310","target":"record","created_at":"2026-05-18T02:31:30Z","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":"a32d19569c441ba11e7471e632e6e4d899e2df8c7bed938198bd0e34e928d9c0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-11T18:28:49Z","title_canon_sha256":"cbc1e68890b14900e9948b3d0c055d01836fb31b52a44fedcd113c4ad6c94110"},"schema_version":"1.0","source":{"id":"1412.3751","kind":"arxiv","version":1}},"canonical_sha256":"b425b3c406b075a8d43d261c7294430545a9575dec36e27ebbd5ae27261cc288","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b425b3c406b075a8d43d261c7294430545a9575dec36e27ebbd5ae27261cc288","first_computed_at":"2026-05-18T02:31:30.411862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:30.411862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fyo0fjNINrXh8Z1wqoTlQ5a1u2OX5/iATNkyhLkZV9B6hU9ZuM/PZlchhztK+nS+VEzkmfikgBD8mMxokZa4Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:30.412281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.3751","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:922229c9141e5a32c0d85715d620c88c69f72b8874c2866962f1b4e110d8d310","sha256:76732db63ee0aed1146297ea63463cd97e357a9050af950f1ebfe8202521dc53"],"state_sha256":"614076f2781a622148c2a3682e61e3ee86ddfd2e012325aba93315784a521ac8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"34qUnInhwOmgZ3sVZR2ifrz+QK1C/N5z8vBOLbjEB0g79JPrzNk0pukNh4uUpw9Fk79kgA4rdB1VhqUHpQH6CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T04:39:45.515023Z","bundle_sha256":"149c0a1831151450de683d84c065086e0ee7e592df1b19bcfedc49019eec04f2"}}