{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YMB5V7RCFCIA7B2FGBUSCNCZL2","short_pith_number":"pith:YMB5V7RC","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"},"canonical_sha256":"c303dafe2228900f874530692134595e92e593b1c1cd1e27386d6cfe1b8d0993","source":{"kind":"arxiv","id":"1706.08869","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08869","created_at":"2026-05-18T00:34:34Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08869v2","created_at":"2026-05-18T00:34:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08869","created_at":"2026-05-18T00:34:34Z"},{"alias_kind":"pith_short_12","alias_value":"YMB5V7RCFCIA","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YMB5V7RCFCIA7B2F","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YMB5V7RC","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YMB5V7RCFCIA7B2FGBUSCNCZL2","target":"record","payload":{"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"},"canonical_sha256":"c303dafe2228900f874530692134595e92e593b1c1cd1e27386d6cfe1b8d0993","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"},"source_kind":"arxiv","source_id":"1706.08869","source_version":2,"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-18T00:34:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1uCxxSBNYksL4EQDQxzV80UotW8pa1JARLQUMvKxSXr/64n0iY4Wwf0UjASwhqFl9j6y4r44sPmDJkW74cnICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:58:03.047410Z"},"content_sha256":"018e743dea6f6fcbe5d61f295f27d85804d817cee26ef30cae34f3e288694c73","schema_version":"1.0","event_id":"sha256:018e743dea6f6fcbe5d61f295f27d85804d817cee26ef30cae34f3e288694c73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YMB5V7RCFCIA7B2FGBUSCNCZL2","target":"graph","payload":{"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"},"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-18T00:34:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Bl3cL2bcWEDBk+Pt7zmIs8OqBWnu6nAeKb16hcQID5El2WTsHchnNPChi3UCVi9aiFjHTcr9QpsTsw6AIZVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:58:03.047751Z"},"content_sha256":"e220d4c2dd497189612056b17ea181382653a517ff040ed298a9817074f2805c","schema_version":"1.0","event_id":"sha256:e220d4c2dd497189612056b17ea181382653a517ff040ed298a9817074f2805c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YMB5V7RCFCIA7B2FGBUSCNCZL2/bundle.json","state_url":"https://pith.science/pith/YMB5V7RCFCIA7B2FGBUSCNCZL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YMB5V7RCFCIA7B2FGBUSCNCZL2/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-23T19:58:03Z","links":{"resolver":"https://pith.science/pith/YMB5V7RCFCIA7B2FGBUSCNCZL2","bundle":"https://pith.science/pith/YMB5V7RCFCIA7B2FGBUSCNCZL2/bundle.json","state":"https://pith.science/pith/YMB5V7RCFCIA7B2FGBUSCNCZL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YMB5V7RCFCIA7B2FGBUSCNCZL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YMB5V7RCFCIA7B2FGBUSCNCZL2","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":"32debfc3995c0f28cfae05318de30ec2ffe6add4fa55211f0442d59626fcc7be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-20T05:01:51Z","title_canon_sha256":"d554b0c578d269701aeb40cfdff7526e31a5bd4ea0def6081b8be7f100a4aadc"},"schema_version":"1.0","source":{"id":"1706.08869","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08869","created_at":"2026-05-18T00:34:34Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08869v2","created_at":"2026-05-18T00:34:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08869","created_at":"2026-05-18T00:34:34Z"},{"alias_kind":"pith_short_12","alias_value":"YMB5V7RCFCIA","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YMB5V7RCFCIA7B2F","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YMB5V7RC","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:e220d4c2dd497189612056b17ea181382653a517ff040ed298a9817074f2805c","target":"graph","created_at":"2026-05-18T00:34:34Z","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 $\\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}.$","authors_text":"Anuradha Sharma, Tania Sidana","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-20T05:01:51Z","title":"Repeated-root constacyclic codes over the finite chain ring $\\mathbf{ \\mathbb{F}_{p^m}[u]/\\langle u^3 \\rangle }$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08869","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:018e743dea6f6fcbe5d61f295f27d85804d817cee26ef30cae34f3e288694c73","target":"record","created_at":"2026-05-18T00:34:34Z","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":"32debfc3995c0f28cfae05318de30ec2ffe6add4fa55211f0442d59626fcc7be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-20T05:01:51Z","title_canon_sha256":"d554b0c578d269701aeb40cfdff7526e31a5bd4ea0def6081b8be7f100a4aadc"},"schema_version":"1.0","source":{"id":"1706.08869","kind":"arxiv","version":2}},"canonical_sha256":"c303dafe2228900f874530692134595e92e593b1c1cd1e27386d6cfe1b8d0993","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c303dafe2228900f874530692134595e92e593b1c1cd1e27386d6cfe1b8d0993","first_computed_at":"2026-05-18T00:34:34.860987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:34.860987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6rRcdcC9LLRyRdPwNdM68qlnnKZY4yRfLl0ts2nnIGJQ+lYPwZcgw9QOVUmeTkiI2QKV25tfHK31JyyQs0DPCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:34.861397Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08869","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:018e743dea6f6fcbe5d61f295f27d85804d817cee26ef30cae34f3e288694c73","sha256:e220d4c2dd497189612056b17ea181382653a517ff040ed298a9817074f2805c"],"state_sha256":"e3d793e6e0a21a811e1d066007c026dbbf6452326e9da9dcb4dcf9f715f01862"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nM/ds4lcf4qMPtV4dBkTNfQRu1YsnrZJurl/P/OwhFK+UJLU8E9MLJPFjR5r15puw3uD+k0ZbTp10UfG3O4LAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T19:58:03.049861Z","bundle_sha256":"04bee755275b29b89bfefa4c99007477423ac28005e2668995100527a563872c"}}