{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BEL6PRUZ3QMDSCOM6CO7EUXK52","short_pith_number":"pith:BEL6PRUZ","schema_version":"1.0","canonical_sha256":"0917e7c699dc183909ccf09df252eaeeab4abc9abd2ecf7e6d6a3f040571c66c","source":{"kind":"arxiv","id":"1212.3704","version":1},"attestation_state":"computed","paper":{"title":"Some Constacyclic Codes over Finite Chain Rings","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aicha Batoul, Kenza Guenda, T. Aaron Gulliver","submitted_at":"2012-12-15T17:03:44Z","abstract_excerpt":"For $\\lambda$ an $n$-th power of a unit in a finite chain ring we prove that $\\lambda$-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some constacylic codes. We also study the $\\alpha +p \\beta$-constacyclic codes of length $p^s$ over the Galois ring $GR(p^e,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":"1212.3704","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-12-15T17:03:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c1c57935746744cf3d15b5ec19b762d8b1b35e38955b3569262c8549567da2fc","abstract_canon_sha256":"478bd39b25f041b52ca97cfd624dd9115a4d7bad25e2104b3e96339240728946"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:22.625247Z","signature_b64":"A2OtAaa1mnjxX2/b+zF7c/UujdjcKELAk1bHnmZTlQqS+xYTI4XlOcC54VUtcGSCu27aWp5Onx/vG26ynES5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0917e7c699dc183909ccf09df252eaeeab4abc9abd2ecf7e6d6a3f040571c66c","last_reissued_at":"2026-05-18T03:38:22.624726Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:22.624726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some Constacyclic Codes over Finite Chain Rings","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aicha Batoul, Kenza Guenda, T. Aaron Gulliver","submitted_at":"2012-12-15T17:03:44Z","abstract_excerpt":"For $\\lambda$ an $n$-th power of a unit in a finite chain ring we prove that $\\lambda$-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some constacylic codes. We also study the $\\alpha +p \\beta$-constacyclic codes of length $p^s$ over the Galois ring $GR(p^e,r)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3704","kind":"arxiv","version":1},"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":"1212.3704","created_at":"2026-05-18T03:38:22.624813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3704v1","created_at":"2026-05-18T03:38:22.624813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3704","created_at":"2026-05-18T03:38:22.624813+00:00"},{"alias_kind":"pith_short_12","alias_value":"BEL6PRUZ3QMD","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"BEL6PRUZ3QMDSCOM","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"BEL6PRUZ","created_at":"2026-05-18T12:26:58.693483+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/BEL6PRUZ3QMDSCOM6CO7EUXK52","json":"https://pith.science/pith/BEL6PRUZ3QMDSCOM6CO7EUXK52.json","graph_json":"https://pith.science/api/pith-number/BEL6PRUZ3QMDSCOM6CO7EUXK52/graph.json","events_json":"https://pith.science/api/pith-number/BEL6PRUZ3QMDSCOM6CO7EUXK52/events.json","paper":"https://pith.science/paper/BEL6PRUZ"},"agent_actions":{"view_html":"https://pith.science/pith/BEL6PRUZ3QMDSCOM6CO7EUXK52","download_json":"https://pith.science/pith/BEL6PRUZ3QMDSCOM6CO7EUXK52.json","view_paper":"https://pith.science/paper/BEL6PRUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3704&json=true","fetch_graph":"https://pith.science/api/pith-number/BEL6PRUZ3QMDSCOM6CO7EUXK52/graph.json","fetch_events":"https://pith.science/api/pith-number/BEL6PRUZ3QMDSCOM6CO7EUXK52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BEL6PRUZ3QMDSCOM6CO7EUXK52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BEL6PRUZ3QMDSCOM6CO7EUXK52/action/storage_attestation","attest_author":"https://pith.science/pith/BEL6PRUZ3QMDSCOM6CO7EUXK52/action/author_attestation","sign_citation":"https://pith.science/pith/BEL6PRUZ3QMDSCOM6CO7EUXK52/action/citation_signature","submit_replication":"https://pith.science/pith/BEL6PRUZ3QMDSCOM6CO7EUXK52/action/replication_record"}},"created_at":"2026-05-18T03:38:22.624813+00:00","updated_at":"2026-05-18T03:38:22.624813+00:00"}