{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BLMXU7ZTOAZDPPIOMEPH6CDSU6","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":"d70626e7d5960c7c843f9a85b1732c829c7865d1811ff514c124e8f0754dfe2d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-09T16:24:22Z","title_canon_sha256":"d52fbf44a38838a77b09c3e4f2afd4d945b996db640f941a251f09443d3529c0"},"schema_version":"1.0","source":{"id":"1511.02743","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02743","created_at":"2026-05-18T01:27:21Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02743v2","created_at":"2026-05-18T01:27:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02743","created_at":"2026-05-18T01:27:21Z"},{"alias_kind":"pith_short_12","alias_value":"BLMXU7ZTOAZD","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BLMXU7ZTOAZDPPIO","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BLMXU7ZT","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:6aea427f1dc8f75c6810691a9d6aadfa154a847d7fff07c9a78688fe7d1a9eef","target":"graph","created_at":"2026-05-18T01:27:21Z","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}_{p^m}$ be a finite field of cardinality $p^m$ and $R=\\mathbb{F}_{p^m}[u]/\\langle u^2\\rangle=\\mathbb{F}_{p^m}+u\\mathbb{F}_{p^m}$ $(u^2=0)$, where $p$ is an odd prime and $m$ is a positive integer. For any $\\alpha,\\beta\\in \\mathbb{F}_{p^m}^{\\times}$, the aim of this paper is to represent all distinct $(\\alpha+u\\beta)$-constacyclic codes over $R$ of length $p^sn$ and their dual codes, where $s$ is a nonnegative integer and $n$ is a positive integer satisfying ${\\rm gcd}(p,n)=1$. Especially, all distinct $(2+u)$-constacyclic codes of length $6\\cdot 5^t$ over $\\mathbb{F}_{3}+u\\mathb","authors_text":"Qingguo Li, Yuan Cao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-09T16:24:22Z","title":"On $(\\alpha+u\\beta)$-constacyclic codes of length $p^sn$ over $\\mathbb{F}_{p^m}+u\\mathbb{F}_{p^m}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02743","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:a4868294e5dc7ba9bd9e5743afec4e78d5886096924982bb3dac0dc738f54f52","target":"record","created_at":"2026-05-18T01:27:21Z","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":"d70626e7d5960c7c843f9a85b1732c829c7865d1811ff514c124e8f0754dfe2d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-09T16:24:22Z","title_canon_sha256":"d52fbf44a38838a77b09c3e4f2afd4d945b996db640f941a251f09443d3529c0"},"schema_version":"1.0","source":{"id":"1511.02743","kind":"arxiv","version":2}},"canonical_sha256":"0ad97a7f33703237bd0e611e7f0872a7952864094d62763e3d8adeacce871f3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ad97a7f33703237bd0e611e7f0872a7952864094d62763e3d8adeacce871f3b","first_computed_at":"2026-05-18T01:27:21.829640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:21.829640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WPo9rtLKS6MY6lEVlSKLhYKcd4Bm5kZ2vgVcd3QGkikqMKIVTlJcozate4I/n44kmLn5JhmAOtNxNy6NYhhNDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:21.830092Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02743","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4868294e5dc7ba9bd9e5743afec4e78d5886096924982bb3dac0dc738f54f52","sha256:6aea427f1dc8f75c6810691a9d6aadfa154a847d7fff07c9a78688fe7d1a9eef"],"state_sha256":"77411fd82d5f060f61b54c8d5fc38ec7eab5445936e6ab5e768bbe200660b6f9"}