{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OUCQATBI46AQ4JVPTJUI5SV6H5","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":"0d126329d6e1fae2779bd9ae8bc03f0299df6282b3775814b3de5d3473bd5e44","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-09T04:11:42Z","title_canon_sha256":"8c76e5e9d60046a2b145fa1948f834671e6b98c042804c2e247640ae80621ec7"},"schema_version":"1.0","source":{"id":"1608.02687","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02687","created_at":"2026-05-18T01:09:33Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02687v1","created_at":"2026-05-18T01:09:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02687","created_at":"2026-05-18T01:09:33Z"},{"alias_kind":"pith_short_12","alias_value":"OUCQATBI46AQ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OUCQATBI46AQ4JVP","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OUCQATBI","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:230c70d8a00eb09066cc83da180cce035edae853c4b9a4175f90eb36d98d4085","target":"graph","created_at":"2026-05-18T01:09:33Z","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"},"paper":{"abstract_excerpt":"Symbol-pair code is a new coding framework which is proposed to correct errors in the symbol-pair read channel. In particular, maximum distance separable (MDS) symbol-pair codes are a kind of symbol-pair codes with the best possible error-correction capability. Employing cyclic and constacyclic codes, we construct three new classes of MDS symbol-pair codes with minimum pair-distance five or six. Moreover, we find a necessary and sufficient condition which ensures a class of cyclic codes to be MDS symbol-pair codes. This condition is related to certain property of a special kind of linear fract","authors_text":"Gennian Ge, Shuxing Li","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-09T04:11:42Z","title":"Constructions of Maximum Distance Separable Symbol-Pair Codes Using Cyclic and Constacyclic Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02687","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:94f4ecc3174f04d3b366435ed1fb13fc802b3b67f37d40ea3da252e8b9f46020","target":"record","created_at":"2026-05-18T01:09:33Z","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":"0d126329d6e1fae2779bd9ae8bc03f0299df6282b3775814b3de5d3473bd5e44","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-09T04:11:42Z","title_canon_sha256":"8c76e5e9d60046a2b145fa1948f834671e6b98c042804c2e247640ae80621ec7"},"schema_version":"1.0","source":{"id":"1608.02687","kind":"arxiv","version":1}},"canonical_sha256":"7505004c28e7810e26af9a688ecabe3f62aacae0e2ce538815660af01eee0f03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7505004c28e7810e26af9a688ecabe3f62aacae0e2ce538815660af01eee0f03","first_computed_at":"2026-05-18T01:09:33.904169Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:33.904169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jhs0ghV0VBfH1tNM2kK4ak1BCFJ/N3LoU29GQaZ0Oy0HMIYZ/87xPWSoixYRgySaPUGQCr1U2XuNZV/0oCPSCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:33.904753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.02687","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94f4ecc3174f04d3b366435ed1fb13fc802b3b67f37d40ea3da252e8b9f46020","sha256:230c70d8a00eb09066cc83da180cce035edae853c4b9a4175f90eb36d98d4085"],"state_sha256":"5adde8fdeccf965c0b10c7c70fcd1a8fe262a08a752d0272ac1b1f0b801a4f4e"}