{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FXIYNM2LXPVI5U7Z2V56CD3WOD","short_pith_number":"pith:FXIYNM2L","schema_version":"1.0","canonical_sha256":"2dd186b34bbbea8ed3f9d57be10f7670c422f063d9af4dbbdcff1f4689747f41","source":{"kind":"arxiv","id":"1911.10456","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1911.10456","created_at":"2026-07-05T00:21:40.316498+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.10456v1","created_at":"2026-07-05T00:21:40.316498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.10456","created_at":"2026-07-05T00:21:40.316498+00:00"},{"alias_kind":"pith_short_12","alias_value":"FXIYNM2LXPVI","created_at":"2026-07-05T00:21:40.316498+00:00"},{"alias_kind":"pith_short_16","alias_value":"FXIYNM2LXPVI5U7Z","created_at":"2026-07-05T00:21:40.316498+00:00"},{"alias_kind":"pith_short_8","alias_value":"FXIYNM2L","created_at":"2026-07-05T00:21:40.316498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.05781","citing_title":"Symmetry-guided constructions of absolutely maximally entangled states in five open cases","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FXIYNM2LXPVI5U7Z2V56CD3WOD","json":"https://pith.science/pith/FXIYNM2LXPVI5U7Z2V56CD3WOD.json","graph_json":"https://pith.science/api/pith-number/FXIYNM2LXPVI5U7Z2V56CD3WOD/graph.json","events_json":"https://pith.science/api/pith-number/FXIYNM2LXPVI5U7Z2V56CD3WOD/events.json","paper":"https://pith.science/paper/FXIYNM2L"},"agent_actions":{"view_html":"https://pith.science/pith/FXIYNM2LXPVI5U7Z2V56CD3WOD","download_json":"https://pith.science/pith/FXIYNM2LXPVI5U7Z2V56CD3WOD.json","view_paper":"https://pith.science/paper/FXIYNM2L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.10456&json=true","fetch_graph":"https://pith.science/api/pith-number/FXIYNM2LXPVI5U7Z2V56CD3WOD/graph.json","fetch_events":"https://pith.science/api/pith-number/FXIYNM2LXPVI5U7Z2V56CD3WOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FXIYNM2LXPVI5U7Z2V56CD3WOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FXIYNM2LXPVI5U7Z2V56CD3WOD/action/storage_attestation","attest_author":"https://pith.science/pith/FXIYNM2LXPVI5U7Z2V56CD3WOD/action/author_attestation","sign_citation":"https://pith.science/pith/FXIYNM2LXPVI5U7Z2V56CD3WOD/action/citation_signature","submit_replication":"https://pith.science/pith/FXIYNM2LXPVI5U7Z2V56CD3WOD/action/replication_record"}},"created_at":"2026-07-05T00:21:40.316498+00:00","updated_at":"2026-07-05T00:21:40.316498+00:00"}