{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TUYV7JIYVE5LRUZUTC3YCYITJ4","short_pith_number":"pith:TUYV7JIY","schema_version":"1.0","canonical_sha256":"9d315fa518a93ab8d33498b78161134f1ee269c8a60b79d7893604b728557ba5","source":{"kind":"arxiv","id":"1605.08859","version":2},"attestation_state":"computed","paper":{"title":"New Constructions of MDS Symbol-Pair Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baokun Ding, Gennian Ge, Jun Zhang, Tao Zhang, Yiwei Zhang","submitted_at":"2016-05-28T08:00:25Z","abstract_excerpt":"Motivated by the application of high-density data storage technologies, symbol-pair codes are proposed to protect against pair-errors in symbol-pair channels, whose outputs are overlapping pairs of symbols. The research of symbol-pair codes with the largest minimum pair-distance is interesting since such codes have the best possible error-correcting capability. A symbol-pair code attaining the maximal minimum pair-distance is called a maximum distance separable (MDS) symbol-pair code. In this paper, we focus on constructing linear MDS symbol-pair codes over the finite field $\\mathbb{F}_{q}$. W"},"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":"1605.08859","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-28T08:00:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b62d16267981f2c53a5332a32bd969435f75d505ec3e421cd5f0ba178db5754c","abstract_canon_sha256":"0587bf8321f6028733827ffd3e4a5b96c3f7ce30a2698c4378768a3ea2593af5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:34.149551Z","signature_b64":"IBtDSHIV0ZsCuev1xwglCP6D1QKWsYg/9KElo/jdInPLMPbzWXoxqKQaSQLPMLMxFNvoegzKymLSs9UESEVaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d315fa518a93ab8d33498b78161134f1ee269c8a60b79d7893604b728557ba5","last_reissued_at":"2026-05-18T01:12:34.149192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:34.149192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Constructions of MDS Symbol-Pair Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baokun Ding, Gennian Ge, Jun Zhang, Tao Zhang, Yiwei Zhang","submitted_at":"2016-05-28T08:00:25Z","abstract_excerpt":"Motivated by the application of high-density data storage technologies, symbol-pair codes are proposed to protect against pair-errors in symbol-pair channels, whose outputs are overlapping pairs of symbols. The research of symbol-pair codes with the largest minimum pair-distance is interesting since such codes have the best possible error-correcting capability. A symbol-pair code attaining the maximal minimum pair-distance is called a maximum distance separable (MDS) symbol-pair code. In this paper, we focus on constructing linear MDS symbol-pair codes over the finite field $\\mathbb{F}_{q}$. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08859","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1605.08859","created_at":"2026-05-18T01:12:34.149250+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.08859v2","created_at":"2026-05-18T01:12:34.149250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08859","created_at":"2026-05-18T01:12:34.149250+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUYV7JIYVE5L","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUYV7JIYVE5LRUZU","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUYV7JIY","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TUYV7JIYVE5LRUZUTC3YCYITJ4","json":"https://pith.science/pith/TUYV7JIYVE5LRUZUTC3YCYITJ4.json","graph_json":"https://pith.science/api/pith-number/TUYV7JIYVE5LRUZUTC3YCYITJ4/graph.json","events_json":"https://pith.science/api/pith-number/TUYV7JIYVE5LRUZUTC3YCYITJ4/events.json","paper":"https://pith.science/paper/TUYV7JIY"},"agent_actions":{"view_html":"https://pith.science/pith/TUYV7JIYVE5LRUZUTC3YCYITJ4","download_json":"https://pith.science/pith/TUYV7JIYVE5LRUZUTC3YCYITJ4.json","view_paper":"https://pith.science/paper/TUYV7JIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.08859&json=true","fetch_graph":"https://pith.science/api/pith-number/TUYV7JIYVE5LRUZUTC3YCYITJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/TUYV7JIYVE5LRUZUTC3YCYITJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUYV7JIYVE5LRUZUTC3YCYITJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUYV7JIYVE5LRUZUTC3YCYITJ4/action/storage_attestation","attest_author":"https://pith.science/pith/TUYV7JIYVE5LRUZUTC3YCYITJ4/action/author_attestation","sign_citation":"https://pith.science/pith/TUYV7JIYVE5LRUZUTC3YCYITJ4/action/citation_signature","submit_replication":"https://pith.science/pith/TUYV7JIYVE5LRUZUTC3YCYITJ4/action/replication_record"}},"created_at":"2026-05-18T01:12:34.149250+00:00","updated_at":"2026-05-18T01:12:34.149250+00:00"}