{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FXIYNM2LXPVI5U7Z2V56CD3WOD","short_pith_number":"pith:FXIYNM2L","canonical_record":{"source":{"id":"1911.10456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-11-24T04:15:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a096cce04847f6918c85b40676f95623a4ba0f1f02ea940a5f46f85365027108","abstract_canon_sha256":"2874c6427952dc632806efbf98b5198e1154e8daf3f37630846b8baaf23f36d5"},"schema_version":"1.0"},"canonical_sha256":"2dd186b34bbbea8ed3f9d57be10f7670c422f063d9af4dbbdcff1f4689747f41","source":{"kind":"arxiv","id":"1911.10456","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.10456","created_at":"2026-07-05T00:21:40Z"},{"alias_kind":"arxiv_version","alias_value":"1911.10456v1","created_at":"2026-07-05T00:21:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.10456","created_at":"2026-07-05T00:21:40Z"},{"alias_kind":"pith_short_12","alias_value":"FXIYNM2LXPVI","created_at":"2026-07-05T00:21:40Z"},{"alias_kind":"pith_short_16","alias_value":"FXIYNM2LXPVI5U7Z","created_at":"2026-07-05T00:21:40Z"},{"alias_kind":"pith_short_8","alias_value":"FXIYNM2L","created_at":"2026-07-05T00:21:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FXIYNM2LXPVI5U7Z2V56CD3WOD","target":"record","payload":{"canonical_record":{"source":{"id":"1911.10456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-11-24T04:15:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a096cce04847f6918c85b40676f95623a4ba0f1f02ea940a5f46f85365027108","abstract_canon_sha256":"2874c6427952dc632806efbf98b5198e1154e8daf3f37630846b8baaf23f36d5"},"schema_version":"1.0"},"canonical_sha256":"2dd186b34bbbea8ed3f9d57be10f7670c422f063d9af4dbbdcff1f4689747f41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:21:40.316896Z","signature_b64":"Zuxdpd3VkOlzn+we7FEqhrlajz+1Y9LS71naYuhOhzrw1dDYrduyBzpXfFuJXEeROeu0uZ85cu/0/xpZtrKADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dd186b34bbbea8ed3f9d57be10f7670c422f063d9af4dbbdcff1f4689747f41","last_reissued_at":"2026-07-05T00:21:40.316441Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:21:40.316441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.10456","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-05T00:21:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aFIx+yGQQ16Va8FvLah7Lfyopq5vExXTQ4R5nXy+cLd2DRnAqtIZ1PsQqIDXPzxtKevArH1aBLjwnoDPacW0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T05:54:28.740777Z"},"content_sha256":"887e6a1b942d8b8d001477c96e343bccebec805ac9fe950822a2f4740a02065f","schema_version":"1.0","event_id":"sha256:887e6a1b942d8b8d001477c96e343bccebec805ac9fe950822a2f4740a02065f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FXIYNM2LXPVI5U7Z2V56CD3WOD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Construction of optimal Hermitian self-dual codes from unitary matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lin Sok","submitted_at":"2019-11-24T04:15:14Z","abstract_excerpt":"We provide an algorithm to construct unitary matrices over finite fields. We present various constructions of Hermitian self-dual code by means of unitary matrices, where some of them generalize the quadratic double circulant constructions. Many optimal Hermitian self-dual codes over large finite fields with new parameters are obtained. More precisely MDS or almost MDS Hermitian self-dual codes of lengths up to $18$ are constructed over finite fields $\\F_{q},$ where $q=3^2,4^2,5^2,7^2,8^2,9^2,11^2,13^2,17^2,19^2.$ Comparisons with classical constructions are made."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.10456","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/1911.10456/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-05T00:21:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"flFVo757jZ0tfigX993hOjGHdDIWlXuAgVMcoWKtbvtRIdzv+ysaMUiK64o22GeV7SlNybvUANGm1vNORGLlDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T05:54:28.741773Z"},"content_sha256":"23cadf85cb247f31f3c74ee5b7d64c3f3284d926fe30a8d51febd79ca406b469","schema_version":"1.0","event_id":"sha256:23cadf85cb247f31f3c74ee5b7d64c3f3284d926fe30a8d51febd79ca406b469"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FXIYNM2LXPVI5U7Z2V56CD3WOD/bundle.json","state_url":"https://pith.science/pith/FXIYNM2LXPVI5U7Z2V56CD3WOD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FXIYNM2LXPVI5U7Z2V56CD3WOD/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-08-12T05:54:28Z","links":{"resolver":"https://pith.science/pith/FXIYNM2LXPVI5U7Z2V56CD3WOD","bundle":"https://pith.science/pith/FXIYNM2LXPVI5U7Z2V56CD3WOD/bundle.json","state":"https://pith.science/pith/FXIYNM2LXPVI5U7Z2V56CD3WOD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FXIYNM2LXPVI5U7Z2V56CD3WOD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FXIYNM2LXPVI5U7Z2V56CD3WOD","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":"2874c6427952dc632806efbf98b5198e1154e8daf3f37630846b8baaf23f36d5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-11-24T04:15:14Z","title_canon_sha256":"a096cce04847f6918c85b40676f95623a4ba0f1f02ea940a5f46f85365027108"},"schema_version":"1.0","source":{"id":"1911.10456","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.10456","created_at":"2026-07-05T00:21:40Z"},{"alias_kind":"arxiv_version","alias_value":"1911.10456v1","created_at":"2026-07-05T00:21:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.10456","created_at":"2026-07-05T00:21:40Z"},{"alias_kind":"pith_short_12","alias_value":"FXIYNM2LXPVI","created_at":"2026-07-05T00:21:40Z"},{"alias_kind":"pith_short_16","alias_value":"FXIYNM2LXPVI5U7Z","created_at":"2026-07-05T00:21:40Z"},{"alias_kind":"pith_short_8","alias_value":"FXIYNM2L","created_at":"2026-07-05T00:21:40Z"}],"graph_snapshots":[{"event_id":"sha256:23cadf85cb247f31f3c74ee5b7d64c3f3284d926fe30a8d51febd79ca406b469","target":"graph","created_at":"2026-07-05T00:21:40Z","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/1911.10456/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We provide an algorithm to construct unitary matrices over finite fields. We present various constructions of Hermitian self-dual code by means of unitary matrices, where some of them generalize the quadratic double circulant constructions. Many optimal Hermitian self-dual codes over large finite fields with new parameters are obtained. More precisely MDS or almost MDS Hermitian self-dual codes of lengths up to $18$ are constructed over finite fields $\\F_{q},$ where $q=3^2,4^2,5^2,7^2,8^2,9^2,11^2,13^2,17^2,19^2.$ Comparisons with classical constructions are made.","authors_text":"Lin Sok","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-11-24T04:15:14Z","title":"Construction of optimal Hermitian self-dual codes from unitary matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.10456","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:887e6a1b942d8b8d001477c96e343bccebec805ac9fe950822a2f4740a02065f","target":"record","created_at":"2026-07-05T00:21:40Z","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":"2874c6427952dc632806efbf98b5198e1154e8daf3f37630846b8baaf23f36d5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-11-24T04:15:14Z","title_canon_sha256":"a096cce04847f6918c85b40676f95623a4ba0f1f02ea940a5f46f85365027108"},"schema_version":"1.0","source":{"id":"1911.10456","kind":"arxiv","version":1}},"canonical_sha256":"2dd186b34bbbea8ed3f9d57be10f7670c422f063d9af4dbbdcff1f4689747f41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2dd186b34bbbea8ed3f9d57be10f7670c422f063d9af4dbbdcff1f4689747f41","first_computed_at":"2026-07-05T00:21:40.316441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:21:40.316441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zuxdpd3VkOlzn+we7FEqhrlajz+1Y9LS71naYuhOhzrw1dDYrduyBzpXfFuJXEeROeu0uZ85cu/0/xpZtrKADw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:21:40.316896Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.10456","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:887e6a1b942d8b8d001477c96e343bccebec805ac9fe950822a2f4740a02065f","sha256:23cadf85cb247f31f3c74ee5b7d64c3f3284d926fe30a8d51febd79ca406b469"],"state_sha256":"8264fda93eaa2a07a88957b5b36fe709067b3d428dc28d7d28a9f34e44572c05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/C8Wsj8fhOiwrWSqCjxidUwOAhUgEQKqrZ+v22cAwWUcSLNRxW+p6DdAJn4jWUhCK9YhHhk27MDr35Zq7rWpAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T05:54:28.747900Z","bundle_sha256":"138c6c1e568508bc6053c593980b6710c13ce04d9abec8381350f29eb548992b"}}