{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GGW7RQRJ4ULQCO7534OLTFFHPF","short_pith_number":"pith:GGW7RQRJ","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"},"canonical_sha256":"31adf8c229e517013bfddf1cb994a7797eb0541e28ffbb3dd7643605829d79ad","source":{"kind":"arxiv","id":"1806.08992","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08992","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08992v1","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08992","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"pith_short_12","alias_value":"GGW7RQRJ4ULQ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GGW7RQRJ4ULQCO75","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GGW7RQRJ","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GGW7RQRJ4ULQCO7534OLTFFHPF","target":"record","payload":{"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"},"canonical_sha256":"31adf8c229e517013bfddf1cb994a7797eb0541e28ffbb3dd7643605829d79ad","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"},"source_kind":"arxiv","source_id":"1806.08992","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oWyAnxvpFxyrBd1bl2eFCpuMofzlCmpA9MA0XEwvKpNPdm3P8RpP2p9LR8jaxkEgoNGhKRFrPFf1wICzW6d2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:23:01.255567Z"},"content_sha256":"6389d79273c2f1966f1614653320cce154b5ba0eac35c74fbbdd3c23aa599cc9","schema_version":"1.0","event_id":"sha256:6389d79273c2f1966f1614653320cce154b5ba0eac35c74fbbdd3c23aa599cc9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GGW7RQRJ4ULQCO7534OLTFFHPF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"weYTAIs9Ksrj384S2EDa6Ie+74POZ1ZhsL3Vc6ADUoT0irlN1SbyiPcvWnoxF6/vte0/Qm8fbq0u1esA1YxcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:23:01.256172Z"},"content_sha256":"d98023bf7de60e35e175c52c05f59746023bf357dc46c880e8334b27048c1344","schema_version":"1.0","event_id":"sha256:d98023bf7de60e35e175c52c05f59746023bf357dc46c880e8334b27048c1344"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GGW7RQRJ4ULQCO7534OLTFFHPF/bundle.json","state_url":"https://pith.science/pith/GGW7RQRJ4ULQCO7534OLTFFHPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GGW7RQRJ4ULQCO7534OLTFFHPF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T09:23:01Z","links":{"resolver":"https://pith.science/pith/GGW7RQRJ4ULQCO7534OLTFFHPF","bundle":"https://pith.science/pith/GGW7RQRJ4ULQCO7534OLTFFHPF/bundle.json","state":"https://pith.science/pith/GGW7RQRJ4ULQCO7534OLTFFHPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GGW7RQRJ4ULQCO7534OLTFFHPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GGW7RQRJ4ULQCO7534OLTFFHPF","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":"929d9fe9aefa707c0b660d9fc5b492ef00b1b2b558d65741abbe4c11c6d9deb8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-23T15:49:03Z","title_canon_sha256":"761f26ec8f6bc3158e2a781d9fd20b4a1fd2439e9f28be5111d2e69f28c1314c"},"schema_version":"1.0","source":{"id":"1806.08992","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08992","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08992v1","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08992","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"pith_short_12","alias_value":"GGW7RQRJ4ULQ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GGW7RQRJ4ULQCO75","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GGW7RQRJ","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:d98023bf7de60e35e175c52c05f59746023bf357dc46c880e8334b27048c1344","target":"graph","created_at":"2026-05-18T00:12:30Z","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 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.","authors_text":"Chaoping Xing, Chen Yuan, Shu Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-23T15:49:03Z","title":"List Decodability of Symbol-Pair Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08992","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:6389d79273c2f1966f1614653320cce154b5ba0eac35c74fbbdd3c23aa599cc9","target":"record","created_at":"2026-05-18T00:12:30Z","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":"929d9fe9aefa707c0b660d9fc5b492ef00b1b2b558d65741abbe4c11c6d9deb8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-23T15:49:03Z","title_canon_sha256":"761f26ec8f6bc3158e2a781d9fd20b4a1fd2439e9f28be5111d2e69f28c1314c"},"schema_version":"1.0","source":{"id":"1806.08992","kind":"arxiv","version":1}},"canonical_sha256":"31adf8c229e517013bfddf1cb994a7797eb0541e28ffbb3dd7643605829d79ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31adf8c229e517013bfddf1cb994a7797eb0541e28ffbb3dd7643605829d79ad","first_computed_at":"2026-05-18T00:12:30.662495Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:30.662495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VTyEfSRD1fXsYFuxgFUv14DPY+zONKINPHK459Ex/IMKQRidOi7RSKkFVo3qsjzpMvIs4o8BEIWLhk8AjQ/+Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:30.663226Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08992","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6389d79273c2f1966f1614653320cce154b5ba0eac35c74fbbdd3c23aa599cc9","sha256:d98023bf7de60e35e175c52c05f59746023bf357dc46c880e8334b27048c1344"],"state_sha256":"949acfb16e85f74325cdba8cc32d552118cf7dd17bde142845907a5870dc5d04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9wsjWWeeGwc35v1rr/Wd9Wy7MDUVW/MjK6d1vg2u7T7FHqO1PN7y7sRyiys4/gWJYggSfGvZw713RzdRHN1eCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:23:01.259379Z","bundle_sha256":"b8bd18923cf5be86180e142a818601e881d62d34edb64e4c81b6dee79d893c09"}}