{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OXTAD7CERF3EXSVFT4LOL6PXMA","short_pith_number":"pith:OXTAD7CE","schema_version":"1.0","canonical_sha256":"75e601fc4489764bcaa59f16e5f9f760340799e2096c93d5d5137fd57772dd89","source":{"kind":"arxiv","id":"2401.11160","version":7},"attestation_state":"computed","paper":{"title":"Quasi-Perfect and Distance-Optimal Codes Sum-Rank Codes","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hao Chen","submitted_at":"2024-01-20T07:55:21Z","abstract_excerpt":"Constructions of distance-optimal codes and quasi-perfect codes are challenging problems and have attracted many attentions. In this paper, we give the following three results.\n  1) If $\\lambda|q^{sm}-1$ and $\\lambda <\\sqrt{\\frac{(q^s-1)}{2(q-1)^2(1+\\epsilon)}}$, an infinite family of distance-optimal $q$-ary cyclic sum-rank codes with the block length $t=\\frac{q^{sm}-1}{\\lambda}$, the matrix size $s \\times s$, the cardinality $q^{s^2t-s(2m+3)}$ and the minimum sum-rank distance four is constructed.\n  2) Block length $q^4-1$ and the matrix size $2 \\times 2$ distance-optimal sum-rank codes with"},"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":"2401.11160","kind":"arxiv","version":7},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-20T07:55:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7556be3be200b85586a73d638e6085c87cbc858757ebf19cd02375c9ba877fe1","abstract_canon_sha256":"9628effafd6b598119979f68190f19db9e08ad9761838808ee8bf613a24f3137"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:45:15.577223Z","signature_b64":"H2Nwx5fxQMqxXwnGR81RvmZU6KdvoUx5wogpFOpUD/fcvCfn7iCNnRHh3/LoGt+z/w4DQmO0J5rdnYJTX6yuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75e601fc4489764bcaa59f16e5f9f760340799e2096c93d5d5137fd57772dd89","last_reissued_at":"2026-07-05T07:45:15.575904Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:45:15.575904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-Perfect and Distance-Optimal Codes Sum-Rank Codes","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hao Chen","submitted_at":"2024-01-20T07:55:21Z","abstract_excerpt":"Constructions of distance-optimal codes and quasi-perfect codes are challenging problems and have attracted many attentions. In this paper, we give the following three results.\n  1) If $\\lambda|q^{sm}-1$ and $\\lambda <\\sqrt{\\frac{(q^s-1)}{2(q-1)^2(1+\\epsilon)}}$, an infinite family of distance-optimal $q$-ary cyclic sum-rank codes with the block length $t=\\frac{q^{sm}-1}{\\lambda}$, the matrix size $s \\times s$, the cardinality $q^{s^2t-s(2m+3)}$ and the minimum sum-rank distance four is constructed.\n  2) Block length $q^4-1$ and the matrix size $2 \\times 2$ distance-optimal sum-rank codes with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11160","kind":"arxiv","version":7},"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/2401.11160/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":"2401.11160","created_at":"2026-07-05T07:45:15.576831+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.11160v7","created_at":"2026-07-05T07:45:15.576831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11160","created_at":"2026-07-05T07:45:15.576831+00:00"},{"alias_kind":"pith_short_12","alias_value":"OXTAD7CERF3E","created_at":"2026-07-05T07:45:15.576831+00:00"},{"alias_kind":"pith_short_16","alias_value":"OXTAD7CERF3EXSVF","created_at":"2026-07-05T07:45:15.576831+00:00"},{"alias_kind":"pith_short_8","alias_value":"OXTAD7CE","created_at":"2026-07-05T07:45:15.576831+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.20940","citing_title":"On the non-existence of perfect codes in the sum-rank metric","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OXTAD7CERF3EXSVFT4LOL6PXMA","json":"https://pith.science/pith/OXTAD7CERF3EXSVFT4LOL6PXMA.json","graph_json":"https://pith.science/api/pith-number/OXTAD7CERF3EXSVFT4LOL6PXMA/graph.json","events_json":"https://pith.science/api/pith-number/OXTAD7CERF3EXSVFT4LOL6PXMA/events.json","paper":"https://pith.science/paper/OXTAD7CE"},"agent_actions":{"view_html":"https://pith.science/pith/OXTAD7CERF3EXSVFT4LOL6PXMA","download_json":"https://pith.science/pith/OXTAD7CERF3EXSVFT4LOL6PXMA.json","view_paper":"https://pith.science/paper/OXTAD7CE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.11160&json=true","fetch_graph":"https://pith.science/api/pith-number/OXTAD7CERF3EXSVFT4LOL6PXMA/graph.json","fetch_events":"https://pith.science/api/pith-number/OXTAD7CERF3EXSVFT4LOL6PXMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OXTAD7CERF3EXSVFT4LOL6PXMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OXTAD7CERF3EXSVFT4LOL6PXMA/action/storage_attestation","attest_author":"https://pith.science/pith/OXTAD7CERF3EXSVFT4LOL6PXMA/action/author_attestation","sign_citation":"https://pith.science/pith/OXTAD7CERF3EXSVFT4LOL6PXMA/action/citation_signature","submit_replication":"https://pith.science/pith/OXTAD7CERF3EXSVFT4LOL6PXMA/action/replication_record"}},"created_at":"2026-07-05T07:45:15.576831+00:00","updated_at":"2026-07-05T07:45:15.576831+00:00"}