{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ECZTNURI54UA6CKEWXCTVW3AYL","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":"467a661da9d988147bd5f06a222ac7da34449a1f5e6eb14d08faa9516e57cd68","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-07-09T00:55:27Z","title_canon_sha256":"1170b2324edb99016806b0aa5464999c0e28e10121d11f33d30164634d7cdef3"},"schema_version":"1.0","source":{"id":"2307.04076","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.04076","created_at":"2026-07-05T06:29:07Z"},{"alias_kind":"arxiv_version","alias_value":"2307.04076v1","created_at":"2026-07-05T06:29:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.04076","created_at":"2026-07-05T06:29:07Z"},{"alias_kind":"pith_short_12","alias_value":"ECZTNURI54UA","created_at":"2026-07-05T06:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"ECZTNURI54UA6CKE","created_at":"2026-07-05T06:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"ECZTNURI","created_at":"2026-07-05T06:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:7bf4c0ab95d003668289ab810a7805c55b19e29fef4481cb585a4136d44d22b6","target":"graph","created_at":"2026-07-05T06:29:07Z","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/2307.04076/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A linear code with parameters $[n, k, n-k+1]$ is called a maximum distance separable (MDS for short) code. A linear code with parameters $[n, k, n-k]$ is said to be almost maximum distance separable (AMDS for short). A linear code is said to be near maximum distance separable (NMDS for short) if both the code and its dual are AMDS. MDS codes are very important in both theory and practice. There is a classical construction of a $[q+1, 2u-1, q-2u+3]$ MDS code for each $u$ with $1 \\leq u \\leq \\lfloor\\frac{q+1}2\\rfloor$, which is a reversible and cyclic code. The objective of this paper is to stud","authors_text":"Cunsheng Ding, Zhonghua Sun","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-07-09T00:55:27Z","title":"The extended codes of a family of reversible MDS cyclic codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.04076","kind":"arxiv","version":1},"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:30c561b654d3d57f81503fa1faea28f8bfd1dfe0827296396c4090daf3a40bbe","target":"record","created_at":"2026-07-05T06:29:07Z","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":"467a661da9d988147bd5f06a222ac7da34449a1f5e6eb14d08faa9516e57cd68","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-07-09T00:55:27Z","title_canon_sha256":"1170b2324edb99016806b0aa5464999c0e28e10121d11f33d30164634d7cdef3"},"schema_version":"1.0","source":{"id":"2307.04076","kind":"arxiv","version":1}},"canonical_sha256":"20b336d228ef280f0944b5c53adb60c2ea8cd9ec97c8c30eb8a5924366a7c845","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20b336d228ef280f0944b5c53adb60c2ea8cd9ec97c8c30eb8a5924366a7c845","first_computed_at":"2026-07-05T06:29:07.819844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:29:07.819844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jQIKGhSS060XAPKX5Y4dFOLx0QuPzoJ5KzQy8HJXTXOpiWsK3C5pJyohwMTp5uzjpWGcgexSogLvS6YjW2efDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:29:07.820246Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.04076","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30c561b654d3d57f81503fa1faea28f8bfd1dfe0827296396c4090daf3a40bbe","sha256:7bf4c0ab95d003668289ab810a7805c55b19e29fef4481cb585a4136d44d22b6"],"state_sha256":"0617b929d919e30ba84e332d4b1792e185081f9f63c77d5f6ea6548c3104fd0b"}