{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Q67BCTG3LED2DWUJEPNMMBQDUM","short_pith_number":"pith:Q67BCTG3","canonical_record":{"source":{"id":"1606.04601","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-15T00:58:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"277f955155ed0df847f9162f32e5a57c2ba00f327bf4ed26e336d6937ecdd10d","abstract_canon_sha256":"acb7e7163f427016747aeba6bb4548009b898924d0e88a96472f7d0a8c237816"},"schema_version":"1.0"},"canonical_sha256":"87be114cdb5907a1da8923dac60603a31a10c5cae27f47664bf98805b6b56d48","source":{"kind":"arxiv","id":"1606.04601","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04601","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04601v2","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04601","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"pith_short_12","alias_value":"Q67BCTG3LED2","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q67BCTG3LED2DWUJ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q67BCTG3","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Q67BCTG3LED2DWUJEPNMMBQDUM","target":"record","payload":{"canonical_record":{"source":{"id":"1606.04601","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-15T00:58:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"277f955155ed0df847f9162f32e5a57c2ba00f327bf4ed26e336d6937ecdd10d","abstract_canon_sha256":"acb7e7163f427016747aeba6bb4548009b898924d0e88a96472f7d0a8c237816"},"schema_version":"1.0"},"canonical_sha256":"87be114cdb5907a1da8923dac60603a31a10c5cae27f47664bf98805b6b56d48","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:22.335271Z","signature_b64":"3UNl+K1RoAbNy/liQ8zVZXEyn2xdxL5hFeM84UyMn2lXRcy8K/TKLLCMeJA+tpotBWdyMxBi5VpQr46IWbkzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87be114cdb5907a1da8923dac60603a31a10c5cae27f47664bf98805b6b56d48","last_reissued_at":"2026-05-18T01:12:22.334937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:22.334937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.04601","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-18T01:12:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bK3L8S9tvy6m8Uc8ZtCHbBMPF/wc+i+xErdplDlA2oeRrrXn+FCucUl0/F0HdNR7PmXy9FrwE0vn+5L+0PJWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:32:38.884778Z"},"content_sha256":"01881ee5389bc324ecbafe634af2c2944304680c534e50901698fedb54a685eb","schema_version":"1.0","event_id":"sha256:01881ee5389bc324ecbafe634af2c2944304680c534e50901698fedb54a685eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Q67BCTG3LED2DWUJEPNMMBQDUM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cyclic codes over $\\mathbb{Z}_4[u]/\\langle u^k\\rangle$ of odd length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cao Yuan, Li Qingguo","submitted_at":"2016-06-15T00:58:19Z","abstract_excerpt":"Let $R=\\mathbb{Z}_{4}[u]/\\langle u^k\\rangle=\\mathbb{Z}_{4}+u\\mathbb{Z}_{4}+\\ldots+u^{k-1}\\mathbb{Z}_{4}$ ($u^k=0$) where $k\\in \\mathbb{Z}^{+}$ satisfies $k\\geq 2$. For any odd positive integer $n$, it is known that cyclic codes over $R$ of length $n$ are identified with ideals of the ring $R[x]/\\langle x^{n}-1\\rangle$. In this paper, an explicit representation for each cyclic code over $R$ of length $n$ is provided and a formula to count the number of codewords in each code is given. Then a formula to calculate the number of cyclic codes over $R$ of length $n$ is obtained. Precisely, the dual "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04601","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-18T01:12:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A7ROaC6IVFBRLCDT54CiYNNi56USAysF53Jb8rVfnS5+kOiRecymWgHu2n+NAQc1fNMiGukzW1tET+F6CpZuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:32:38.885478Z"},"content_sha256":"68da71cbc702fdb26155555db4973ee7bb6bf2fb4019ffe5acbf9cfe3605452c","schema_version":"1.0","event_id":"sha256:68da71cbc702fdb26155555db4973ee7bb6bf2fb4019ffe5acbf9cfe3605452c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q67BCTG3LED2DWUJEPNMMBQDUM/bundle.json","state_url":"https://pith.science/pith/Q67BCTG3LED2DWUJEPNMMBQDUM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q67BCTG3LED2DWUJEPNMMBQDUM/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-05-29T14:32:38Z","links":{"resolver":"https://pith.science/pith/Q67BCTG3LED2DWUJEPNMMBQDUM","bundle":"https://pith.science/pith/Q67BCTG3LED2DWUJEPNMMBQDUM/bundle.json","state":"https://pith.science/pith/Q67BCTG3LED2DWUJEPNMMBQDUM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q67BCTG3LED2DWUJEPNMMBQDUM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Q67BCTG3LED2DWUJEPNMMBQDUM","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":"acb7e7163f427016747aeba6bb4548009b898924d0e88a96472f7d0a8c237816","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-15T00:58:19Z","title_canon_sha256":"277f955155ed0df847f9162f32e5a57c2ba00f327bf4ed26e336d6937ecdd10d"},"schema_version":"1.0","source":{"id":"1606.04601","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04601","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04601v2","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04601","created_at":"2026-05-18T01:12:22Z"},{"alias_kind":"pith_short_12","alias_value":"Q67BCTG3LED2","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q67BCTG3LED2DWUJ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q67BCTG3","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:68da71cbc702fdb26155555db4973ee7bb6bf2fb4019ffe5acbf9cfe3605452c","target":"graph","created_at":"2026-05-18T01:12:22Z","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":"Let $R=\\mathbb{Z}_{4}[u]/\\langle u^k\\rangle=\\mathbb{Z}_{4}+u\\mathbb{Z}_{4}+\\ldots+u^{k-1}\\mathbb{Z}_{4}$ ($u^k=0$) where $k\\in \\mathbb{Z}^{+}$ satisfies $k\\geq 2$. For any odd positive integer $n$, it is known that cyclic codes over $R$ of length $n$ are identified with ideals of the ring $R[x]/\\langle x^{n}-1\\rangle$. In this paper, an explicit representation for each cyclic code over $R$ of length $n$ is provided and a formula to count the number of codewords in each code is given. Then a formula to calculate the number of cyclic codes over $R$ of length $n$ is obtained. Precisely, the dual ","authors_text":"Cao Yuan, Li Qingguo","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-15T00:58:19Z","title":"Cyclic codes over $\\mathbb{Z}_4[u]/\\langle u^k\\rangle$ of odd length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04601","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:01881ee5389bc324ecbafe634af2c2944304680c534e50901698fedb54a685eb","target":"record","created_at":"2026-05-18T01:12:22Z","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":"acb7e7163f427016747aeba6bb4548009b898924d0e88a96472f7d0a8c237816","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-15T00:58:19Z","title_canon_sha256":"277f955155ed0df847f9162f32e5a57c2ba00f327bf4ed26e336d6937ecdd10d"},"schema_version":"1.0","source":{"id":"1606.04601","kind":"arxiv","version":2}},"canonical_sha256":"87be114cdb5907a1da8923dac60603a31a10c5cae27f47664bf98805b6b56d48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87be114cdb5907a1da8923dac60603a31a10c5cae27f47664bf98805b6b56d48","first_computed_at":"2026-05-18T01:12:22.334937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:22.334937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3UNl+K1RoAbNy/liQ8zVZXEyn2xdxL5hFeM84UyMn2lXRcy8K/TKLLCMeJA+tpotBWdyMxBi5VpQr46IWbkzDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:22.335271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.04601","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01881ee5389bc324ecbafe634af2c2944304680c534e50901698fedb54a685eb","sha256:68da71cbc702fdb26155555db4973ee7bb6bf2fb4019ffe5acbf9cfe3605452c"],"state_sha256":"4d6bbfaf1d03b8274cde268c486207633e732a2cb020a884c5642fdb4f994ee1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AZ5XH+EB3cSZn6i2bzzRilCJ3LxzaYLW0YJOU5TkJq4s7u1tClux05ueG1ocBslCHDmsiL6Id/7aSzA+b+ebDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:32:38.888956Z","bundle_sha256":"9c84e2b8f6a557af64bf173b5562f3fb53b09505c5672aea37e916cb97df8f44"}}