{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:CZBDGWBUP6OJDN3QKIW6H2E2FR","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":"40c7ec2c4c74a88ba39374edbb66b125df96cf53574c42d77e8c7a0a0c5e2214","cross_cats_sorted":["cs.DS","math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-07-10T01:41:15Z","title_canon_sha256":"5a18e45391fbc8c4134acf90e87ec63945679778d7aa197043d6e1b0515b5ad8"},"schema_version":"1.0","source":{"id":"2407.07299","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.07299","created_at":"2026-07-05T08:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"2407.07299v1","created_at":"2026-07-05T08:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.07299","created_at":"2026-07-05T08:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"CZBDGWBUP6OJ","created_at":"2026-07-05T08:42:09Z"},{"alias_kind":"pith_short_16","alias_value":"CZBDGWBUP6OJDN3Q","created_at":"2026-07-05T08:42:09Z"},{"alias_kind":"pith_short_8","alias_value":"CZBDGWBU","created_at":"2026-07-05T08:42:09Z"}],"graph_snapshots":[{"event_id":"sha256:091351b62bf2efc420bff6175d769fe1cb820c6877dd2e29f823bfa001d2d19b","target":"graph","created_at":"2026-07-05T08:42:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.07299/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we prove that with high probability, random Reed-Solomon codes approach the half-Singleton bound - the optimal rate versus error tradeoff for linear insdel codes - with linear-sized alphabets. More precisely, we prove that, for any $\\epsilon>0$ and positive integers $n$ and $k$, with high probability, random Reed--Solomon codes of length $n$ and dimension $k$ can correct $(1-\\varepsilon)n-2k+1$ adversarial insdel errors over alphabets of size $n+2^{\\mathsf{poly}(1/\\varepsilon)}k$. This significantly improves upon the alphabet size demonstrated in the work of Con, Shpilka, and Ta","authors_text":"Ray Li, Roni Con, Zeyu Guo, Zihan Zhang","cross_cats":["cs.DS","math.CO","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-07-10T01:41:15Z","title":"Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.07299","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:61606884513e0ca5cfe1328074a7d08aaa5fd2c2da6819e1c4a5c8fdf4947e3c","target":"record","created_at":"2026-07-05T08:42:09Z","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":"40c7ec2c4c74a88ba39374edbb66b125df96cf53574c42d77e8c7a0a0c5e2214","cross_cats_sorted":["cs.DS","math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-07-10T01:41:15Z","title_canon_sha256":"5a18e45391fbc8c4134acf90e87ec63945679778d7aa197043d6e1b0515b5ad8"},"schema_version":"1.0","source":{"id":"2407.07299","kind":"arxiv","version":1}},"canonical_sha256":"16423358347f9c91b770522de3e89a2c47f795f623499896ffe88cdbfa75b800","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16423358347f9c91b770522de3e89a2c47f795f623499896ffe88cdbfa75b800","first_computed_at":"2026-07-05T08:42:09.497878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:42:09.497878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SFT5WxhWoL289ap5LdNEf14rkxOqXIDx4trO6Wgj7jZAelwNEHS7yL//7r+J4x0W0UX31kkz1iLAC3TGDcNRAg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:42:09.498296Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.07299","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61606884513e0ca5cfe1328074a7d08aaa5fd2c2da6819e1c4a5c8fdf4947e3c","sha256:091351b62bf2efc420bff6175d769fe1cb820c6877dd2e29f823bfa001d2d19b"],"state_sha256":"f5dd759402ab3708c28fbc53eb8aaa18281bc3ea5f08f4b5fbf1141a500672d1"}