{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZZBDM7SL4WHBDEUWLGQM4UVQ6L","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":"c6f70a326edc6c9e246541db9e5b5cb7cb306a6e204fbd769d9dfd8419eda03e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-01T13:49:43Z","title_canon_sha256":"b2b099d626f1c0ccf34228f08a3e5b849f0d1c79d33c7b582bf0a542a38b93dc"},"schema_version":"1.0","source":{"id":"2606.02262","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02262","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02262v1","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02262","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZZBDM7SL4WHB","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"pith_short_16","alias_value":"ZZBDM7SL4WHBDEUW","created_at":"2026-06-02T03:04:54Z"},{"alias_kind":"pith_short_8","alias_value":"ZZBDM7SL","created_at":"2026-06-02T03:04:54Z"}],"graph_snapshots":[{"event_id":"sha256:2101fb3745c0abfafa9bb7f59cfe993d2a4589bda78f4cfc81b5fc71dbebac1e","target":"graph","created_at":"2026-06-02T03:04:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.02262/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Cunsheng Ding, Dabin Zheng, Hao Chen, Xiaoqiang Wang, Xun Song","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-01T13:49:43Z","title":"Four constructions of self-dual binary cyclic codes with a lower bound on the minimum distances better than the square-root bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02262","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:e5394661914bc6e0cef9d5dc7795b15672b2c1ec7d9f3e7f0236bd2ae42fbc3c","target":"record","created_at":"2026-06-02T03:04:54Z","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":"c6f70a326edc6c9e246541db9e5b5cb7cb306a6e204fbd769d9dfd8419eda03e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-01T13:49:43Z","title_canon_sha256":"b2b099d626f1c0ccf34228f08a3e5b849f0d1c79d33c7b582bf0a542a38b93dc"},"schema_version":"1.0","source":{"id":"2606.02262","kind":"arxiv","version":1}},"canonical_sha256":"ce42367e4be58e11929659a0ce52b0f2dab0ffc97fedbf14fe248b5127055c1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce42367e4be58e11929659a0ce52b0f2dab0ffc97fedbf14fe248b5127055c1e","first_computed_at":"2026-06-02T03:04:54.449235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T03:04:54.449235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mR8fqx4aYpXVPeub/i6quUxKlb3pjSRg4ZzY7Qy/MT+pcSij3TR3e9MOvoVLtVuc8IxOdyDSu+v9eEM22ttmBw==","signature_status":"signed_v1","signed_at":"2026-06-02T03:04:54.449584Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.02262","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5394661914bc6e0cef9d5dc7795b15672b2c1ec7d9f3e7f0236bd2ae42fbc3c","sha256:2101fb3745c0abfafa9bb7f59cfe993d2a4589bda78f4cfc81b5fc71dbebac1e"],"state_sha256":"53caed0cf0aaaaa741ad427b2a1148b61e0e2c8dbd4837571b058306dd29d7d6"}