{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YPNPTGUREJKJW5QMUIUN27N7I5","short_pith_number":"pith:YPNPTGUR","canonical_record":{"source":{"id":"1905.03621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-08T13:00:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d1e937231b206752c5b45b8e802043101f782313d237fb83f03214a3096dc708","abstract_canon_sha256":"5df29f198a62a14ea9a099fb3b127fa206165c8465a7ed53dcc0d0e0b2f56a4e"},"schema_version":"1.0"},"canonical_sha256":"c3daf99a9122549b760ca228dd7dbf4743543780124f994c5ab69e4713c17eb3","source":{"kind":"arxiv","id":"1905.03621","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03621","created_at":"2026-05-17T23:46:37Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03621v1","created_at":"2026-05-17T23:46:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03621","created_at":"2026-05-17T23:46:37Z"},{"alias_kind":"pith_short_12","alias_value":"YPNPTGUREJKJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YPNPTGUREJKJW5QM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YPNPTGUR","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YPNPTGUREJKJW5QMUIUN27N7I5","target":"record","payload":{"canonical_record":{"source":{"id":"1905.03621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-08T13:00:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d1e937231b206752c5b45b8e802043101f782313d237fb83f03214a3096dc708","abstract_canon_sha256":"5df29f198a62a14ea9a099fb3b127fa206165c8465a7ed53dcc0d0e0b2f56a4e"},"schema_version":"1.0"},"canonical_sha256":"c3daf99a9122549b760ca228dd7dbf4743543780124f994c5ab69e4713c17eb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:37.164509Z","signature_b64":"9q0eELsF41Aqsy+fUWpeCkbd8jZwWNKFXiKFshglyywV7jYFAwkBkLGVONjd1glzXu+3W2sbB6+LZS8UJz5jDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3daf99a9122549b760ca228dd7dbf4743543780124f994c5ab69e4713c17eb3","last_reissued_at":"2026-05-17T23:46:37.164012Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:37.164012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.03621","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-17T23:46:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5jLCQBTIpD5n11hXVW3A5xkO98cyMpcd6EsmPJ44mZapOsAHmib61Kq/3B5+SL4egee8tPkv1IECYwZNnuV7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:12:46.185378Z"},"content_sha256":"b9ff261208b5043f7212814c102668f372da29ddb270525d682e4c4687f8c93e","schema_version":"1.0","event_id":"sha256:b9ff261208b5043f7212814c102668f372da29ddb270525d682e4c4687f8c93e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YPNPTGUREJKJW5QMUIUN27N7I5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Explicit representation for a class of Type 2 constacyclic codes over the ring $\\mathbb{F}_{2^m}[u]/\\langle u^{2\\lambda}\\rangle$ with even length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guidong Wang, Hai Q. Dinh, Songsak Sriboonchitta, Yonglin Cao, Yuan Cao","submitted_at":"2019-05-08T13:00:02Z","abstract_excerpt":"Let $\\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $\\lambda$ and $k$ be integers satisfying $\\lambda,k\\geq 2$ and denote $R=\\mathbb{F}_{2^m}[u]/\\langle u^{2\\lambda}\\rangle$. Let $\\delta,\\alpha\\in \\mathbb{F}_{2^m}^{\\times}$. For any odd positive integer $n$, we give an explicit representation and enumeration for all distinct $(\\delta+\\alpha u^2)$-constacyclic codes over $R$ of length $2^kn$, and provide a clear formula to count the number of all these codes. As a corollary, we conclude that every $(\\delta+\\alpha u^2)$-constacyclic code over $R$ of length $2^kn$ is an ideal generated"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03621","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-17T23:46:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QBuFnEA4Wc3/dinmT72SBJmoA8MdEjXevo/NPP2qG1KD7jbbV+kspmhxBI8MIKAVi9Hf8KVTAm2PtAku6p2VAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:12:46.185731Z"},"content_sha256":"d1fbb6331120d0fd55f2eb9a4747df33d904e881021b7430500f665deb066acc","schema_version":"1.0","event_id":"sha256:d1fbb6331120d0fd55f2eb9a4747df33d904e881021b7430500f665deb066acc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YPNPTGUREJKJW5QMUIUN27N7I5/bundle.json","state_url":"https://pith.science/pith/YPNPTGUREJKJW5QMUIUN27N7I5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YPNPTGUREJKJW5QMUIUN27N7I5/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:12:46Z","links":{"resolver":"https://pith.science/pith/YPNPTGUREJKJW5QMUIUN27N7I5","bundle":"https://pith.science/pith/YPNPTGUREJKJW5QMUIUN27N7I5/bundle.json","state":"https://pith.science/pith/YPNPTGUREJKJW5QMUIUN27N7I5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YPNPTGUREJKJW5QMUIUN27N7I5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YPNPTGUREJKJW5QMUIUN27N7I5","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":"5df29f198a62a14ea9a099fb3b127fa206165c8465a7ed53dcc0d0e0b2f56a4e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-08T13:00:02Z","title_canon_sha256":"d1e937231b206752c5b45b8e802043101f782313d237fb83f03214a3096dc708"},"schema_version":"1.0","source":{"id":"1905.03621","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03621","created_at":"2026-05-17T23:46:37Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03621v1","created_at":"2026-05-17T23:46:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03621","created_at":"2026-05-17T23:46:37Z"},{"alias_kind":"pith_short_12","alias_value":"YPNPTGUREJKJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YPNPTGUREJKJW5QM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YPNPTGUR","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:d1fbb6331120d0fd55f2eb9a4747df33d904e881021b7430500f665deb066acc","target":"graph","created_at":"2026-05-17T23:46:37Z","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 cardinality $2^m$, $\\lambda$ and $k$ be integers satisfying $\\lambda,k\\geq 2$ and denote $R=\\mathbb{F}_{2^m}[u]/\\langle u^{2\\lambda}\\rangle$. Let $\\delta,\\alpha\\in \\mathbb{F}_{2^m}^{\\times}$. For any odd positive integer $n$, we give an explicit representation and enumeration for all distinct $(\\delta+\\alpha u^2)$-constacyclic codes over $R$ of length $2^kn$, and provide a clear formula to count the number of all these codes. As a corollary, we conclude that every $(\\delta+\\alpha u^2)$-constacyclic code over $R$ of length $2^kn$ is an ideal generated","authors_text":"Guidong Wang, Hai Q. Dinh, Songsak Sriboonchitta, Yonglin Cao, Yuan Cao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-08T13:00:02Z","title":"Explicit representation for a class of Type 2 constacyclic codes over the ring $\\mathbb{F}_{2^m}[u]/\\langle u^{2\\lambda}\\rangle$ with even length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03621","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:b9ff261208b5043f7212814c102668f372da29ddb270525d682e4c4687f8c93e","target":"record","created_at":"2026-05-17T23:46:37Z","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":"5df29f198a62a14ea9a099fb3b127fa206165c8465a7ed53dcc0d0e0b2f56a4e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-08T13:00:02Z","title_canon_sha256":"d1e937231b206752c5b45b8e802043101f782313d237fb83f03214a3096dc708"},"schema_version":"1.0","source":{"id":"1905.03621","kind":"arxiv","version":1}},"canonical_sha256":"c3daf99a9122549b760ca228dd7dbf4743543780124f994c5ab69e4713c17eb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3daf99a9122549b760ca228dd7dbf4743543780124f994c5ab69e4713c17eb3","first_computed_at":"2026-05-17T23:46:37.164012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:37.164012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9q0eELsF41Aqsy+fUWpeCkbd8jZwWNKFXiKFshglyywV7jYFAwkBkLGVONjd1glzXu+3W2sbB6+LZS8UJz5jDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:37.164509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.03621","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9ff261208b5043f7212814c102668f372da29ddb270525d682e4c4687f8c93e","sha256:d1fbb6331120d0fd55f2eb9a4747df33d904e881021b7430500f665deb066acc"],"state_sha256":"a5877bd0ead68653ff75b574c414f283d92820998ca329c03b0c58e4ff747e07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jrKX3P5HP2q25f9x/r71waVCacfhayHw8mZ+Fhnk4U9DaMKirqTg9aY/tMGEoz6xp4kjuUI/k/keS0pCpbeuDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:12:46.187669Z","bundle_sha256":"7bff6f73b649d49d00d57fcfc7a0723c8ac23f5c857e532bfb0d4c8a14ada199"}}