{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PRKWJEAZ2L7BUVV3OS4VLEOBM7","short_pith_number":"pith:PRKWJEAZ","schema_version":"1.0","canonical_sha256":"7c55649019d2fe1a56bb74b95591c167d95b88730ed45789b08719b551fefbe2","source":{"kind":"arxiv","id":"1707.05716","version":1},"attestation_state":"computed","paper":{"title":"Enumeration of Self-Dual Cyclic Codes of some Specific Lengths over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Somphong Jitman, Supawadee Prugsapitak","submitted_at":"2017-07-18T15:59:08Z","abstract_excerpt":"Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length $n$ over a finite field if and only if $n$ and the field characteristic are even. The enumeration of such codes has been given under both the Euclidean and Hermitian products. However, in each case, the formula for self-dual cyclic codes of length $n$ over a finite field contains a characteristic function which is not easily computed. In this paper, we focus on more efficient ways to enumerate self-dual cyclic codes of lengths $2^\\nu p^r$ and $2^\\nu p^rq^s$, whe"},"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":"1707.05716","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-18T15:59:08Z","cross_cats_sorted":["math.IT","math.NT"],"title_canon_sha256":"e95c5202b9b77139d0992d17d0f5e0555d2f2f08a93c6c180221b539d1588928","abstract_canon_sha256":"7025bb56de0277c8dbd8e3c4e8fbb9969ac2059cb6a2037c8a6492310fe0ab73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:01.637326Z","signature_b64":"zsvfTS4i4DLBcrt/OPY+TRXbkpJedekBdWleMUL8ZtwfjnbZDmr22vM2MABt4JGm5AQs9ZomWoq1xFs7+up+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c55649019d2fe1a56bb74b95591c167d95b88730ed45789b08719b551fefbe2","last_reissued_at":"2026-05-18T00:40:01.636820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:01.636820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration of Self-Dual Cyclic Codes of some Specific Lengths over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Somphong Jitman, Supawadee Prugsapitak","submitted_at":"2017-07-18T15:59:08Z","abstract_excerpt":"Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length $n$ over a finite field if and only if $n$ and the field characteristic are even. The enumeration of such codes has been given under both the Euclidean and Hermitian products. However, in each case, the formula for self-dual cyclic codes of length $n$ over a finite field contains a characteristic function which is not easily computed. In this paper, we focus on more efficient ways to enumerate self-dual cyclic codes of lengths $2^\\nu p^r$ and $2^\\nu p^rq^s$, whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05716","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":"1707.05716","created_at":"2026-05-18T00:40:01.636885+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05716v1","created_at":"2026-05-18T00:40:01.636885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05716","created_at":"2026-05-18T00:40:01.636885+00:00"},{"alias_kind":"pith_short_12","alias_value":"PRKWJEAZ2L7B","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PRKWJEAZ2L7BUVV3","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PRKWJEAZ","created_at":"2026-05-18T12:31:37.085036+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/PRKWJEAZ2L7BUVV3OS4VLEOBM7","json":"https://pith.science/pith/PRKWJEAZ2L7BUVV3OS4VLEOBM7.json","graph_json":"https://pith.science/api/pith-number/PRKWJEAZ2L7BUVV3OS4VLEOBM7/graph.json","events_json":"https://pith.science/api/pith-number/PRKWJEAZ2L7BUVV3OS4VLEOBM7/events.json","paper":"https://pith.science/paper/PRKWJEAZ"},"agent_actions":{"view_html":"https://pith.science/pith/PRKWJEAZ2L7BUVV3OS4VLEOBM7","download_json":"https://pith.science/pith/PRKWJEAZ2L7BUVV3OS4VLEOBM7.json","view_paper":"https://pith.science/paper/PRKWJEAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05716&json=true","fetch_graph":"https://pith.science/api/pith-number/PRKWJEAZ2L7BUVV3OS4VLEOBM7/graph.json","fetch_events":"https://pith.science/api/pith-number/PRKWJEAZ2L7BUVV3OS4VLEOBM7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PRKWJEAZ2L7BUVV3OS4VLEOBM7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PRKWJEAZ2L7BUVV3OS4VLEOBM7/action/storage_attestation","attest_author":"https://pith.science/pith/PRKWJEAZ2L7BUVV3OS4VLEOBM7/action/author_attestation","sign_citation":"https://pith.science/pith/PRKWJEAZ2L7BUVV3OS4VLEOBM7/action/citation_signature","submit_replication":"https://pith.science/pith/PRKWJEAZ2L7BUVV3OS4VLEOBM7/action/replication_record"}},"created_at":"2026-05-18T00:40:01.636885+00:00","updated_at":"2026-05-18T00:40:01.636885+00:00"}