{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GGW7RQRJ4ULQCO7534OLTFFHPF","short_pith_number":"pith:GGW7RQRJ","schema_version":"1.0","canonical_sha256":"31adf8c229e517013bfddf1cb994a7797eb0541e28ffbb3dd7643605829d79ad","source":{"kind":"arxiv","id":"1806.08992","version":1},"attestation_state":"computed","paper":{"title":"List Decodability of Symbol-Pair Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Chen Yuan, Shu Liu","submitted_at":"2018-06-23T15:49:03Z","abstract_excerpt":"We investigate the list decodability of symbol-pair codes in the present paper. Firstly, we show that list decodability of every symbol-pair code does not exceed the Gilbert-Varshamov bound. On the other hand, we are able to prove that with high probability, a random symbol-pair code can be list decoded up to the Gilbert-Varshamov bound. Our second result of this paper is to derive the Johnson-type bound, i.e., a lower bound on list decoding radius in terms of minimum distance. Finally, we present a list decoding algorithm of Reed-Solomon codes beyond the Johnson-type bound."},"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":"1806.08992","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-23T15:49:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"761f26ec8f6bc3158e2a781d9fd20b4a1fd2439e9f28be5111d2e69f28c1314c","abstract_canon_sha256":"929d9fe9aefa707c0b660d9fc5b492ef00b1b2b558d65741abbe4c11c6d9deb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:30.663226Z","signature_b64":"VTyEfSRD1fXsYFuxgFUv14DPY+zONKINPHK459Ex/IMKQRidOi7RSKkFVo3qsjzpMvIs4o8BEIWLhk8AjQ/+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31adf8c229e517013bfddf1cb994a7797eb0541e28ffbb3dd7643605829d79ad","last_reissued_at":"2026-05-18T00:12:30.662495Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:30.662495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List Decodability of Symbol-Pair Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Chen Yuan, Shu Liu","submitted_at":"2018-06-23T15:49:03Z","abstract_excerpt":"We investigate the list decodability of symbol-pair codes in the present paper. Firstly, we show that list decodability of every symbol-pair code does not exceed the Gilbert-Varshamov bound. On the other hand, we are able to prove that with high probability, a random symbol-pair code can be list decoded up to the Gilbert-Varshamov bound. Our second result of this paper is to derive the Johnson-type bound, i.e., a lower bound on list decoding radius in terms of minimum distance. Finally, we present a list decoding algorithm of Reed-Solomon codes beyond the Johnson-type bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08992","kind":"arxiv","version":1},"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":"1806.08992","created_at":"2026-05-18T00:12:30.662591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08992v1","created_at":"2026-05-18T00:12:30.662591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08992","created_at":"2026-05-18T00:12:30.662591+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGW7RQRJ4ULQ","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGW7RQRJ4ULQCO75","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGW7RQRJ","created_at":"2026-05-18T12:32:25.280505+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/GGW7RQRJ4ULQCO7534OLTFFHPF","json":"https://pith.science/pith/GGW7RQRJ4ULQCO7534OLTFFHPF.json","graph_json":"https://pith.science/api/pith-number/GGW7RQRJ4ULQCO7534OLTFFHPF/graph.json","events_json":"https://pith.science/api/pith-number/GGW7RQRJ4ULQCO7534OLTFFHPF/events.json","paper":"https://pith.science/paper/GGW7RQRJ"},"agent_actions":{"view_html":"https://pith.science/pith/GGW7RQRJ4ULQCO7534OLTFFHPF","download_json":"https://pith.science/pith/GGW7RQRJ4ULQCO7534OLTFFHPF.json","view_paper":"https://pith.science/paper/GGW7RQRJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08992&json=true","fetch_graph":"https://pith.science/api/pith-number/GGW7RQRJ4ULQCO7534OLTFFHPF/graph.json","fetch_events":"https://pith.science/api/pith-number/GGW7RQRJ4ULQCO7534OLTFFHPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGW7RQRJ4ULQCO7534OLTFFHPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGW7RQRJ4ULQCO7534OLTFFHPF/action/storage_attestation","attest_author":"https://pith.science/pith/GGW7RQRJ4ULQCO7534OLTFFHPF/action/author_attestation","sign_citation":"https://pith.science/pith/GGW7RQRJ4ULQCO7534OLTFFHPF/action/citation_signature","submit_replication":"https://pith.science/pith/GGW7RQRJ4ULQCO7534OLTFFHPF/action/replication_record"}},"created_at":"2026-05-18T00:12:30.662591+00:00","updated_at":"2026-05-18T00:12:30.662591+00:00"}