{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KFCGYRNEELNVACUAOHT5L5IBOJ","short_pith_number":"pith:KFCGYRNE","schema_version":"1.0","canonical_sha256":"51446c45a422db500a8071e7d5f50172482494c747e46f3c7510783c51d332bb","source":{"kind":"arxiv","id":"1505.00356","version":1},"attestation_state":"computed","paper":{"title":"On Repeated-Root Constacyclic Codes of Length $2^amp^r$ over Finite Fields","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":"2015-05-02T17:09:47Z","abstract_excerpt":"In this paper we investigate the structure of repeated root constacyclic codes of length $2^amp^r$ over $\\mathbb{F}_{p^s}$ with $a\\geq1$ and $(m,p)=1$.\n  We characterize the codes in terms of their generator polynomials. This provides simple conditions on the existence of self-dual negacyclic codes. Further, we gave cases where the constacyclic codes are equivalent to cyclic codes."},"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":"1505.00356","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2015-05-02T17:09:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0c934ef7e7c8fec513c08035cfb6be2a2ab8ad05276cc10219a18c91078a9c5c","abstract_canon_sha256":"a952c01c2465b71c1f046d2f1d2b5dc9bf08196a4cbe9c9974f190ec46be27f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:10.390752Z","signature_b64":"wOCXOzVZojtQqUAQbPO4L0EvMdjyvabVkUuD6XexsOxBEhJGG7y9/SRzvfcLY5Atisi8Z/P+KDtJhHsPbyvyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51446c45a422db500a8071e7d5f50172482494c747e46f3c7510783c51d332bb","last_reissued_at":"2026-05-18T02:17:10.390201Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:10.390201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Repeated-Root Constacyclic Codes of Length $2^amp^r$ over Finite Fields","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":"2015-05-02T17:09:47Z","abstract_excerpt":"In this paper we investigate the structure of repeated root constacyclic codes of length $2^amp^r$ over $\\mathbb{F}_{p^s}$ with $a\\geq1$ and $(m,p)=1$.\n  We characterize the codes in terms of their generator polynomials. This provides simple conditions on the existence of self-dual negacyclic codes. Further, we gave cases where the constacyclic codes are equivalent to cyclic codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00356","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":"1505.00356","created_at":"2026-05-18T02:17:10.390287+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.00356v1","created_at":"2026-05-18T02:17:10.390287+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00356","created_at":"2026-05-18T02:17:10.390287+00:00"},{"alias_kind":"pith_short_12","alias_value":"KFCGYRNEELNV","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KFCGYRNEELNVACUA","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KFCGYRNE","created_at":"2026-05-18T12:29:27.538025+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/KFCGYRNEELNVACUAOHT5L5IBOJ","json":"https://pith.science/pith/KFCGYRNEELNVACUAOHT5L5IBOJ.json","graph_json":"https://pith.science/api/pith-number/KFCGYRNEELNVACUAOHT5L5IBOJ/graph.json","events_json":"https://pith.science/api/pith-number/KFCGYRNEELNVACUAOHT5L5IBOJ/events.json","paper":"https://pith.science/paper/KFCGYRNE"},"agent_actions":{"view_html":"https://pith.science/pith/KFCGYRNEELNVACUAOHT5L5IBOJ","download_json":"https://pith.science/pith/KFCGYRNEELNVACUAOHT5L5IBOJ.json","view_paper":"https://pith.science/paper/KFCGYRNE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.00356&json=true","fetch_graph":"https://pith.science/api/pith-number/KFCGYRNEELNVACUAOHT5L5IBOJ/graph.json","fetch_events":"https://pith.science/api/pith-number/KFCGYRNEELNVACUAOHT5L5IBOJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KFCGYRNEELNVACUAOHT5L5IBOJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KFCGYRNEELNVACUAOHT5L5IBOJ/action/storage_attestation","attest_author":"https://pith.science/pith/KFCGYRNEELNVACUAOHT5L5IBOJ/action/author_attestation","sign_citation":"https://pith.science/pith/KFCGYRNEELNVACUAOHT5L5IBOJ/action/citation_signature","submit_replication":"https://pith.science/pith/KFCGYRNEELNVACUAOHT5L5IBOJ/action/replication_record"}},"created_at":"2026-05-18T02:17:10.390287+00:00","updated_at":"2026-05-18T02:17:10.390287+00:00"}