{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:OXTAD7CERF3EXSVFT4LOL6PXMA","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":"9628effafd6b598119979f68190f19db9e08ad9761838808ee8bf613a24f3137","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-20T07:55:21Z","title_canon_sha256":"7556be3be200b85586a73d638e6085c87cbc858757ebf19cd02375c9ba877fe1"},"schema_version":"1.0","source":{"id":"2401.11160","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.11160","created_at":"2026-07-05T07:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"2401.11160v7","created_at":"2026-07-05T07:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11160","created_at":"2026-07-05T07:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"OXTAD7CERF3E","created_at":"2026-07-05T07:45:15Z"},{"alias_kind":"pith_short_16","alias_value":"OXTAD7CERF3EXSVF","created_at":"2026-07-05T07:45:15Z"},{"alias_kind":"pith_short_8","alias_value":"OXTAD7CE","created_at":"2026-07-05T07:45:15Z"}],"graph_snapshots":[{"event_id":"sha256:ccd0f9929fc386d4071d0ec0234862f604c4cc13685c3f8221b96d4563b10289","target":"graph","created_at":"2026-07-05T07:45:15Z","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/2401.11160/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Hao Chen","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-20T07:55:21Z","title":"Quasi-Perfect and Distance-Optimal Codes Sum-Rank Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11160","kind":"arxiv","version":7},"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:2823ad842ae02df2b9a6b49534e3a4483bcda417180f57304fb738d9b8dc53c3","target":"record","created_at":"2026-07-05T07:45:15Z","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":"9628effafd6b598119979f68190f19db9e08ad9761838808ee8bf613a24f3137","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2024-01-20T07:55:21Z","title_canon_sha256":"7556be3be200b85586a73d638e6085c87cbc858757ebf19cd02375c9ba877fe1"},"schema_version":"1.0","source":{"id":"2401.11160","kind":"arxiv","version":7}},"canonical_sha256":"75e601fc4489764bcaa59f16e5f9f760340799e2096c93d5d5137fd57772dd89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75e601fc4489764bcaa59f16e5f9f760340799e2096c93d5d5137fd57772dd89","first_computed_at":"2026-07-05T07:45:15.575904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:45:15.575904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H2Nwx5fxQMqxXwnGR81RvmZU6KdvoUx5wogpFOpUD/fcvCfn7iCNnRHh3/LoGt+z/w4DQmO0J5rdnYJTX6yuAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:45:15.577223Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.11160","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2823ad842ae02df2b9a6b49534e3a4483bcda417180f57304fb738d9b8dc53c3","sha256:ccd0f9929fc386d4071d0ec0234862f604c4cc13685c3f8221b96d4563b10289"],"state_sha256":"caa1f68bc710ce33724bb447c8a85aa11ea6ab72c31a8d0b5962df2aa8cebf56"}