{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YVCLUFWPVKMYQJDYVRV7Y4E7AI","short_pith_number":"pith:YVCLUFWP","canonical_record":{"source":{"id":"1701.03986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-15T02:47:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3f0dfc17cde8efba9facffcf59ed66200ac6e79e8c69e7c9a75f601be71ae999","abstract_canon_sha256":"6cad52c61a67d666a372a3952b83f8bd0b7cb56eaaeac30c252f0b486a73d60e"},"schema_version":"1.0"},"canonical_sha256":"c544ba16cfaa99882478ac6bfc709f022ec61d49fcee5bf09a98c6e610759e06","source":{"kind":"arxiv","id":"1701.03986","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03986","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03986v1","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03986","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"pith_short_12","alias_value":"YVCLUFWPVKMY","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YVCLUFWPVKMYQJDY","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YVCLUFWP","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YVCLUFWPVKMYQJDYVRV7Y4E7AI","target":"record","payload":{"canonical_record":{"source":{"id":"1701.03986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-15T02:47:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3f0dfc17cde8efba9facffcf59ed66200ac6e79e8c69e7c9a75f601be71ae999","abstract_canon_sha256":"6cad52c61a67d666a372a3952b83f8bd0b7cb56eaaeac30c252f0b486a73d60e"},"schema_version":"1.0"},"canonical_sha256":"c544ba16cfaa99882478ac6bfc709f022ec61d49fcee5bf09a98c6e610759e06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:48.206044Z","signature_b64":"3vPXYV79Mj0kDt4GdrxCqjdTGX4Twqk/ZWc50eVvYj43y5pZEY96MJIuf92z6DXZ82prTK1YQO0aqnIRPe3DAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c544ba16cfaa99882478ac6bfc709f022ec61d49fcee5bf09a98c6e610759e06","last_reissued_at":"2026-05-18T00:52:48.205378Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:48.205378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.03986","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-05-18T00:52:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lPoEgRXsh7I1vz48eHlb3+HfcN/XSKWzfbO02JWR5N+OLDBivP9lYT8rsGYeH6Lp1L188Uh57zBifRKKGh+qCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T08:12:16.522420Z"},"content_sha256":"f30312acc07ff0be226f349ecb9cada776fd0fc30f237f055735e4548f99f41a","schema_version":"1.0","event_id":"sha256:f30312acc07ff0be226f349ecb9cada776fd0fc30f237f055735e4548f99f41a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YVCLUFWPVKMYQJDYVRV7Y4E7AI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Hermitian LCD codes from cyclic codes and their applications to orthogonal direct sum masking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chengju Li","submitted_at":"2017-01-15T02:47:05Z","abstract_excerpt":"Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. It was proved that asymptotically good Hermitian LCD codes exist. The objective of this paper is to construct some cyclic Hermitian LCD codes over finite fields and analyse their parameters. The dimensions of these codes are settled and the lower bounds on their minimum distances are presented. Most Hermitian LCD codes presented in this paper are not BCH codes. In addition, we employ Hermitian LCD codes to propose a Hermit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03986","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":""},"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-05-18T00:52:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GIafjC4b4REyHrlSvbbRv5mZ3/kDNllIUhHZlLU3NZIl91W9LYKlhzZM2Ta/MWWqcvZgH91TkPjGvjS2ghb7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T08:12:16.522769Z"},"content_sha256":"ee7e0d2617d17590a0ca190b78e3a333ced8b3b580213fb5dedd0896e54cbbc0","schema_version":"1.0","event_id":"sha256:ee7e0d2617d17590a0ca190b78e3a333ced8b3b580213fb5dedd0896e54cbbc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YVCLUFWPVKMYQJDYVRV7Y4E7AI/bundle.json","state_url":"https://pith.science/pith/YVCLUFWPVKMYQJDYVRV7Y4E7AI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YVCLUFWPVKMYQJDYVRV7Y4E7AI/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-06T08:12:16Z","links":{"resolver":"https://pith.science/pith/YVCLUFWPVKMYQJDYVRV7Y4E7AI","bundle":"https://pith.science/pith/YVCLUFWPVKMYQJDYVRV7Y4E7AI/bundle.json","state":"https://pith.science/pith/YVCLUFWPVKMYQJDYVRV7Y4E7AI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YVCLUFWPVKMYQJDYVRV7Y4E7AI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YVCLUFWPVKMYQJDYVRV7Y4E7AI","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":"6cad52c61a67d666a372a3952b83f8bd0b7cb56eaaeac30c252f0b486a73d60e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-15T02:47:05Z","title_canon_sha256":"3f0dfc17cde8efba9facffcf59ed66200ac6e79e8c69e7c9a75f601be71ae999"},"schema_version":"1.0","source":{"id":"1701.03986","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03986","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03986v1","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03986","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"pith_short_12","alias_value":"YVCLUFWPVKMY","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YVCLUFWPVKMYQJDY","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YVCLUFWP","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:ee7e0d2617d17590a0ca190b78e3a333ced8b3b580213fb5dedd0896e54cbbc0","target":"graph","created_at":"2026-05-18T00:52:48Z","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"},"paper":{"abstract_excerpt":"Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. It was proved that asymptotically good Hermitian LCD codes exist. The objective of this paper is to construct some cyclic Hermitian LCD codes over finite fields and analyse their parameters. The dimensions of these codes are settled and the lower bounds on their minimum distances are presented. Most Hermitian LCD codes presented in this paper are not BCH codes. In addition, we employ Hermitian LCD codes to propose a Hermit","authors_text":"Chengju Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-15T02:47:05Z","title":"On Hermitian LCD codes from cyclic codes and their applications to orthogonal direct sum masking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03986","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:f30312acc07ff0be226f349ecb9cada776fd0fc30f237f055735e4548f99f41a","target":"record","created_at":"2026-05-18T00:52:48Z","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":"6cad52c61a67d666a372a3952b83f8bd0b7cb56eaaeac30c252f0b486a73d60e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-15T02:47:05Z","title_canon_sha256":"3f0dfc17cde8efba9facffcf59ed66200ac6e79e8c69e7c9a75f601be71ae999"},"schema_version":"1.0","source":{"id":"1701.03986","kind":"arxiv","version":1}},"canonical_sha256":"c544ba16cfaa99882478ac6bfc709f022ec61d49fcee5bf09a98c6e610759e06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c544ba16cfaa99882478ac6bfc709f022ec61d49fcee5bf09a98c6e610759e06","first_computed_at":"2026-05-18T00:52:48.205378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:48.205378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3vPXYV79Mj0kDt4GdrxCqjdTGX4Twqk/ZWc50eVvYj43y5pZEY96MJIuf92z6DXZ82prTK1YQO0aqnIRPe3DAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:48.206044Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03986","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f30312acc07ff0be226f349ecb9cada776fd0fc30f237f055735e4548f99f41a","sha256:ee7e0d2617d17590a0ca190b78e3a333ced8b3b580213fb5dedd0896e54cbbc0"],"state_sha256":"cda69a876027efe1569b5c3a6aaebca19ef6b341ab21735e7cf2f1915c6175a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k5kjaUQv7qaizgDoC2lYHuQ9gIAd9WF+EOLHK555Jg1ccb0J67OM7A7DrRaER3GxFIrZrmd1eWBjXpMpo9yZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T08:12:16.524714Z","bundle_sha256":"9066ee9f1bd07c4cda043652711ca26c42f0937a6b8de1b47b763cdea6a9c50b"}}