{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JFO2Q6RUEXUMZ7SFBML5HDTAYH","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":"b60d1166fcef57c531bab8ecc597d5092879de0e9266b70c12565308590e830d","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-07T23:39:26Z","title_canon_sha256":"b0813fc8cff68af5200ea3efab0036a6f5d98cee303c75c68f8128d373c1dc15"},"schema_version":"1.0","source":{"id":"1211.1728","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1728","created_at":"2026-05-18T03:17:11Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1728v2","created_at":"2026-05-18T03:17:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1728","created_at":"2026-05-18T03:17:11Z"},{"alias_kind":"pith_short_12","alias_value":"JFO2Q6RUEXUM","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JFO2Q6RUEXUMZ7SF","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JFO2Q6RU","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:6e576759546475cb210e86d36846660e02f7dedd28b82d6925bb388f4b3e1eed","target":"graph","created_at":"2026-05-18T03:17:11Z","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":"We study (symbol-pair) codes for symbol-pair read channels introduced recently by Cassuto and Blaum (2010). A Singleton-type bound on symbol-pair codes is established and infinite families of optimal symbol-pair codes are constructed. These codes are maximum distance separable (MDS) in the sense that they meet the Singleton-type bound. In contrast to classical codes, where all known q-ary MDS codes have length O(q), we show that q-ary MDS symbol-pair codes can have length \\Omega(q^2). In addition, we completely determine the existence of MDS symbol-pair codes for certain parameters.","authors_text":"Chengmin Wang, Han Mao Kiah, Jianxing Yin, Lijun Ji, Yeow Meng Chee","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-07T23:39:26Z","title":"Maximum Distance Separable Codes for Symbol-Pair Read Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1728","kind":"arxiv","version":2},"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:6b94d491403e3b9f63e15d209683b336adfffa7ea3b1ebcf62d5e404bca0549d","target":"record","created_at":"2026-05-18T03:17:11Z","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":"b60d1166fcef57c531bab8ecc597d5092879de0e9266b70c12565308590e830d","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-07T23:39:26Z","title_canon_sha256":"b0813fc8cff68af5200ea3efab0036a6f5d98cee303c75c68f8128d373c1dc15"},"schema_version":"1.0","source":{"id":"1211.1728","kind":"arxiv","version":2}},"canonical_sha256":"495da87a3425e8ccfe450b17d38e60c1dd877dca0e4a7a211dbbb4e755c83b2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"495da87a3425e8ccfe450b17d38e60c1dd877dca0e4a7a211dbbb4e755c83b2f","first_computed_at":"2026-05-18T03:17:11.817240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:11.817240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zT4KsJGpLK8GhrPR534qZvFx6Zi4ZE5hJiBk7UVDfDeSSepPyI90j78zXzYxjExGoKymIrK7yhzaHC5MKAhECw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:11.817920Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.1728","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b94d491403e3b9f63e15d209683b336adfffa7ea3b1ebcf62d5e404bca0549d","sha256:6e576759546475cb210e86d36846660e02f7dedd28b82d6925bb388f4b3e1eed"],"state_sha256":"d128f2910533df4db5d7ad2bba9498925e8982a035b7a55183c54f09d9736557"}