{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XFYBA2KWYUCS3B5DOHHIPXCGAF","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":"e5d6c007cf596cb72fa0fcdfe7574382169c354238331ddaa66b22cf3b400fbd","cross_cats_sorted":["math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-11T05:04:14Z","title_canon_sha256":"350bb1e658b2fab0eae8a886ca1bf262db2cc13ce231528888b13a395a45a97c"},"schema_version":"1.0","source":{"id":"1603.03520","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03520","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03520v1","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03520","created_at":"2026-05-18T01:19:15Z"},{"alias_kind":"pith_short_12","alias_value":"XFYBA2KWYUCS","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XFYBA2KWYUCS3B5D","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XFYBA2KW","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:9d9151982faa1188678fce764ab0efc638d848278ba7ce7e0adbcf90cee20a3d","target":"graph","created_at":"2026-05-18T01:19:15Z","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":"Cyclic and self-dual codes are important classes of codes in coding theory. Jia, Ling and Xing \\cite{Jia} as well as Kai and Zhu \\cite{Kai} proved that Euclidean self-dual cyclic codes of length $n$ over $\\mathbb{F}_q$ exist if and only if $n$ is even and $q=2^r$, where $r$ is any positive integer. For $n$ and $q$ even, there always exists an $[n, \\frac{n}{2}]$ self-dual cyclic code with generator polynomial $x^{\\frac{n}{2}}+1$ called the \\textit{trivial self-dual cyclic code}. In this paper we prove the existence of nontrivial self-dual cyclic codes of length $n=2^\\nu \\cdot \\bar{n}$, where $\\","authors_text":"Lilibeth D. Valdez, Odessa D. Consorte","cross_cats":["math.IT","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-11T05:04:14Z","title":"On Euclidean and Hermitian Self-Dual Cyclic Codes over $\\mathbb{F}_{2^r}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03520","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:80401f6ebfa13aee5c9ff472a03be546ea83188a8193af66efd91c1433de1768","target":"record","created_at":"2026-05-18T01:19:15Z","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":"e5d6c007cf596cb72fa0fcdfe7574382169c354238331ddaa66b22cf3b400fbd","cross_cats_sorted":["math.IT","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-11T05:04:14Z","title_canon_sha256":"350bb1e658b2fab0eae8a886ca1bf262db2cc13ce231528888b13a395a45a97c"},"schema_version":"1.0","source":{"id":"1603.03520","kind":"arxiv","version":1}},"canonical_sha256":"b970106956c5052d87a371ce87dc46017fd055f7f77e76bf2375784f5996aa82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b970106956c5052d87a371ce87dc46017fd055f7f77e76bf2375784f5996aa82","first_computed_at":"2026-05-18T01:19:15.446089Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:15.446089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y+W1aYWqJE1/nRpeoEb3VyD5vKt2URcRA3/Jp2JuODqyP8SFZ17tCu3n39qSivqoGg0Cf47xx2LV66BsoP2LAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:15.446486Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.03520","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80401f6ebfa13aee5c9ff472a03be546ea83188a8193af66efd91c1433de1768","sha256:9d9151982faa1188678fce764ab0efc638d848278ba7ce7e0adbcf90cee20a3d"],"state_sha256":"3dddc62ea5ff5213a1bd5f72119e22f3eea356f940aa015935869ba880740b3f"}