{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CZBDGWBUP6OJDN3QKIW6H2E2FR","short_pith_number":"pith:CZBDGWBU","schema_version":"1.0","canonical_sha256":"16423358347f9c91b770522de3e89a2c47f795f623499896ffe88cdbfa75b800","source":{"kind":"arxiv","id":"2407.07299","version":1},"attestation_state":"computed","paper":{"title":"Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Ray Li, Roni Con, Zeyu Guo, Zihan Zhang","submitted_at":"2024-07-10T01:41:15Z","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"},"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":"2407.07299","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-07-10T01:41:15Z","cross_cats_sorted":["cs.DS","math.CO","math.IT"],"title_canon_sha256":"5a18e45391fbc8c4134acf90e87ec63945679778d7aa197043d6e1b0515b5ad8","abstract_canon_sha256":"40c7ec2c4c74a88ba39374edbb66b125df96cf53574c42d77e8c7a0a0c5e2214"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:42:09.498296Z","signature_b64":"SFT5WxhWoL289ap5LdNEf14rkxOqXIDx4trO6Wgj7jZAelwNEHS7yL//7r+J4x0W0UX31kkz1iLAC3TGDcNRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16423358347f9c91b770522de3e89a2c47f795f623499896ffe88cdbfa75b800","last_reissued_at":"2026-07-05T08:42:09.497878Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:42:09.497878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Ray Li, Roni Con, Zeyu Guo, Zihan Zhang","submitted_at":"2024-07-10T01:41:15Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.07299","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.07299/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2407.07299","created_at":"2026-07-05T08:42:09.497934+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.07299v1","created_at":"2026-07-05T08:42:09.497934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.07299","created_at":"2026-07-05T08:42:09.497934+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZBDGWBUP6OJ","created_at":"2026-07-05T08:42:09.497934+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZBDGWBUP6OJDN3Q","created_at":"2026-07-05T08:42:09.497934+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZBDGWBU","created_at":"2026-07-05T08:42:09.497934+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.12193","citing_title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CZBDGWBUP6OJDN3QKIW6H2E2FR","json":"https://pith.science/pith/CZBDGWBUP6OJDN3QKIW6H2E2FR.json","graph_json":"https://pith.science/api/pith-number/CZBDGWBUP6OJDN3QKIW6H2E2FR/graph.json","events_json":"https://pith.science/api/pith-number/CZBDGWBUP6OJDN3QKIW6H2E2FR/events.json","paper":"https://pith.science/paper/CZBDGWBU"},"agent_actions":{"view_html":"https://pith.science/pith/CZBDGWBUP6OJDN3QKIW6H2E2FR","download_json":"https://pith.science/pith/CZBDGWBUP6OJDN3QKIW6H2E2FR.json","view_paper":"https://pith.science/paper/CZBDGWBU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.07299&json=true","fetch_graph":"https://pith.science/api/pith-number/CZBDGWBUP6OJDN3QKIW6H2E2FR/graph.json","fetch_events":"https://pith.science/api/pith-number/CZBDGWBUP6OJDN3QKIW6H2E2FR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZBDGWBUP6OJDN3QKIW6H2E2FR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZBDGWBUP6OJDN3QKIW6H2E2FR/action/storage_attestation","attest_author":"https://pith.science/pith/CZBDGWBUP6OJDN3QKIW6H2E2FR/action/author_attestation","sign_citation":"https://pith.science/pith/CZBDGWBUP6OJDN3QKIW6H2E2FR/action/citation_signature","submit_replication":"https://pith.science/pith/CZBDGWBUP6OJDN3QKIW6H2E2FR/action/replication_record"}},"created_at":"2026-07-05T08:42:09.497934+00:00","updated_at":"2026-07-05T08:42:09.497934+00:00"}