{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MHMTWHQUOIY2PI55YCDLP6LBVZ","short_pith_number":"pith:MHMTWHQU","schema_version":"1.0","canonical_sha256":"61d93b1e147231a7a3bdc086b7f961ae60abadbd7b17ddefb10da076ba25a7ee","source":{"kind":"arxiv","id":"2211.11147","version":2},"attestation_state":"computed","paper":{"title":"Optimal quaternary linear codes with one-dimensional Hermitian hull and the related EAQECCs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Huizhou Liu, Minjia Shi, Shitao Li","submitted_at":"2022-11-21T01:59:40Z","abstract_excerpt":"Linear codes with small hulls over finite fields have been extensively studied due to their practical applications in computational complexity and information protection. In this paper, we develop a general method to determine the exact value of $D_4^H(n,k,1)$ for $n\\leq 12$ or $k\\in \\{1,2,3,n-1,n-2,n-3\\}$, where $D_4^H(n,k,1)$ denotes the largest minimum distance among all quaternary linear $[n,k]$ codes with one-dimensional Hermitian hull. As a consequence, we solve a conjecture proposed by Mankean and Jitman on the largest minimum distance of a quaternary linear code with one-dimensional He"},"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":"2211.11147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-11-21T01:59:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"22391839dc340c83243c84918a2daaccf91c1ee82e17b2620967fc64eb3f6ed6","abstract_canon_sha256":"73b70af790f9cc5b1687714a1e5b9693e3022a8c402fb47cc2011f2a122bd017"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:19:37.740084Z","signature_b64":"7/aPXrolLgd7aQaVjM+rdfdi7k7qLHuey1XM3tqV5wLfMM8S0v5DJuixr/Kec9ybCk2letV33hIW0yS9+ArpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61d93b1e147231a7a3bdc086b7f961ae60abadbd7b17ddefb10da076ba25a7ee","last_reissued_at":"2026-07-05T05:19:37.739593Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:19:37.739593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal quaternary linear codes with one-dimensional Hermitian hull and the related EAQECCs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Huizhou Liu, Minjia Shi, Shitao Li","submitted_at":"2022-11-21T01:59:40Z","abstract_excerpt":"Linear codes with small hulls over finite fields have been extensively studied due to their practical applications in computational complexity and information protection. In this paper, we develop a general method to determine the exact value of $D_4^H(n,k,1)$ for $n\\leq 12$ or $k\\in \\{1,2,3,n-1,n-2,n-3\\}$, where $D_4^H(n,k,1)$ denotes the largest minimum distance among all quaternary linear $[n,k]$ codes with one-dimensional Hermitian hull. As a consequence, we solve a conjecture proposed by Mankean and Jitman on the largest minimum distance of a quaternary linear code with one-dimensional He"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.11147","kind":"arxiv","version":2},"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/2211.11147/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":"2211.11147","created_at":"2026-07-05T05:19:37.739653+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.11147v2","created_at":"2026-07-05T05:19:37.739653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.11147","created_at":"2026-07-05T05:19:37.739653+00:00"},{"alias_kind":"pith_short_12","alias_value":"MHMTWHQUOIY2","created_at":"2026-07-05T05:19:37.739653+00:00"},{"alias_kind":"pith_short_16","alias_value":"MHMTWHQUOIY2PI55","created_at":"2026-07-05T05:19:37.739653+00:00"},{"alias_kind":"pith_short_8","alias_value":"MHMTWHQU","created_at":"2026-07-05T05:19:37.739653+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MHMTWHQUOIY2PI55YCDLP6LBVZ","json":"https://pith.science/pith/MHMTWHQUOIY2PI55YCDLP6LBVZ.json","graph_json":"https://pith.science/api/pith-number/MHMTWHQUOIY2PI55YCDLP6LBVZ/graph.json","events_json":"https://pith.science/api/pith-number/MHMTWHQUOIY2PI55YCDLP6LBVZ/events.json","paper":"https://pith.science/paper/MHMTWHQU"},"agent_actions":{"view_html":"https://pith.science/pith/MHMTWHQUOIY2PI55YCDLP6LBVZ","download_json":"https://pith.science/pith/MHMTWHQUOIY2PI55YCDLP6LBVZ.json","view_paper":"https://pith.science/paper/MHMTWHQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.11147&json=true","fetch_graph":"https://pith.science/api/pith-number/MHMTWHQUOIY2PI55YCDLP6LBVZ/graph.json","fetch_events":"https://pith.science/api/pith-number/MHMTWHQUOIY2PI55YCDLP6LBVZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MHMTWHQUOIY2PI55YCDLP6LBVZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MHMTWHQUOIY2PI55YCDLP6LBVZ/action/storage_attestation","attest_author":"https://pith.science/pith/MHMTWHQUOIY2PI55YCDLP6LBVZ/action/author_attestation","sign_citation":"https://pith.science/pith/MHMTWHQUOIY2PI55YCDLP6LBVZ/action/citation_signature","submit_replication":"https://pith.science/pith/MHMTWHQUOIY2PI55YCDLP6LBVZ/action/replication_record"}},"created_at":"2026-07-05T05:19:37.739653+00:00","updated_at":"2026-07-05T05:19:37.739653+00:00"}