{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DEXLH2SJ76VQP3WHK3FTCJNRPC","short_pith_number":"pith:DEXLH2SJ","canonical_record":{"source":{"id":"1511.05413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-17T14:23:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"44322e1fe679ccabeb4e56c067ffa613700abe6d413b00f11093cc1c3af878c2","abstract_canon_sha256":"6c9d8b222bc6418e32e57bc7911feaeb7442d54afb15e7782030cd9e84769280"},"schema_version":"1.0"},"canonical_sha256":"192eb3ea49ffab07eec756cb3125b178a068db7ee779287657fdbfa4cfb001a2","source":{"kind":"arxiv","id":"1511.05413","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05413","created_at":"2026-05-18T01:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05413v1","created_at":"2026-05-18T01:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05413","created_at":"2026-05-18T01:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"DEXLH2SJ76VQ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DEXLH2SJ76VQP3WH","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DEXLH2SJ","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DEXLH2SJ76VQP3WHK3FTCJNRPC","target":"record","payload":{"canonical_record":{"source":{"id":"1511.05413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-17T14:23:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"44322e1fe679ccabeb4e56c067ffa613700abe6d413b00f11093cc1c3af878c2","abstract_canon_sha256":"6c9d8b222bc6418e32e57bc7911feaeb7442d54afb15e7782030cd9e84769280"},"schema_version":"1.0"},"canonical_sha256":"192eb3ea49ffab07eec756cb3125b178a068db7ee779287657fdbfa4cfb001a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:40.311625Z","signature_b64":"6yGaKkimYqcRwifWQa70xLz/AbKMkZwSUtCrAxWqlFoYERm4OrK3ZK1aQEsXbRR+LiLUYQiInKb43zZu/ijHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"192eb3ea49ffab07eec756cb3125b178a068db7ee779287657fdbfa4cfb001a2","last_reissued_at":"2026-05-18T01:26:40.310907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:40.310907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.05413","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-18T01:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s0ye1lx5THeXiAwZSyrbZqMf6RJT/HBZ5vtlppxP9lV3F/jxzbnSIekcUYFag17pKMOxJZqRcViJFIyxhYE1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:00:35.703182Z"},"content_sha256":"ecff5b4f76ca2dcc64eb533c504c779b241b493a414ba8bf65ed301ec886755c","schema_version":"1.0","event_id":"sha256:ecff5b4f76ca2dcc64eb533c504c779b241b493a414ba8bf65ed301ec886755c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DEXLH2SJ76VQP3WHK3FTCJNRPC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cyclic codes over $\\mathbb{F}_{2^m}[u]/\\langle u^k\\rangle$ of oddly even length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Yonglin Cao, Yuan Cao","submitted_at":"2015-11-17T14:23:45Z","abstract_excerpt":"Let $\\mathbb{F}_{2^m}$ be a finite field of characteristic $2$ and $R=\\mathbb{F}_{2^m}[u]/\\langle u^k\\rangle=\\mathbb{F}_{2^m} +u\\mathbb{F}_{2^m}+\\ldots+u^{k-1}\\mathbb{F}_{2^m}$ ($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 $2n$ are identified with ideals of the ring $R[x]/\\langle x^{2n}-1\\rangle$. In this paper, an explicit representation for each cyclic code over $R$ of length $2n$ is provided and a formula to count the number of codewords in each code is given. Then a formula to calculate the numb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05413","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-18T01:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u2Xr0s1aQgqRuSvrnAAzrJSAC4eUtjDuKpaIlP3Y7rfKEp5HSSNNDRJPkIpGVTY2bysp7n3dVz1bNBULBWU8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:00:35.703543Z"},"content_sha256":"b0d41560662c1a02471b898b49f207b322346cea3dc10e91d62d70980b140889","schema_version":"1.0","event_id":"sha256:b0d41560662c1a02471b898b49f207b322346cea3dc10e91d62d70980b140889"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DEXLH2SJ76VQP3WHK3FTCJNRPC/bundle.json","state_url":"https://pith.science/pith/DEXLH2SJ76VQP3WHK3FTCJNRPC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DEXLH2SJ76VQP3WHK3FTCJNRPC/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-01T19:00:35Z","links":{"resolver":"https://pith.science/pith/DEXLH2SJ76VQP3WHK3FTCJNRPC","bundle":"https://pith.science/pith/DEXLH2SJ76VQP3WHK3FTCJNRPC/bundle.json","state":"https://pith.science/pith/DEXLH2SJ76VQP3WHK3FTCJNRPC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DEXLH2SJ76VQP3WHK3FTCJNRPC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DEXLH2SJ76VQP3WHK3FTCJNRPC","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":"6c9d8b222bc6418e32e57bc7911feaeb7442d54afb15e7782030cd9e84769280","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-17T14:23:45Z","title_canon_sha256":"44322e1fe679ccabeb4e56c067ffa613700abe6d413b00f11093cc1c3af878c2"},"schema_version":"1.0","source":{"id":"1511.05413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05413","created_at":"2026-05-18T01:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05413v1","created_at":"2026-05-18T01:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05413","created_at":"2026-05-18T01:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"DEXLH2SJ76VQ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DEXLH2SJ76VQP3WH","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DEXLH2SJ","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:b0d41560662c1a02471b898b49f207b322346cea3dc10e91d62d70980b140889","target":"graph","created_at":"2026-05-18T01:26:40Z","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 $\\mathbb{F}_{2^m}$ be a finite field of characteristic $2$ and $R=\\mathbb{F}_{2^m}[u]/\\langle u^k\\rangle=\\mathbb{F}_{2^m} +u\\mathbb{F}_{2^m}+\\ldots+u^{k-1}\\mathbb{F}_{2^m}$ ($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 $2n$ are identified with ideals of the ring $R[x]/\\langle x^{2n}-1\\rangle$. In this paper, an explicit representation for each cyclic code over $R$ of length $2n$ is provided and a formula to count the number of codewords in each code is given. Then a formula to calculate the numb","authors_text":"Fang-Wei Fu, Yonglin Cao, Yuan Cao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-17T14:23:45Z","title":"Cyclic codes over $\\mathbb{F}_{2^m}[u]/\\langle u^k\\rangle$ of oddly even length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05413","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:ecff5b4f76ca2dcc64eb533c504c779b241b493a414ba8bf65ed301ec886755c","target":"record","created_at":"2026-05-18T01:26:40Z","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":"6c9d8b222bc6418e32e57bc7911feaeb7442d54afb15e7782030cd9e84769280","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-17T14:23:45Z","title_canon_sha256":"44322e1fe679ccabeb4e56c067ffa613700abe6d413b00f11093cc1c3af878c2"},"schema_version":"1.0","source":{"id":"1511.05413","kind":"arxiv","version":1}},"canonical_sha256":"192eb3ea49ffab07eec756cb3125b178a068db7ee779287657fdbfa4cfb001a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"192eb3ea49ffab07eec756cb3125b178a068db7ee779287657fdbfa4cfb001a2","first_computed_at":"2026-05-18T01:26:40.310907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:40.310907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6yGaKkimYqcRwifWQa70xLz/AbKMkZwSUtCrAxWqlFoYERm4OrK3ZK1aQEsXbRR+LiLUYQiInKb43zZu/ijHAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:40.311625Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecff5b4f76ca2dcc64eb533c504c779b241b493a414ba8bf65ed301ec886755c","sha256:b0d41560662c1a02471b898b49f207b322346cea3dc10e91d62d70980b140889"],"state_sha256":"cea1e7f5da84d4d46c1c49d90b56247f885ad8021926f8861fc2bfbf3c42b3f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ODg4dc2yHEVmZlwuu4G++TT6MxRhEWn7q3TDdWpjaAjNo7KOzGglujSNLHYwbYKT4RkaTSNIumECfaR3z9k9Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:00:35.705616Z","bundle_sha256":"3b2e4cdcd69da4ea03791bbaddcb8d932013d821de991f532f6ed76c91f234d6"}}