{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:B2S5RNAU5WBMG66KFOXFB5ZUEX","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":"3980d9cb64b6bf33f689b812252d2a5c457f4345ec7376b5a3adf93a96d998ed","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-07-14T03:17:07Z","title_canon_sha256":"bc5d5797a06d0f7ab4ba576f5225f263753bb5e20ba0439e19f904e465466d96"},"schema_version":"1.0","source":{"id":"1207.3387","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3387","created_at":"2026-05-18T03:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3387v1","created_at":"2026-05-18T03:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3387","created_at":"2026-05-18T03:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"B2S5RNAU5WBM","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"B2S5RNAU5WBMG66K","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"B2S5RNAU","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:565eacef05655639af9b8c87c7d6a2e4b5366d69e7e66d5645e152754efcdd26","target":"graph","created_at":"2026-05-18T03:51:01Z","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":"In this paper we investigate repeated root cyclic and negacyclic codes of length $p^rm$ over $\\mathbb{F}_{p^s}$ with $(m,p)=1$. In the case $p$ odd, we give necessary and sufficient conditions on the existence of negacyclic self-dual codes. When $m=2m'$ with $m'$ odd, we characterize the codes in terms of their generator polynomials. This provides simple conditions on the existence of self-dual negacyclic codes, and generalizes the results of Dinh \\cite{dinh}. We also answer an open problem concerning the number of self-dual cyclic codes given by Jia et al. \\cite{jia}.","authors_text":"Kenza Guenda, T. Aaron Gulliver","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-07-14T03:17:07Z","title":"Self-dual Repeated Root Cyclic and Negacyclic Codes over Finite Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3387","kind":"arxiv","version":1},"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:553c8915b919b914b5b5c4be40971cd0310b7cc23244caf79ebc8edc0ab0e3b4","target":"record","created_at":"2026-05-18T03:51:01Z","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":"3980d9cb64b6bf33f689b812252d2a5c457f4345ec7376b5a3adf93a96d998ed","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-07-14T03:17:07Z","title_canon_sha256":"bc5d5797a06d0f7ab4ba576f5225f263753bb5e20ba0439e19f904e465466d96"},"schema_version":"1.0","source":{"id":"1207.3387","kind":"arxiv","version":1}},"canonical_sha256":"0ea5d8b414ed82c37bca2bae50f73425cb04b3678d15f5ed125b286db694cdaf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ea5d8b414ed82c37bca2bae50f73425cb04b3678d15f5ed125b286db694cdaf","first_computed_at":"2026-05-18T03:51:01.331884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:01.331884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+3KeRnTKKheL5B7Bnclt7pwkpXT4BYEHXMgLlV/j/UgfnN76VeTuP0zJw9jFIHAQWvXOIwYqFwEbDTCOS9wdCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:01.332666Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3387","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:553c8915b919b914b5b5c4be40971cd0310b7cc23244caf79ebc8edc0ab0e3b4","sha256:565eacef05655639af9b8c87c7d6a2e4b5366d69e7e66d5645e152754efcdd26"],"state_sha256":"57eed055ec245a711ca8e16b3e0c8fb05b1e7a50b0e896ac43a1269eaab2af66"}