{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YMB5V7RCFCIA7B2FGBUSCNCZL2","short_pith_number":"pith:YMB5V7RC","schema_version":"1.0","canonical_sha256":"c303dafe2228900f874530692134595e92e593b1c1cd1e27386d6cfe1b8d0993","source":{"kind":"arxiv","id":"1706.08869","version":2},"attestation_state":"computed","paper":{"title":"Repeated-root constacyclic codes over the finite chain ring $\\mathbf{ \\mathbb{F}_{p^m}[u]/\\langle u^3 \\rangle }$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Anuradha Sharma, Tania Sidana","submitted_at":"2017-06-20T05:01:51Z","abstract_excerpt":"Let $\\mathcal{R}=\\mathbb{F}_{p^m}[u]/\\langle u^3 \\rangle $ be the finite commutative chain ring with unity, where $p$ is a prime, $m$ is a positive integer and $\\mathbb{F}_{p^m}$ is the finite field with $p^m$ elements. In this paper, we determine all repeated-root constacyclic codes of arbitrary lengths over $\\mathcal{R},$ their sizes and their dual codes. As an application, we list some isodual constacyclic codes over $\\mathcal{R}.$ We also determine Hamming distances, RT distances, and RT weight distributions of some repeated-root constacyclic codes over $\\mathcal{R}.$"},"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":"1706.08869","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-20T05:01:51Z","cross_cats_sorted":[],"title_canon_sha256":"d554b0c578d269701aeb40cfdff7526e31a5bd4ea0def6081b8be7f100a4aadc","abstract_canon_sha256":"32debfc3995c0f28cfae05318de30ec2ffe6add4fa55211f0442d59626fcc7be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:34.861397Z","signature_b64":"6rRcdcC9LLRyRdPwNdM68qlnnKZY4yRfLl0ts2nnIGJQ+lYPwZcgw9QOVUmeTkiI2QKV25tfHK31JyyQs0DPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c303dafe2228900f874530692134595e92e593b1c1cd1e27386d6cfe1b8d0993","last_reissued_at":"2026-05-18T00:34:34.860987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:34.860987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Repeated-root constacyclic codes over the finite chain ring $\\mathbf{ \\mathbb{F}_{p^m}[u]/\\langle u^3 \\rangle }$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Anuradha Sharma, Tania Sidana","submitted_at":"2017-06-20T05:01:51Z","abstract_excerpt":"Let $\\mathcal{R}=\\mathbb{F}_{p^m}[u]/\\langle u^3 \\rangle $ be the finite commutative chain ring with unity, where $p$ is a prime, $m$ is a positive integer and $\\mathbb{F}_{p^m}$ is the finite field with $p^m$ elements. In this paper, we determine all repeated-root constacyclic codes of arbitrary lengths over $\\mathcal{R},$ their sizes and their dual codes. As an application, we list some isodual constacyclic codes over $\\mathcal{R}.$ We also determine Hamming distances, RT distances, and RT weight distributions of some repeated-root constacyclic codes over $\\mathcal{R}.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08869","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":"1706.08869","created_at":"2026-05-18T00:34:34.861049+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08869v2","created_at":"2026-05-18T00:34:34.861049+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08869","created_at":"2026-05-18T00:34:34.861049+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMB5V7RCFCIA","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMB5V7RCFCIA7B2F","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMB5V7RC","created_at":"2026-05-18T12:31:56.362134+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/YMB5V7RCFCIA7B2FGBUSCNCZL2","json":"https://pith.science/pith/YMB5V7RCFCIA7B2FGBUSCNCZL2.json","graph_json":"https://pith.science/api/pith-number/YMB5V7RCFCIA7B2FGBUSCNCZL2/graph.json","events_json":"https://pith.science/api/pith-number/YMB5V7RCFCIA7B2FGBUSCNCZL2/events.json","paper":"https://pith.science/paper/YMB5V7RC"},"agent_actions":{"view_html":"https://pith.science/pith/YMB5V7RCFCIA7B2FGBUSCNCZL2","download_json":"https://pith.science/pith/YMB5V7RCFCIA7B2FGBUSCNCZL2.json","view_paper":"https://pith.science/paper/YMB5V7RC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08869&json=true","fetch_graph":"https://pith.science/api/pith-number/YMB5V7RCFCIA7B2FGBUSCNCZL2/graph.json","fetch_events":"https://pith.science/api/pith-number/YMB5V7RCFCIA7B2FGBUSCNCZL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMB5V7RCFCIA7B2FGBUSCNCZL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMB5V7RCFCIA7B2FGBUSCNCZL2/action/storage_attestation","attest_author":"https://pith.science/pith/YMB5V7RCFCIA7B2FGBUSCNCZL2/action/author_attestation","sign_citation":"https://pith.science/pith/YMB5V7RCFCIA7B2FGBUSCNCZL2/action/citation_signature","submit_replication":"https://pith.science/pith/YMB5V7RCFCIA7B2FGBUSCNCZL2/action/replication_record"}},"created_at":"2026-05-18T00:34:34.861049+00:00","updated_at":"2026-05-18T00:34:34.861049+00:00"}