{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MKVCRYHS7UATMGORIO5GPQRWBL","short_pith_number":"pith:MKVCRYHS","schema_version":"1.0","canonical_sha256":"62aa28e0f2fd013619d143ba67c2360af465ed5b25e5bb78975631d0c7a27fbd","source":{"kind":"arxiv","id":"1811.10991","version":2},"attestation_state":"computed","paper":{"title":"An explicit representation and enumeration for negacyclic codes of length $2^kn$ 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":"Fang-Wei Fu, Rama Krishna Bandi, Yonglin Cao, Yuan Cao","submitted_at":"2018-11-27T14:05:20Z","abstract_excerpt":"In this paper, an explicit representation and enumeration for negacyclic codes of length $2^kn$ over the local non-principal ideal ring $R=\\mathbb{Z}_4+u\\mathbb{Z}_4$ $(u^2=0)$ is provided, where $k, n$ are any positive integers and $n$ is odd. As a corollary, all distinct negacyclic codes of length $2^k$ over $R$ are listed precisely. Moreover, a mass formula for the number of negacyclic codes of length $2^kn$ over $R$ is given and a mistake in [Cryptogr. Commun. (2017) 9: 241--272] is corrected."},"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":"1811.10991","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-27T14:05:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"edb6e4642b98fe8d1829d6e3748b6309e4037ad347f054371e096dd30832bf12","abstract_canon_sha256":"da7d0b531e6d59f69e3497cb2204a464d013ec6753fcf58a67854a01b2ef1fc5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:05.245190Z","signature_b64":"uBTYdgT+LDgf8TlshMVfRhpV7fCBMK7mstrUcpAnpr29lefdgcSgBTm9uRoniJW88u4rdIdG0gdUhZvtpRgTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62aa28e0f2fd013619d143ba67c2360af465ed5b25e5bb78975631d0c7a27fbd","last_reissued_at":"2026-05-17T23:51:05.244468Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:05.244468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An explicit representation and enumeration for negacyclic codes of length $2^kn$ 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":"Fang-Wei Fu, Rama Krishna Bandi, Yonglin Cao, Yuan Cao","submitted_at":"2018-11-27T14:05:20Z","abstract_excerpt":"In this paper, an explicit representation and enumeration for negacyclic codes of length $2^kn$ over the local non-principal ideal ring $R=\\mathbb{Z}_4+u\\mathbb{Z}_4$ $(u^2=0)$ is provided, where $k, n$ are any positive integers and $n$ is odd. As a corollary, all distinct negacyclic codes of length $2^k$ over $R$ are listed precisely. Moreover, a mass formula for the number of negacyclic codes of length $2^kn$ over $R$ is given and a mistake in [Cryptogr. Commun. (2017) 9: 241--272] is corrected."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10991","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":"1811.10991","created_at":"2026-05-17T23:51:05.244586+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.10991v2","created_at":"2026-05-17T23:51:05.244586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10991","created_at":"2026-05-17T23:51:05.244586+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKVCRYHS7UAT","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKVCRYHS7UATMGOR","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKVCRYHS","created_at":"2026-05-18T12:32:37.024351+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/MKVCRYHS7UATMGORIO5GPQRWBL","json":"https://pith.science/pith/MKVCRYHS7UATMGORIO5GPQRWBL.json","graph_json":"https://pith.science/api/pith-number/MKVCRYHS7UATMGORIO5GPQRWBL/graph.json","events_json":"https://pith.science/api/pith-number/MKVCRYHS7UATMGORIO5GPQRWBL/events.json","paper":"https://pith.science/paper/MKVCRYHS"},"agent_actions":{"view_html":"https://pith.science/pith/MKVCRYHS7UATMGORIO5GPQRWBL","download_json":"https://pith.science/pith/MKVCRYHS7UATMGORIO5GPQRWBL.json","view_paper":"https://pith.science/paper/MKVCRYHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.10991&json=true","fetch_graph":"https://pith.science/api/pith-number/MKVCRYHS7UATMGORIO5GPQRWBL/graph.json","fetch_events":"https://pith.science/api/pith-number/MKVCRYHS7UATMGORIO5GPQRWBL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKVCRYHS7UATMGORIO5GPQRWBL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKVCRYHS7UATMGORIO5GPQRWBL/action/storage_attestation","attest_author":"https://pith.science/pith/MKVCRYHS7UATMGORIO5GPQRWBL/action/author_attestation","sign_citation":"https://pith.science/pith/MKVCRYHS7UATMGORIO5GPQRWBL/action/citation_signature","submit_replication":"https://pith.science/pith/MKVCRYHS7UATMGORIO5GPQRWBL/action/replication_record"}},"created_at":"2026-05-17T23:51:05.244586+00:00","updated_at":"2026-05-17T23:51:05.244586+00:00"}