{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NSQCDLOI36WFJQKSX4QOLYXKCF","short_pith_number":"pith:NSQCDLOI","schema_version":"1.0","canonical_sha256":"6ca021adc8dfac54c152bf20e5e2ea117a7459639e67e56bf654bbe2ffe13774","source":{"kind":"arxiv","id":"2107.04579","version":1},"attestation_state":"computed","paper":{"title":"Optimal three-weight cyclic codes whose duals are also optimal","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"F\\'elix Hern\\'andez, Gerardo Vega","submitted_at":"2021-07-09T17:53:14Z","abstract_excerpt":"A class of optimal three-weight cyclic codes of dimension 3 over any finite field was presented by Vega [Finite Fields Appl., 42 (2016) 23-38]. Shortly thereafter, Heng and Yue [IEEE Trans. Inf. Theory, 62(8) (2016) 4501-4513] generalized this result by presenting several classes of cyclic codes with either optimal three weights or a few weights. Here we present a new class of optimal three-weight cyclic codes of length $q+1$ and dimension 3 over any finite field $F_q$, and show that the nonzero weights are $q-1$, $q$, and $q+1$. We then study the dual codes in this new class, and show that th"},"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":"2107.04579","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-07-09T17:53:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f2f65192aa4d82c0d0dcece34307b6b334f50f908e2a2a191be0983cae12c165","abstract_canon_sha256":"f014a75622e47b314f4a182f1406797fa0974177bd63b19c6cf87d7470c02b0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:56:34.709132Z","signature_b64":"LTFanOmIG9mOTgUBWoMB3DJJGQbvriG8DQV44qnYbarT0L6hwpHku+bBZJF76rtAqsgcLEH1b9rDHwF+0W5qDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ca021adc8dfac54c152bf20e5e2ea117a7459639e67e56bf654bbe2ffe13774","last_reissued_at":"2026-07-05T02:56:34.708699Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:56:34.708699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal three-weight cyclic codes whose duals are also optimal","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"F\\'elix Hern\\'andez, Gerardo Vega","submitted_at":"2021-07-09T17:53:14Z","abstract_excerpt":"A class of optimal three-weight cyclic codes of dimension 3 over any finite field was presented by Vega [Finite Fields Appl., 42 (2016) 23-38]. Shortly thereafter, Heng and Yue [IEEE Trans. Inf. Theory, 62(8) (2016) 4501-4513] generalized this result by presenting several classes of cyclic codes with either optimal three weights or a few weights. Here we present a new class of optimal three-weight cyclic codes of length $q+1$ and dimension 3 over any finite field $F_q$, and show that the nonzero weights are $q-1$, $q$, and $q+1$. We then study the dual codes in this new class, and show that th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.04579","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.04579/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2107.04579","created_at":"2026-07-05T02:56:34.708756+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.04579v1","created_at":"2026-07-05T02:56:34.708756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.04579","created_at":"2026-07-05T02:56:34.708756+00:00"},{"alias_kind":"pith_short_12","alias_value":"NSQCDLOI36WF","created_at":"2026-07-05T02:56:34.708756+00:00"},{"alias_kind":"pith_short_16","alias_value":"NSQCDLOI36WFJQKS","created_at":"2026-07-05T02:56:34.708756+00:00"},{"alias_kind":"pith_short_8","alias_value":"NSQCDLOI","created_at":"2026-07-05T02:56:34.708756+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/NSQCDLOI36WFJQKSX4QOLYXKCF","json":"https://pith.science/pith/NSQCDLOI36WFJQKSX4QOLYXKCF.json","graph_json":"https://pith.science/api/pith-number/NSQCDLOI36WFJQKSX4QOLYXKCF/graph.json","events_json":"https://pith.science/api/pith-number/NSQCDLOI36WFJQKSX4QOLYXKCF/events.json","paper":"https://pith.science/paper/NSQCDLOI"},"agent_actions":{"view_html":"https://pith.science/pith/NSQCDLOI36WFJQKSX4QOLYXKCF","download_json":"https://pith.science/pith/NSQCDLOI36WFJQKSX4QOLYXKCF.json","view_paper":"https://pith.science/paper/NSQCDLOI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.04579&json=true","fetch_graph":"https://pith.science/api/pith-number/NSQCDLOI36WFJQKSX4QOLYXKCF/graph.json","fetch_events":"https://pith.science/api/pith-number/NSQCDLOI36WFJQKSX4QOLYXKCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSQCDLOI36WFJQKSX4QOLYXKCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSQCDLOI36WFJQKSX4QOLYXKCF/action/storage_attestation","attest_author":"https://pith.science/pith/NSQCDLOI36WFJQKSX4QOLYXKCF/action/author_attestation","sign_citation":"https://pith.science/pith/NSQCDLOI36WFJQKSX4QOLYXKCF/action/citation_signature","submit_replication":"https://pith.science/pith/NSQCDLOI36WFJQKSX4QOLYXKCF/action/replication_record"}},"created_at":"2026-07-05T02:56:34.708756+00:00","updated_at":"2026-07-05T02:56:34.708756+00:00"}