{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MKVCRYHS7UATMGORIO5GPQRWBL","short_pith_number":"pith:MKVCRYHS","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"},"canonical_sha256":"62aa28e0f2fd013619d143ba67c2360af465ed5b25e5bb78975631d0c7a27fbd","source":{"kind":"arxiv","id":"1811.10991","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10991","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10991v2","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10991","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"pith_short_12","alias_value":"MKVCRYHS7UAT","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MKVCRYHS7UATMGOR","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MKVCRYHS","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MKVCRYHS7UATMGORIO5GPQRWBL","target":"record","payload":{"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"},"canonical_sha256":"62aa28e0f2fd013619d143ba67c2360af465ed5b25e5bb78975631d0c7a27fbd","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"},"source_kind":"arxiv","source_id":"1811.10991","source_version":2,"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-17T23:51:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x3fgxMiEzhtw9qjO1vCuyIsTEN99HUtdPdxN362SA8tK0dNqdIvYgN8o1PRaQdZ/cYHBEZjZcZ1lW0g05clWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:21:06.595094Z"},"content_sha256":"a47c2219156672d5f98ff28c04aad6bd0ed44c74938f826e5900ed68937c5c50","schema_version":"1.0","event_id":"sha256:a47c2219156672d5f98ff28c04aad6bd0ed44c74938f826e5900ed68937c5c50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MKVCRYHS7UATMGORIO5GPQRWBL","target":"graph","payload":{"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"},"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-17T23:51:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Dgz3ZirM7Pjjr5t3LHiNMJ4oCVZWVDoAsTGOcNNkIP1fMb2E2ZDmNIaZZ8f6E0VnxvEzYn/HIB7sVwR+kCvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:21:06.595453Z"},"content_sha256":"241fe440bc87b914451ccb0eeff76b10c845f56df66d5dc3777c7a2807591c38","schema_version":"1.0","event_id":"sha256:241fe440bc87b914451ccb0eeff76b10c845f56df66d5dc3777c7a2807591c38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MKVCRYHS7UATMGORIO5GPQRWBL/bundle.json","state_url":"https://pith.science/pith/MKVCRYHS7UATMGORIO5GPQRWBL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MKVCRYHS7UATMGORIO5GPQRWBL/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-01T21:21:06Z","links":{"resolver":"https://pith.science/pith/MKVCRYHS7UATMGORIO5GPQRWBL","bundle":"https://pith.science/pith/MKVCRYHS7UATMGORIO5GPQRWBL/bundle.json","state":"https://pith.science/pith/MKVCRYHS7UATMGORIO5GPQRWBL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MKVCRYHS7UATMGORIO5GPQRWBL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MKVCRYHS7UATMGORIO5GPQRWBL","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":"da7d0b531e6d59f69e3497cb2204a464d013ec6753fcf58a67854a01b2ef1fc5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-27T14:05:20Z","title_canon_sha256":"edb6e4642b98fe8d1829d6e3748b6309e4037ad347f054371e096dd30832bf12"},"schema_version":"1.0","source":{"id":"1811.10991","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10991","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10991v2","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10991","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"pith_short_12","alias_value":"MKVCRYHS7UAT","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MKVCRYHS7UATMGOR","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MKVCRYHS","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:241fe440bc87b914451ccb0eeff76b10c845f56df66d5dc3777c7a2807591c38","target":"graph","created_at":"2026-05-17T23:51:05Z","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, 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.","authors_text":"Fang-Wei Fu, Rama Krishna Bandi, Yonglin Cao, Yuan Cao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-27T14:05:20Z","title":"An explicit representation and enumeration for negacyclic codes of length $2^kn$ over $\\mathbb{Z}_4+u\\mathbb{Z}_4$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10991","kind":"arxiv","version":2},"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:a47c2219156672d5f98ff28c04aad6bd0ed44c74938f826e5900ed68937c5c50","target":"record","created_at":"2026-05-17T23:51:05Z","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":"da7d0b531e6d59f69e3497cb2204a464d013ec6753fcf58a67854a01b2ef1fc5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-27T14:05:20Z","title_canon_sha256":"edb6e4642b98fe8d1829d6e3748b6309e4037ad347f054371e096dd30832bf12"},"schema_version":"1.0","source":{"id":"1811.10991","kind":"arxiv","version":2}},"canonical_sha256":"62aa28e0f2fd013619d143ba67c2360af465ed5b25e5bb78975631d0c7a27fbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62aa28e0f2fd013619d143ba67c2360af465ed5b25e5bb78975631d0c7a27fbd","first_computed_at":"2026-05-17T23:51:05.244468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:05.244468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uBTYdgT+LDgf8TlshMVfRhpV7fCBMK7mstrUcpAnpr29lefdgcSgBTm9uRoniJW88u4rdIdG0gdUhZvtpRgTBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:05.245190Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10991","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a47c2219156672d5f98ff28c04aad6bd0ed44c74938f826e5900ed68937c5c50","sha256:241fe440bc87b914451ccb0eeff76b10c845f56df66d5dc3777c7a2807591c38"],"state_sha256":"652205de8dc8b726e1689cb116a406247228655ec961f2b1171c2ee1b9d75ff8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fdt3EwGXTvJ35AXH759Q72dXI1hOiP/V5sTL0m5/s4qahPF49Epzu8TnevGPN/GiTzdchiB2/iEdKH1iQM0gBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:21:06.597382Z","bundle_sha256":"f4fd67473ebc302bbc7470b57c712e451d05f9c9069e75141e9099e34356b21c"}}