{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QP34FPKRVVVAOZELYKNB4TVJ6J","short_pith_number":"pith:QP34FPKR","canonical_record":{"source":{"id":"1707.06133","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-12T03:52:07Z","cross_cats_sorted":["math.AC","math.IT"],"title_canon_sha256":"5daa3270b51f24149ddfd4b2d825be86a5e35844278cd1cc261721e9ca4256cc","abstract_canon_sha256":"e21ef9fdcee6fe7d6b028749e529277fde310b0c5c3bb6370c82550bb2fdb357"},"schema_version":"1.0"},"canonical_sha256":"83f7c2bd51ad6a07648bc29a1e4ea9f2660e2e12f418da98dd89b536b4b60b3e","source":{"kind":"arxiv","id":"1707.06133","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06133","created_at":"2026-05-18T00:15:30Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06133v2","created_at":"2026-05-18T00:15:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06133","created_at":"2026-05-18T00:15:30Z"},{"alias_kind":"pith_short_12","alias_value":"QP34FPKRVVVA","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QP34FPKRVVVAOZEL","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QP34FPKR","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QP34FPKRVVVAOZELYKNB4TVJ6J","target":"record","payload":{"canonical_record":{"source":{"id":"1707.06133","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-12T03:52:07Z","cross_cats_sorted":["math.AC","math.IT"],"title_canon_sha256":"5daa3270b51f24149ddfd4b2d825be86a5e35844278cd1cc261721e9ca4256cc","abstract_canon_sha256":"e21ef9fdcee6fe7d6b028749e529277fde310b0c5c3bb6370c82550bb2fdb357"},"schema_version":"1.0"},"canonical_sha256":"83f7c2bd51ad6a07648bc29a1e4ea9f2660e2e12f418da98dd89b536b4b60b3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:30.642996Z","signature_b64":"p0jfbCNAtuBAXUAO7hnU3IMPfPCZNjBUFMEwgojX46UWEcAyaIU87zGW0ptnopGeesClwqQVVhFumFAwBqonAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83f7c2bd51ad6a07648bc29a1e4ea9f2660e2e12f418da98dd89b536b4b60b3e","last_reissued_at":"2026-05-18T00:15:30.642290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:30.642290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.06133","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:15:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zG2M3OKUTuGJ/V+UPJ4Tigu34xM9BY4GufSrug/pDjPWxl+A+hta8o57fmvKxYfYmuxS4NcUIkxVdTz3kn6dBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:24:09.328356Z"},"content_sha256":"05d4a5eff97d3932d0ee031d54f45c4b5cee73264761b40d8d066a8e007ecd3f","schema_version":"1.0","event_id":"sha256:05d4a5eff97d3932d0ee031d54f45c4b5cee73264761b40d8d066a8e007ecd3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QP34FPKRVVVAOZELYKNB4TVJ6J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A class of constacyclic codes over $\\mathbb{F}_{p^m}[u]/\\left<u^2\\right>$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.IT"],"primary_cat":"cs.IT","authors_text":"Anuradha Sharma, Saroj Rani","submitted_at":"2017-07-12T03:52:07Z","abstract_excerpt":"Let $p$ be an odd prime, and let $m$ be a positive integer satisfying $p^m \\equiv 3~(\\text{mod }4).$ Let $\\mathbb{F}_{p^m}$ be the finite field with $p^m$ elements, and let $R=\\mathbb{F}_{p^m}[u]/\\left<u^2\\right>$ be the finite commutative chain ring with unity. In this paper, we determine all constacyclic codes of length $4p^s$ over $R$ and their dual codes, where $s$ is a positive integer. We also determine their sizes and list some isodual constacyclic codes of length $4p^s$ over $R.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06133","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:15:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DrhNaXQXoA0MmrzP09syrWV+IegCyr/4ZW/vwG2bWkgYY1p1KxpnjuB/psJVVr3BXvhNIpy/umuEmbnWV4p5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:24:09.328709Z"},"content_sha256":"7f1f5ab055c6d78458bd098bdb89de92fed517f4f783ee7bb35305f0e577baf0","schema_version":"1.0","event_id":"sha256:7f1f5ab055c6d78458bd098bdb89de92fed517f4f783ee7bb35305f0e577baf0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QP34FPKRVVVAOZELYKNB4TVJ6J/bundle.json","state_url":"https://pith.science/pith/QP34FPKRVVVAOZELYKNB4TVJ6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QP34FPKRVVVAOZELYKNB4TVJ6J/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-23T16:24:09Z","links":{"resolver":"https://pith.science/pith/QP34FPKRVVVAOZELYKNB4TVJ6J","bundle":"https://pith.science/pith/QP34FPKRVVVAOZELYKNB4TVJ6J/bundle.json","state":"https://pith.science/pith/QP34FPKRVVVAOZELYKNB4TVJ6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QP34FPKRVVVAOZELYKNB4TVJ6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QP34FPKRVVVAOZELYKNB4TVJ6J","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":"e21ef9fdcee6fe7d6b028749e529277fde310b0c5c3bb6370c82550bb2fdb357","cross_cats_sorted":["math.AC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-12T03:52:07Z","title_canon_sha256":"5daa3270b51f24149ddfd4b2d825be86a5e35844278cd1cc261721e9ca4256cc"},"schema_version":"1.0","source":{"id":"1707.06133","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06133","created_at":"2026-05-18T00:15:30Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06133v2","created_at":"2026-05-18T00:15:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06133","created_at":"2026-05-18T00:15:30Z"},{"alias_kind":"pith_short_12","alias_value":"QP34FPKRVVVA","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QP34FPKRVVVAOZEL","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QP34FPKR","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:7f1f5ab055c6d78458bd098bdb89de92fed517f4f783ee7bb35305f0e577baf0","target":"graph","created_at":"2026-05-18T00:15:30Z","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 $p$ be an odd prime, and let $m$ be a positive integer satisfying $p^m \\equiv 3~(\\text{mod }4).$ Let $\\mathbb{F}_{p^m}$ be the finite field with $p^m$ elements, and let $R=\\mathbb{F}_{p^m}[u]/\\left<u^2\\right>$ be the finite commutative chain ring with unity. In this paper, we determine all constacyclic codes of length $4p^s$ over $R$ and their dual codes, where $s$ is a positive integer. We also determine their sizes and list some isodual constacyclic codes of length $4p^s$ over $R.$","authors_text":"Anuradha Sharma, Saroj Rani","cross_cats":["math.AC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-12T03:52:07Z","title":"A class of constacyclic codes over $\\mathbb{F}_{p^m}[u]/\\left<u^2\\right>$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06133","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:05d4a5eff97d3932d0ee031d54f45c4b5cee73264761b40d8d066a8e007ecd3f","target":"record","created_at":"2026-05-18T00:15:30Z","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":"e21ef9fdcee6fe7d6b028749e529277fde310b0c5c3bb6370c82550bb2fdb357","cross_cats_sorted":["math.AC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-12T03:52:07Z","title_canon_sha256":"5daa3270b51f24149ddfd4b2d825be86a5e35844278cd1cc261721e9ca4256cc"},"schema_version":"1.0","source":{"id":"1707.06133","kind":"arxiv","version":2}},"canonical_sha256":"83f7c2bd51ad6a07648bc29a1e4ea9f2660e2e12f418da98dd89b536b4b60b3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83f7c2bd51ad6a07648bc29a1e4ea9f2660e2e12f418da98dd89b536b4b60b3e","first_computed_at":"2026-05-18T00:15:30.642290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:30.642290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p0jfbCNAtuBAXUAO7hnU3IMPfPCZNjBUFMEwgojX46UWEcAyaIU87zGW0ptnopGeesClwqQVVhFumFAwBqonAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:30.642996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06133","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05d4a5eff97d3932d0ee031d54f45c4b5cee73264761b40d8d066a8e007ecd3f","sha256:7f1f5ab055c6d78458bd098bdb89de92fed517f4f783ee7bb35305f0e577baf0"],"state_sha256":"c2bc11d739c30ae9f45701c2d39dbe32e07f42c119806b7744bd8860edcf4c7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+gccL+T8o8RQQZamEos5iP9D6Qq+hzBMeQsHU0XsiSsXp1dt/PP9qqCO2tYk69gYgOPUCYx9iUHB4AEJHRpHDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:24:09.330631Z","bundle_sha256":"e9fa8d6b314af6f87a5c34e96d4f8c84e81defd650e6821660fee16841ef0925"}}