{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4DKDQFQDRRZ6IZ3PJA3YU4AWXA","short_pith_number":"pith:4DKDQFQD","schema_version":"1.0","canonical_sha256":"e0d43816038c73e4676f48378a7016b8235ee3e5a50211ef2b0737034679f404","source":{"kind":"arxiv","id":"1512.01406","version":2},"attestation_state":"computed","paper":{"title":"Constacyclic codes of length $p^sn$ over $\\mathbb{F}_{p^m}+u\\mathbb{F}_{p^m}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Jian Gao, Yonglin Cao, Yuan Cao","submitted_at":"2015-12-04T13:54:53Z","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 a prime and $m$ is a positive integer. For any $\\lambda\\in \\mathbb{F}_{p^m}^{\\times}$, an explicit representation for all distinct $\\lambda$-constacyclic codes over $R$ of length $p^sn$ is given by a canonical form decomposition for each code, where $s$ and $n$ are positive integers satisfying ${\\rm gcd}(p,n)=1$. For any such code, using its canonical form decomposition the representation for the dual code of the code is provide"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1512.01406","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-04T13:54:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a07d16188d38eba76d70baabbf0a16bc10b2f814b30c3279ddbc70884f2e890a","abstract_canon_sha256":"12b2fe10c66783d039e11907af9a35921f6916ebc4343c9333956809a1432204"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:15.311424Z","signature_b64":"UKklNyiYcEsf/NTKH4DPaa0FK2Bf5jsozZJIuZwzdCn8hdKBIN5zr5TzRhNt4r2k8bx1/td/6yhzT6DA5oJ5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0d43816038c73e4676f48378a7016b8235ee3e5a50211ef2b0737034679f404","last_reissued_at":"2026-05-18T00:32:15.310810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:15.310810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constacyclic codes of length $p^sn$ over $\\mathbb{F}_{p^m}+u\\mathbb{F}_{p^m}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Jian Gao, Yonglin Cao, Yuan Cao","submitted_at":"2015-12-04T13:54:53Z","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 a prime and $m$ is a positive integer. For any $\\lambda\\in \\mathbb{F}_{p^m}^{\\times}$, an explicit representation for all distinct $\\lambda$-constacyclic codes over $R$ of length $p^sn$ is given by a canonical form decomposition for each code, where $s$ and $n$ are positive integers satisfying ${\\rm gcd}(p,n)=1$. For any such code, using its canonical form decomposition the representation for the dual code of the code is provide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01406","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.01406","created_at":"2026-05-18T00:32:15.310895+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.01406v2","created_at":"2026-05-18T00:32:15.310895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01406","created_at":"2026-05-18T00:32:15.310895+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DKDQFQDRRZ6","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DKDQFQDRRZ6IZ3P","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DKDQFQD","created_at":"2026-05-18T12:29:05.191682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4DKDQFQDRRZ6IZ3PJA3YU4AWXA","json":"https://pith.science/pith/4DKDQFQDRRZ6IZ3PJA3YU4AWXA.json","graph_json":"https://pith.science/api/pith-number/4DKDQFQDRRZ6IZ3PJA3YU4AWXA/graph.json","events_json":"https://pith.science/api/pith-number/4DKDQFQDRRZ6IZ3PJA3YU4AWXA/events.json","paper":"https://pith.science/paper/4DKDQFQD"},"agent_actions":{"view_html":"https://pith.science/pith/4DKDQFQDRRZ6IZ3PJA3YU4AWXA","download_json":"https://pith.science/pith/4DKDQFQDRRZ6IZ3PJA3YU4AWXA.json","view_paper":"https://pith.science/paper/4DKDQFQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.01406&json=true","fetch_graph":"https://pith.science/api/pith-number/4DKDQFQDRRZ6IZ3PJA3YU4AWXA/graph.json","fetch_events":"https://pith.science/api/pith-number/4DKDQFQDRRZ6IZ3PJA3YU4AWXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DKDQFQDRRZ6IZ3PJA3YU4AWXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DKDQFQDRRZ6IZ3PJA3YU4AWXA/action/storage_attestation","attest_author":"https://pith.science/pith/4DKDQFQDRRZ6IZ3PJA3YU4AWXA/action/author_attestation","sign_citation":"https://pith.science/pith/4DKDQFQDRRZ6IZ3PJA3YU4AWXA/action/citation_signature","submit_replication":"https://pith.science/pith/4DKDQFQDRRZ6IZ3PJA3YU4AWXA/action/replication_record"}},"created_at":"2026-05-18T00:32:15.310895+00:00","updated_at":"2026-05-18T00:32:15.310895+00:00"}