{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:HMVD45YLNEVTI7Z2TCBIPRI2RX","short_pith_number":"pith:HMVD45YL","canonical_record":{"source":{"id":"2302.13461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-02-27T01:26:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"27399f536889d8c2fc513541ccf5b766dec3ecd7fc055e18fecd8bebbf6d5979","abstract_canon_sha256":"e4c120924846656ad028237ba70edaf112c29051092e97998a7190292ba6eac0"},"schema_version":"1.0"},"canonical_sha256":"3b2a3e770b692b347f3a988287c51a8dd14cbc0a1c102a65a686a2957b8705d0","source":{"kind":"arxiv","id":"2302.13461","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.13461","created_at":"2026-07-05T05:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"2302.13461v1","created_at":"2026-07-05T05:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.13461","created_at":"2026-07-05T05:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"HMVD45YLNEVT","created_at":"2026-07-05T05:45:47Z"},{"alias_kind":"pith_short_16","alias_value":"HMVD45YLNEVTI7Z2","created_at":"2026-07-05T05:45:47Z"},{"alias_kind":"pith_short_8","alias_value":"HMVD45YL","created_at":"2026-07-05T05:45:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:HMVD45YLNEVTI7Z2TCBIPRI2RX","target":"record","payload":{"canonical_record":{"source":{"id":"2302.13461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-02-27T01:26:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"27399f536889d8c2fc513541ccf5b766dec3ecd7fc055e18fecd8bebbf6d5979","abstract_canon_sha256":"e4c120924846656ad028237ba70edaf112c29051092e97998a7190292ba6eac0"},"schema_version":"1.0"},"canonical_sha256":"3b2a3e770b692b347f3a988287c51a8dd14cbc0a1c102a65a686a2957b8705d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:45:47.187855Z","signature_b64":"VRKdcyOblNNKfTyKxClcseOaTz9wJFBdLvVkonLx008DgGO3cgKZLi4E+b+4zBWYmRvIDNIXXZ0jhkDEUXYBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b2a3e770b692b347f3a988287c51a8dd14cbc0a1c102a65a686a2957b8705d0","last_reissued_at":"2026-07-05T05:45:47.187299Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:45:47.187299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.13461","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-05T05:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vKE85w131WaH90gwUhVxXdHfZXCJ2dtv2WJY22JQ6UF9dr9aXAQJqLmdU9oWA2H/85wI2tzkzn2g3iIi/w5HBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T03:42:39.988745Z"},"content_sha256":"af66e913c3143df433a106c531c9b8e57b8d593941c743fe331fc2b39bf0dcd1","schema_version":"1.0","event_id":"sha256:af66e913c3143df433a106c531c9b8e57b8d593941c743fe331fc2b39bf0dcd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:HMVD45YLNEVTI7Z2TCBIPRI2RX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameters of several families of binary duadic codes and their related codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chengju Li, Haifeng Qian, Hai Liu","submitted_at":"2023-02-27T01:26:36Z","abstract_excerpt":"Binary duadic codes are an interesting subclass of cyclic codes since they have large dimensions and their minimum distances may have a square-root bound.\n  In this paper, we present several families of binary duadic codes of length $2^m-1$ and develop some lower bounds on their minimum distances by using the BCH bound on cyclic codes, which partially solves one case of the open problem proposed in \\cite{LLD}. It is shown that the lower bounds on their minimum distances are close to the square root bound. Moreover, the parameters of the dual and extended codes of these binary duadic codes are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.13461","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/2302.13461/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-05T05:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/gCcgw1YCma5pl8SB9l2ahx2aEOxgKex9bWXczsBp0pS9KbBAtDnQAMOMaHJ2XgVroQSANXmllS26VyoJV4GBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T03:42:39.989119Z"},"content_sha256":"c3197c4f5948e794c40cc8ddcd8073cddfe088a5ff82a62fd3e46173025393f5","schema_version":"1.0","event_id":"sha256:c3197c4f5948e794c40cc8ddcd8073cddfe088a5ff82a62fd3e46173025393f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HMVD45YLNEVTI7Z2TCBIPRI2RX/bundle.json","state_url":"https://pith.science/pith/HMVD45YLNEVTI7Z2TCBIPRI2RX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HMVD45YLNEVTI7Z2TCBIPRI2RX/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-06T03:42:39Z","links":{"resolver":"https://pith.science/pith/HMVD45YLNEVTI7Z2TCBIPRI2RX","bundle":"https://pith.science/pith/HMVD45YLNEVTI7Z2TCBIPRI2RX/bundle.json","state":"https://pith.science/pith/HMVD45YLNEVTI7Z2TCBIPRI2RX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HMVD45YLNEVTI7Z2TCBIPRI2RX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:HMVD45YLNEVTI7Z2TCBIPRI2RX","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":"e4c120924846656ad028237ba70edaf112c29051092e97998a7190292ba6eac0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-02-27T01:26:36Z","title_canon_sha256":"27399f536889d8c2fc513541ccf5b766dec3ecd7fc055e18fecd8bebbf6d5979"},"schema_version":"1.0","source":{"id":"2302.13461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.13461","created_at":"2026-07-05T05:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"2302.13461v1","created_at":"2026-07-05T05:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.13461","created_at":"2026-07-05T05:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"HMVD45YLNEVT","created_at":"2026-07-05T05:45:47Z"},{"alias_kind":"pith_short_16","alias_value":"HMVD45YLNEVTI7Z2","created_at":"2026-07-05T05:45:47Z"},{"alias_kind":"pith_short_8","alias_value":"HMVD45YL","created_at":"2026-07-05T05:45:47Z"}],"graph_snapshots":[{"event_id":"sha256:c3197c4f5948e794c40cc8ddcd8073cddfe088a5ff82a62fd3e46173025393f5","target":"graph","created_at":"2026-07-05T05:45:47Z","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/2302.13461/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Binary duadic codes are an interesting subclass of cyclic codes since they have large dimensions and their minimum distances may have a square-root bound.\n  In this paper, we present several families of binary duadic codes of length $2^m-1$ and develop some lower bounds on their minimum distances by using the BCH bound on cyclic codes, which partially solves one case of the open problem proposed in \\cite{LLD}. It is shown that the lower bounds on their minimum distances are close to the square root bound. Moreover, the parameters of the dual and extended codes of these binary duadic codes are ","authors_text":"Chengju Li, Haifeng Qian, Hai Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-02-27T01:26:36Z","title":"Parameters of several families of binary duadic codes and their related codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.13461","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:af66e913c3143df433a106c531c9b8e57b8d593941c743fe331fc2b39bf0dcd1","target":"record","created_at":"2026-07-05T05:45:47Z","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":"e4c120924846656ad028237ba70edaf112c29051092e97998a7190292ba6eac0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-02-27T01:26:36Z","title_canon_sha256":"27399f536889d8c2fc513541ccf5b766dec3ecd7fc055e18fecd8bebbf6d5979"},"schema_version":"1.0","source":{"id":"2302.13461","kind":"arxiv","version":1}},"canonical_sha256":"3b2a3e770b692b347f3a988287c51a8dd14cbc0a1c102a65a686a2957b8705d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b2a3e770b692b347f3a988287c51a8dd14cbc0a1c102a65a686a2957b8705d0","first_computed_at":"2026-07-05T05:45:47.187299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:45:47.187299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VRKdcyOblNNKfTyKxClcseOaTz9wJFBdLvVkonLx008DgGO3cgKZLi4E+b+4zBWYmRvIDNIXXZ0jhkDEUXYBCw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:45:47.187855Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.13461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af66e913c3143df433a106c531c9b8e57b8d593941c743fe331fc2b39bf0dcd1","sha256:c3197c4f5948e794c40cc8ddcd8073cddfe088a5ff82a62fd3e46173025393f5"],"state_sha256":"ef956631945f33d1be39371251251a996566644ac3563891e4d66750d3624907"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S8koygNowgrMHkMc6voEJsp4n1TcUNKy82IXsqwyFWY6y3Psd0BmSq7jOe+rjvHU85hHfJ5XcFGW2mclzPnOBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T03:42:39.991787Z","bundle_sha256":"555531984825a7bc04a88683fb69336eeeab7a5a4db27002f4145ec4037cf417"}}