{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:YUXGIZJFSHSVJNGYPC7VQI7323","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":"c82da8f1cfab7d6b8321ceabdc5d8da30fa4d0c46709350ca72a3aa065a775ed","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-10-16T06:41:57Z","title_canon_sha256":"d83748c748094fbfff731f115be6370d353736bedd203476073d1b649f192fd0"},"schema_version":"1.0","source":{"id":"2210.08463","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.08463","created_at":"2026-07-05T05:07:11Z"},{"alias_kind":"arxiv_version","alias_value":"2210.08463v1","created_at":"2026-07-05T05:07:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.08463","created_at":"2026-07-05T05:07:11Z"},{"alias_kind":"pith_short_12","alias_value":"YUXGIZJFSHSV","created_at":"2026-07-05T05:07:11Z"},{"alias_kind":"pith_short_16","alias_value":"YUXGIZJFSHSVJNGY","created_at":"2026-07-05T05:07:11Z"},{"alias_kind":"pith_short_8","alias_value":"YUXGIZJF","created_at":"2026-07-05T05:07:11Z"}],"graph_snapshots":[{"event_id":"sha256:965bffb6ea5db2a57b23641f16a238c6b1414801b1f1f8f19fa8751750704b4b","target":"graph","created_at":"2026-07-05T05:07:11Z","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/2210.08463/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"BCH codes and their dual codes are two special subclasses of cyclic codes and are the best linear codes in many cases. A lot of progress on the study of BCH cyclic codes has been made, but little is known about the minimum distances of the duals of BCH codes. Recently, a new concept called dually-BCH code was introduced to investigate the duals of BCH codes and the lower bounds on their minimum distances in \\cite{GDL21}. For a prime power $q$ and an integer $m \\ge 4$, let $n=\\frac{q^m-1}{q+1}$ \\ ($m$ even), or $n=\\frac{q^m-1}{q-1}$ \\ ($q>2$).\n  In this paper, some sufficient and necessary cond","authors_text":"Chengju Li, Jiaojiao Wang, Xiaoqiang Wang, Yansheng Wu","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-10-16T06:41:57Z","title":"Two classes of narrow-sense BCH codes and their duals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.08463","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:5b763cc5d66225550261ad929500909c3defc74764182d3687f854caf216127f","target":"record","created_at":"2026-07-05T05:07:11Z","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":"c82da8f1cfab7d6b8321ceabdc5d8da30fa4d0c46709350ca72a3aa065a775ed","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-10-16T06:41:57Z","title_canon_sha256":"d83748c748094fbfff731f115be6370d353736bedd203476073d1b649f192fd0"},"schema_version":"1.0","source":{"id":"2210.08463","kind":"arxiv","version":1}},"canonical_sha256":"c52e64652591e554b4d878bf5823fbd6ee21180d1d602e8a8b40cb89cfbaeca7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c52e64652591e554b4d878bf5823fbd6ee21180d1d602e8a8b40cb89cfbaeca7","first_computed_at":"2026-07-05T05:07:11.262465Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:07:11.262465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A//wapPI+ABuF8wWCLaf+YsG52g862LyvIERs0LJu3JVh4Q+SorOL0WfRXDyjQb9aVWEICzvujANhTi52WJOBw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:07:11.262890Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.08463","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b763cc5d66225550261ad929500909c3defc74764182d3687f854caf216127f","sha256:965bffb6ea5db2a57b23641f16a238c6b1414801b1f1f8f19fa8751750704b4b"],"state_sha256":"ee5404f2e943f8250b65325c8215a09f5380b0826186c95425587711b0ac7b64"}