{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZZBDM7SL4WHBDEUWLGQM4UVQ6L","short_pith_number":"pith:ZZBDM7SL","schema_version":"1.0","canonical_sha256":"ce42367e4be58e11929659a0ce52b0f2dab0ffc97fedbf14fe248b5127055c1e","source":{"kind":"arxiv","id":"2606.02262","version":1},"attestation_state":"computed","paper":{"title":"Four constructions of self-dual binary cyclic codes with a lower bound on the minimum distances better than the square-root bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cunsheng Ding, Dabin Zheng, Hao Chen, Xiaoqiang Wang, Xun Song","submitted_at":"2026-06-01T13:49:43Z","abstract_excerpt":"In spite of the intensive study of cyclic codes and the recent construction of an infinite family of self-dual binary cyclic codes whose minimum distances have the square-root bound in IEEE Trans. IT, vol. 71, no. 4, 2025, it is still a 70-year-old open problem whether there is an infinite family of self-dual binary cyclic codes whose minimum distances have a lower bound better than the square-root bound. This paper settles this long-standing open problem in coding theory by presenting infinite families of such self-dual binary cyclic codes. As by-products, several families of cyclic codes wit"},"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":"2606.02262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-01T13:49:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b2b099d626f1c0ccf34228f08a3e5b849f0d1c79d33c7b582bf0a542a38b93dc","abstract_canon_sha256":"c6f70a326edc6c9e246541db9e5b5cb7cb306a6e204fbd769d9dfd8419eda03e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:04:54.449584Z","signature_b64":"mR8fqx4aYpXVPeub/i6quUxKlb3pjSRg4ZzY7Qy/MT+pcSij3TR3e9MOvoVLtVuc8IxOdyDSu+v9eEM22ttmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce42367e4be58e11929659a0ce52b0f2dab0ffc97fedbf14fe248b5127055c1e","last_reissued_at":"2026-06-02T03:04:54.449235Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:04:54.449235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Four constructions of self-dual binary cyclic codes with a lower bound on the minimum distances better than the square-root bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cunsheng Ding, Dabin Zheng, Hao Chen, Xiaoqiang Wang, Xun Song","submitted_at":"2026-06-01T13:49:43Z","abstract_excerpt":"In spite of the intensive study of cyclic codes and the recent construction of an infinite family of self-dual binary cyclic codes whose minimum distances have the square-root bound in IEEE Trans. IT, vol. 71, no. 4, 2025, it is still a 70-year-old open problem whether there is an infinite family of self-dual binary cyclic codes whose minimum distances have a lower bound better than the square-root bound. This paper settles this long-standing open problem in coding theory by presenting infinite families of such self-dual binary cyclic codes. As by-products, several families of cyclic codes wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02262","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/2606.02262/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":"2606.02262","created_at":"2026-06-02T03:04:54.449290+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.02262v1","created_at":"2026-06-02T03:04:54.449290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02262","created_at":"2026-06-02T03:04:54.449290+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZBDM7SL4WHB","created_at":"2026-06-02T03:04:54.449290+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZBDM7SL4WHBDEUW","created_at":"2026-06-02T03:04:54.449290+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZBDM7SL","created_at":"2026-06-02T03:04:54.449290+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/ZZBDM7SL4WHBDEUWLGQM4UVQ6L","json":"https://pith.science/pith/ZZBDM7SL4WHBDEUWLGQM4UVQ6L.json","graph_json":"https://pith.science/api/pith-number/ZZBDM7SL4WHBDEUWLGQM4UVQ6L/graph.json","events_json":"https://pith.science/api/pith-number/ZZBDM7SL4WHBDEUWLGQM4UVQ6L/events.json","paper":"https://pith.science/paper/ZZBDM7SL"},"agent_actions":{"view_html":"https://pith.science/pith/ZZBDM7SL4WHBDEUWLGQM4UVQ6L","download_json":"https://pith.science/pith/ZZBDM7SL4WHBDEUWLGQM4UVQ6L.json","view_paper":"https://pith.science/paper/ZZBDM7SL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.02262&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZBDM7SL4WHBDEUWLGQM4UVQ6L/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZBDM7SL4WHBDEUWLGQM4UVQ6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZBDM7SL4WHBDEUWLGQM4UVQ6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZBDM7SL4WHBDEUWLGQM4UVQ6L/action/storage_attestation","attest_author":"https://pith.science/pith/ZZBDM7SL4WHBDEUWLGQM4UVQ6L/action/author_attestation","sign_citation":"https://pith.science/pith/ZZBDM7SL4WHBDEUWLGQM4UVQ6L/action/citation_signature","submit_replication":"https://pith.science/pith/ZZBDM7SL4WHBDEUWLGQM4UVQ6L/action/replication_record"}},"created_at":"2026-06-02T03:04:54.449290+00:00","updated_at":"2026-06-02T03:04:54.449290+00:00"}