{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:VWUYD4RGGXFMQLW7KXOQD3VDPQ","short_pith_number":"pith:VWUYD4RG","canonical_record":{"source":{"id":"2310.20179","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-31T05:01:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c37c8e29fd6e3d057aed2f816e0db798ee448bd98d4c10460f1b182865897839","abstract_canon_sha256":"20bacd2e05d065eaad0f5e8d6c0a7fe398bfca58fc2419e5419ed65932442f93"},"schema_version":"1.0"},"canonical_sha256":"ada981f22635cac82edf55dd01eea37c1b6eb6ed27b81d2136579fcaa6e7dbb8","source":{"kind":"arxiv","id":"2310.20179","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.20179","created_at":"2026-07-05T07:07:25Z"},{"alias_kind":"arxiv_version","alias_value":"2310.20179v1","created_at":"2026-07-05T07:07:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.20179","created_at":"2026-07-05T07:07:25Z"},{"alias_kind":"pith_short_12","alias_value":"VWUYD4RGGXFM","created_at":"2026-07-05T07:07:25Z"},{"alias_kind":"pith_short_16","alias_value":"VWUYD4RGGXFMQLW7","created_at":"2026-07-05T07:07:25Z"},{"alias_kind":"pith_short_8","alias_value":"VWUYD4RG","created_at":"2026-07-05T07:07:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:VWUYD4RGGXFMQLW7KXOQD3VDPQ","target":"record","payload":{"canonical_record":{"source":{"id":"2310.20179","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-31T05:01:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c37c8e29fd6e3d057aed2f816e0db798ee448bd98d4c10460f1b182865897839","abstract_canon_sha256":"20bacd2e05d065eaad0f5e8d6c0a7fe398bfca58fc2419e5419ed65932442f93"},"schema_version":"1.0"},"canonical_sha256":"ada981f22635cac82edf55dd01eea37c1b6eb6ed27b81d2136579fcaa6e7dbb8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:07:25.420030Z","signature_b64":"+StmIQ6GpjiHwouPI4dPDJSP8JbQwKvreDVSb3T42PYuSDT3dToNDJ63qPPdMrEY0cHTv+KMeCDVKyeYr44WCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ada981f22635cac82edf55dd01eea37c1b6eb6ed27b81d2136579fcaa6e7dbb8","last_reissued_at":"2026-07-05T07:07:25.419568Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:07:25.419568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.20179","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:07:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XWYzRcWlo+ZUNVYAAjNFIyvj9afllkLlN1WTmZSSDBVumNiakurl6KGG89nKKk8p9VdgUukZMJJVPuVAh6/+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:55:56.359992Z"},"content_sha256":"37c962375e03d1606ac44fe1e073df883a25a4cb1ef7a93266162e1efa8e1ad3","schema_version":"1.0","event_id":"sha256:37c962375e03d1606ac44fe1e073df883a25a4cb1ef7a93266162e1efa8e1ad3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:VWUYD4RGGXFMQLW7KXOQD3VDPQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Generalization of the Tang-Ding Binary Cyclic Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ling Li, Shixin Zhu, Zhonghua Sun","submitted_at":"2023-10-31T05:01:58Z","abstract_excerpt":"Cyclic codes are an interesting family of linear codes since they have efficient decoding algorithms and contain optimal codes as subfamilies. Constructing infinite families of cyclic codes with good parameters is important in both theory and practice. Recently, Tang and Ding [IEEE Trans. Inf. Theory, vol. 68, no. 12, pp. 7842--7849, 2022] proposed an infinite family of binary cyclic codes with good parameters. Shi et al. [arXiv:2309.12003v1, 2023] developed the binary Tang-Ding codes to the $4$-ary case. Inspired by these two works, we study $2^s$-ary Tang-Ding codes, where $s\\geq 2$. Good lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.20179","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/2310.20179/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:07:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"azrHZ7HV05M5wxrYwuUgrSHrimxy7Ptu4t1tg0n04oOi9uw0U2UDpzljVfEHs8TaXqXlYV3i9RXlmg2bB75jBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:55:56.360385Z"},"content_sha256":"34aafea1c326cddfd16e785a09d5c203a6486792f8542a366170bbe10ffc36ae","schema_version":"1.0","event_id":"sha256:34aafea1c326cddfd16e785a09d5c203a6486792f8542a366170bbe10ffc36ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VWUYD4RGGXFMQLW7KXOQD3VDPQ/bundle.json","state_url":"https://pith.science/pith/VWUYD4RGGXFMQLW7KXOQD3VDPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VWUYD4RGGXFMQLW7KXOQD3VDPQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T07:55:56Z","links":{"resolver":"https://pith.science/pith/VWUYD4RGGXFMQLW7KXOQD3VDPQ","bundle":"https://pith.science/pith/VWUYD4RGGXFMQLW7KXOQD3VDPQ/bundle.json","state":"https://pith.science/pith/VWUYD4RGGXFMQLW7KXOQD3VDPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VWUYD4RGGXFMQLW7KXOQD3VDPQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:VWUYD4RGGXFMQLW7KXOQD3VDPQ","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":"20bacd2e05d065eaad0f5e8d6c0a7fe398bfca58fc2419e5419ed65932442f93","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-31T05:01:58Z","title_canon_sha256":"c37c8e29fd6e3d057aed2f816e0db798ee448bd98d4c10460f1b182865897839"},"schema_version":"1.0","source":{"id":"2310.20179","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.20179","created_at":"2026-07-05T07:07:25Z"},{"alias_kind":"arxiv_version","alias_value":"2310.20179v1","created_at":"2026-07-05T07:07:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.20179","created_at":"2026-07-05T07:07:25Z"},{"alias_kind":"pith_short_12","alias_value":"VWUYD4RGGXFM","created_at":"2026-07-05T07:07:25Z"},{"alias_kind":"pith_short_16","alias_value":"VWUYD4RGGXFMQLW7","created_at":"2026-07-05T07:07:25Z"},{"alias_kind":"pith_short_8","alias_value":"VWUYD4RG","created_at":"2026-07-05T07:07:25Z"}],"graph_snapshots":[{"event_id":"sha256:34aafea1c326cddfd16e785a09d5c203a6486792f8542a366170bbe10ffc36ae","target":"graph","created_at":"2026-07-05T07:07:25Z","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/2310.20179/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Cyclic codes are an interesting family of linear codes since they have efficient decoding algorithms and contain optimal codes as subfamilies. Constructing infinite families of cyclic codes with good parameters is important in both theory and practice. Recently, Tang and Ding [IEEE Trans. Inf. Theory, vol. 68, no. 12, pp. 7842--7849, 2022] proposed an infinite family of binary cyclic codes with good parameters. Shi et al. [arXiv:2309.12003v1, 2023] developed the binary Tang-Ding codes to the $4$-ary case. Inspired by these two works, we study $2^s$-ary Tang-Ding codes, where $s\\geq 2$. Good lo","authors_text":"Ling Li, Shixin Zhu, Zhonghua Sun","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-31T05:01:58Z","title":"A Generalization of the Tang-Ding Binary Cyclic Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.20179","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:37c962375e03d1606ac44fe1e073df883a25a4cb1ef7a93266162e1efa8e1ad3","target":"record","created_at":"2026-07-05T07:07:25Z","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":"20bacd2e05d065eaad0f5e8d6c0a7fe398bfca58fc2419e5419ed65932442f93","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-31T05:01:58Z","title_canon_sha256":"c37c8e29fd6e3d057aed2f816e0db798ee448bd98d4c10460f1b182865897839"},"schema_version":"1.0","source":{"id":"2310.20179","kind":"arxiv","version":1}},"canonical_sha256":"ada981f22635cac82edf55dd01eea37c1b6eb6ed27b81d2136579fcaa6e7dbb8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ada981f22635cac82edf55dd01eea37c1b6eb6ed27b81d2136579fcaa6e7dbb8","first_computed_at":"2026-07-05T07:07:25.419568Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:07:25.419568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+StmIQ6GpjiHwouPI4dPDJSP8JbQwKvreDVSb3T42PYuSDT3dToNDJ63qPPdMrEY0cHTv+KMeCDVKyeYr44WCw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:07:25.420030Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.20179","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37c962375e03d1606ac44fe1e073df883a25a4cb1ef7a93266162e1efa8e1ad3","sha256:34aafea1c326cddfd16e785a09d5c203a6486792f8542a366170bbe10ffc36ae"],"state_sha256":"ae67c81debadd4d6da1e0a8e32de7d32a0df8dd2607e8f01dac3202e4705e362"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V/6FbGUpWf/wujTyHW+os6ZbLu++4Wit9xGzHKD78lWZgk9puwHUD26UKAl04JcOp+wiq98vWph+8prZS+R6Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:55:56.362446Z","bundle_sha256":"7eb2a67b5f2ca10e0457f7881ac3c435ebbe3d59d034c4c70c357f00597c6e1e"}}