{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:AQ6RUNXJDDO6P7YIYMOPUT6N5U","short_pith_number":"pith:AQ6RUNXJ","schema_version":"1.0","canonical_sha256":"043d1a36e918dde7ff08c31cfa4fcded12571910ce0c4955473e36d51a3236d2","source":{"kind":"arxiv","id":"0906.2509","version":1},"attestation_state":"computed","paper":{"title":"On $[[n,n-4,3]]_{q}$ Quantum MDS Codes for odd prime power $q$","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ruihu Li, Zongben Xu","submitted_at":"2009-06-14T04:11:25Z","abstract_excerpt":"For each odd prime power $q$, let $4 \\leq n\\leq q^{2}+1$. Hermitian self-orthogonal $[n,2,n-1]$ codes over $GF(q^{2})$ with dual distance three are constructed by using finite field theory. Hence, $[[n,n-4,3]]_{q}$ quantum MDS codes for $4 \\leq n\\leq q^{2}+1$ are obtained."},"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":"0906.2509","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2009-06-14T04:11:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a64aea06bef4a42108d3c8955a5edd279a890096e234e6882a24e54138b932dc","abstract_canon_sha256":"e9054045af6ee14e2b55df12c09b587f9e098a0874721d4ef8309b2b4c4ac436"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:13:20.318181Z","signature_b64":"UeksiqZCrEEK/HQea+ZYYeowbdzpjKscyHekdJu+UiiqLtOf441SxM1PhKbC/87m6JlsfEelVod2G7J/XwzVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"043d1a36e918dde7ff08c31cfa4fcded12571910ce0c4955473e36d51a3236d2","last_reissued_at":"2026-05-18T02:13:20.317715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:13:20.317715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On $[[n,n-4,3]]_{q}$ Quantum MDS Codes for odd prime power $q$","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ruihu Li, Zongben Xu","submitted_at":"2009-06-14T04:11:25Z","abstract_excerpt":"For each odd prime power $q$, let $4 \\leq n\\leq q^{2}+1$. Hermitian self-orthogonal $[n,2,n-1]$ codes over $GF(q^{2})$ with dual distance three are constructed by using finite field theory. Hence, $[[n,n-4,3]]_{q}$ quantum MDS codes for $4 \\leq n\\leq q^{2}+1$ are obtained."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.2509","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0906.2509","created_at":"2026-05-18T02:13:20.317774+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.2509v1","created_at":"2026-05-18T02:13:20.317774+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.2509","created_at":"2026-05-18T02:13:20.317774+00:00"},{"alias_kind":"pith_short_12","alias_value":"AQ6RUNXJDDO6","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"AQ6RUNXJDDO6P7YI","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"AQ6RUNXJ","created_at":"2026-05-18T12:25:58.837520+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/AQ6RUNXJDDO6P7YIYMOPUT6N5U","json":"https://pith.science/pith/AQ6RUNXJDDO6P7YIYMOPUT6N5U.json","graph_json":"https://pith.science/api/pith-number/AQ6RUNXJDDO6P7YIYMOPUT6N5U/graph.json","events_json":"https://pith.science/api/pith-number/AQ6RUNXJDDO6P7YIYMOPUT6N5U/events.json","paper":"https://pith.science/paper/AQ6RUNXJ"},"agent_actions":{"view_html":"https://pith.science/pith/AQ6RUNXJDDO6P7YIYMOPUT6N5U","download_json":"https://pith.science/pith/AQ6RUNXJDDO6P7YIYMOPUT6N5U.json","view_paper":"https://pith.science/paper/AQ6RUNXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.2509&json=true","fetch_graph":"https://pith.science/api/pith-number/AQ6RUNXJDDO6P7YIYMOPUT6N5U/graph.json","fetch_events":"https://pith.science/api/pith-number/AQ6RUNXJDDO6P7YIYMOPUT6N5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AQ6RUNXJDDO6P7YIYMOPUT6N5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AQ6RUNXJDDO6P7YIYMOPUT6N5U/action/storage_attestation","attest_author":"https://pith.science/pith/AQ6RUNXJDDO6P7YIYMOPUT6N5U/action/author_attestation","sign_citation":"https://pith.science/pith/AQ6RUNXJDDO6P7YIYMOPUT6N5U/action/citation_signature","submit_replication":"https://pith.science/pith/AQ6RUNXJDDO6P7YIYMOPUT6N5U/action/replication_record"}},"created_at":"2026-05-18T02:13:20.317774+00:00","updated_at":"2026-05-18T02:13:20.317774+00:00"}