{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:B2S5RNAU5WBMG66KFOXFB5ZUEX","short_pith_number":"pith:B2S5RNAU","schema_version":"1.0","canonical_sha256":"0ea5d8b414ed82c37bca2bae50f73425cb04b3678d15f5ed125b286db694cdaf","source":{"kind":"arxiv","id":"1207.3387","version":1},"attestation_state":"computed","paper":{"title":"Self-dual Repeated Root Cyclic and Negacyclic Codes over Finite Fields","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kenza Guenda, T. Aaron Gulliver","submitted_at":"2012-07-14T03:17:07Z","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}."},"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":"1207.3387","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-07-14T03:17:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bc5d5797a06d0f7ab4ba576f5225f263753bb5e20ba0439e19f904e465466d96","abstract_canon_sha256":"3980d9cb64b6bf33f689b812252d2a5c457f4345ec7376b5a3adf93a96d998ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:01.332666Z","signature_b64":"+3KeRnTKKheL5B7Bnclt7pwkpXT4BYEHXMgLlV/j/UgfnN76VeTuP0zJw9jFIHAQWvXOIwYqFwEbDTCOS9wdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ea5d8b414ed82c37bca2bae50f73425cb04b3678d15f5ed125b286db694cdaf","last_reissued_at":"2026-05-18T03:51:01.331884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:01.331884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-dual Repeated Root Cyclic and Negacyclic Codes over Finite Fields","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kenza Guenda, T. Aaron Gulliver","submitted_at":"2012-07-14T03:17:07Z","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}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3387","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":"1207.3387","created_at":"2026-05-18T03:51:01.332026+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.3387v1","created_at":"2026-05-18T03:51:01.332026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3387","created_at":"2026-05-18T03:51:01.332026+00:00"},{"alias_kind":"pith_short_12","alias_value":"B2S5RNAU5WBM","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"B2S5RNAU5WBMG66K","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"B2S5RNAU","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/B2S5RNAU5WBMG66KFOXFB5ZUEX","json":"https://pith.science/pith/B2S5RNAU5WBMG66KFOXFB5ZUEX.json","graph_json":"https://pith.science/api/pith-number/B2S5RNAU5WBMG66KFOXFB5ZUEX/graph.json","events_json":"https://pith.science/api/pith-number/B2S5RNAU5WBMG66KFOXFB5ZUEX/events.json","paper":"https://pith.science/paper/B2S5RNAU"},"agent_actions":{"view_html":"https://pith.science/pith/B2S5RNAU5WBMG66KFOXFB5ZUEX","download_json":"https://pith.science/pith/B2S5RNAU5WBMG66KFOXFB5ZUEX.json","view_paper":"https://pith.science/paper/B2S5RNAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.3387&json=true","fetch_graph":"https://pith.science/api/pith-number/B2S5RNAU5WBMG66KFOXFB5ZUEX/graph.json","fetch_events":"https://pith.science/api/pith-number/B2S5RNAU5WBMG66KFOXFB5ZUEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B2S5RNAU5WBMG66KFOXFB5ZUEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B2S5RNAU5WBMG66KFOXFB5ZUEX/action/storage_attestation","attest_author":"https://pith.science/pith/B2S5RNAU5WBMG66KFOXFB5ZUEX/action/author_attestation","sign_citation":"https://pith.science/pith/B2S5RNAU5WBMG66KFOXFB5ZUEX/action/citation_signature","submit_replication":"https://pith.science/pith/B2S5RNAU5WBMG66KFOXFB5ZUEX/action/replication_record"}},"created_at":"2026-05-18T03:51:01.332026+00:00","updated_at":"2026-05-18T03:51:01.332026+00:00"}