{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RZJEIYSXLBFLPXYVQFAUAXWEWU","short_pith_number":"pith:RZJEIYSX","schema_version":"1.0","canonical_sha256":"8e52446257584ab7df158141405ec4b50cb19dc9a2e7b3a270031ba1039e3a62","source":{"kind":"arxiv","id":"1908.07368","version":1},"attestation_state":"computed","paper":{"title":"Primitive Idempotents and Constacyclic Codes over Finite Chain Rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.RA"],"primary_cat":"cs.IT","authors_text":"Jo\\\"el Kabore, Mohammed Elhassani Charkani","submitted_at":"2019-08-16T19:19:34Z","abstract_excerpt":"Let $R$ be a commutative local finite ring. In this paper, we construct the complete set of pairwise orthogonal primitive idempotents of $R[X]/<g>$ where $g$ is a regular polynomial in $R[X]$. We use this set to decompose the ring $R[X]/<g>$ and to give the structure of constacyclic codes over finite chain rings. This allows us to describe generators of the dual code $\\mathcal{C}^\\bot$ of a constacyclic code $\\mathcal{C}$ and to characterize non-trivial self-dual constacyclic codes over finite chain rings."},"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":"1908.07368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-16T19:19:34Z","cross_cats_sorted":["math.IT","math.RA"],"title_canon_sha256":"b8708b31366a4a667c3604f032606e1cacb9eca9029a3bc5f11259333d1cb3fe","abstract_canon_sha256":"3c7ac2d51ea91fa55f3347e2a5afc0da53f4f046108fb9922eb85f110e2e3ed2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:33.673809Z","signature_b64":"Pb2+a883JDYqibCNwKgxB06TR2aIA0UmtSyngX32QMMY/eXvkcnjuSKyVJc4Jzi+DF8IGrHtxnrabkIBSYUtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e52446257584ab7df158141405ec4b50cb19dc9a2e7b3a270031ba1039e3a62","last_reissued_at":"2026-07-04T23:58:33.673458Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:33.673458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Primitive Idempotents and Constacyclic Codes over Finite Chain Rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.RA"],"primary_cat":"cs.IT","authors_text":"Jo\\\"el Kabore, Mohammed Elhassani Charkani","submitted_at":"2019-08-16T19:19:34Z","abstract_excerpt":"Let $R$ be a commutative local finite ring. In this paper, we construct the complete set of pairwise orthogonal primitive idempotents of $R[X]/<g>$ where $g$ is a regular polynomial in $R[X]$. We use this set to decompose the ring $R[X]/<g>$ and to give the structure of constacyclic codes over finite chain rings. This allows us to describe generators of the dual code $\\mathcal{C}^\\bot$ of a constacyclic code $\\mathcal{C}$ and to characterize non-trivial self-dual constacyclic codes over finite chain rings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07368","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.07368/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.07368","created_at":"2026-07-04T23:58:33.673514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.07368v1","created_at":"2026-07-04T23:58:33.673514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07368","created_at":"2026-07-04T23:58:33.673514+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZJEIYSXLBFL","created_at":"2026-07-04T23:58:33.673514+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZJEIYSXLBFLPXYV","created_at":"2026-07-04T23:58:33.673514+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZJEIYSX","created_at":"2026-07-04T23:58:33.673514+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/RZJEIYSXLBFLPXYVQFAUAXWEWU","json":"https://pith.science/pith/RZJEIYSXLBFLPXYVQFAUAXWEWU.json","graph_json":"https://pith.science/api/pith-number/RZJEIYSXLBFLPXYVQFAUAXWEWU/graph.json","events_json":"https://pith.science/api/pith-number/RZJEIYSXLBFLPXYVQFAUAXWEWU/events.json","paper":"https://pith.science/paper/RZJEIYSX"},"agent_actions":{"view_html":"https://pith.science/pith/RZJEIYSXLBFLPXYVQFAUAXWEWU","download_json":"https://pith.science/pith/RZJEIYSXLBFLPXYVQFAUAXWEWU.json","view_paper":"https://pith.science/paper/RZJEIYSX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.07368&json=true","fetch_graph":"https://pith.science/api/pith-number/RZJEIYSXLBFLPXYVQFAUAXWEWU/graph.json","fetch_events":"https://pith.science/api/pith-number/RZJEIYSXLBFLPXYVQFAUAXWEWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZJEIYSXLBFLPXYVQFAUAXWEWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZJEIYSXLBFLPXYVQFAUAXWEWU/action/storage_attestation","attest_author":"https://pith.science/pith/RZJEIYSXLBFLPXYVQFAUAXWEWU/action/author_attestation","sign_citation":"https://pith.science/pith/RZJEIYSXLBFLPXYVQFAUAXWEWU/action/citation_signature","submit_replication":"https://pith.science/pith/RZJEIYSXLBFLPXYVQFAUAXWEWU/action/replication_record"}},"created_at":"2026-07-04T23:58:33.673514+00:00","updated_at":"2026-07-04T23:58:33.673514+00:00"}