{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KMEAMYPVFU3YVYJZIQE7DJVJOF","short_pith_number":"pith:KMEAMYPV","schema_version":"1.0","canonical_sha256":"53080661f52d378ae1394409f1a6a9716d618d59daa667cec16535263c698401","source":{"kind":"arxiv","id":"2501.11371","version":2},"attestation_state":"computed","paper":{"title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anina Gruica, Eitan Yaakobi, Maria Montanucci, Peter Beelen, Roni Con","submitted_at":"2025-01-20T10:02:22Z","abstract_excerpt":"The performance of Reed--Solomon codes (RS codes, for short) in the presence of insertion and deletion errors has attracted growing attention in recent literature. In this work, we further study this intriguing mathematical problem, focusing on two regimes. First, we study the question of how well full-length RS codes perform against insertions and deletions. For 2-dimensional RS codes, we provide a complete characterization of codes that cannot correct even a single insertion or deletion. Furthermore, we prove that for sufficiently large field size~$q$, nearly all full-length $2$-dimensional "},"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":"2501.11371","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-01-20T10:02:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"67b8f9c0a53572fb029f829030be5efe8acff87aae8b39cc13c8647232888583","abstract_canon_sha256":"2005d45219861b4117122349c5cde9a2331cb555363503eaf679a4459d599728"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:06:04.737866Z","signature_b64":"xlRASoHN2tmNkJmaa4VpgmIPXykNbFidFFPmxxIXW4wUsZRWlq85xYn8ki2soLEThgt20Ke88mWIueE7tAz8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53080661f52d378ae1394409f1a6a9716d618d59daa667cec16535263c698401","last_reissued_at":"2026-07-05T12:06:04.737347Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:06:04.737347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anina Gruica, Eitan Yaakobi, Maria Montanucci, Peter Beelen, Roni Con","submitted_at":"2025-01-20T10:02:22Z","abstract_excerpt":"The performance of Reed--Solomon codes (RS codes, for short) in the presence of insertion and deletion errors has attracted growing attention in recent literature. In this work, we further study this intriguing mathematical problem, focusing on two regimes. First, we study the question of how well full-length RS codes perform against insertions and deletions. For 2-dimensional RS codes, we provide a complete characterization of codes that cannot correct even a single insertion or deletion. Furthermore, we prove that for sufficiently large field size~$q$, nearly all full-length $2$-dimensional "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11371","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.11371/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":"2501.11371","created_at":"2026-07-05T12:06:04.737407+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.11371v2","created_at":"2026-07-05T12:06:04.737407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11371","created_at":"2026-07-05T12:06:04.737407+00:00"},{"alias_kind":"pith_short_12","alias_value":"KMEAMYPVFU3Y","created_at":"2026-07-05T12:06:04.737407+00:00"},{"alias_kind":"pith_short_16","alias_value":"KMEAMYPVFU3YVYJZ","created_at":"2026-07-05T12:06:04.737407+00:00"},{"alias_kind":"pith_short_8","alias_value":"KMEAMYPV","created_at":"2026-07-05T12:06:04.737407+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":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KMEAMYPVFU3YVYJZIQE7DJVJOF","json":"https://pith.science/pith/KMEAMYPVFU3YVYJZIQE7DJVJOF.json","graph_json":"https://pith.science/api/pith-number/KMEAMYPVFU3YVYJZIQE7DJVJOF/graph.json","events_json":"https://pith.science/api/pith-number/KMEAMYPVFU3YVYJZIQE7DJVJOF/events.json","paper":"https://pith.science/paper/KMEAMYPV"},"agent_actions":{"view_html":"https://pith.science/pith/KMEAMYPVFU3YVYJZIQE7DJVJOF","download_json":"https://pith.science/pith/KMEAMYPVFU3YVYJZIQE7DJVJOF.json","view_paper":"https://pith.science/paper/KMEAMYPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.11371&json=true","fetch_graph":"https://pith.science/api/pith-number/KMEAMYPVFU3YVYJZIQE7DJVJOF/graph.json","fetch_events":"https://pith.science/api/pith-number/KMEAMYPVFU3YVYJZIQE7DJVJOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KMEAMYPVFU3YVYJZIQE7DJVJOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KMEAMYPVFU3YVYJZIQE7DJVJOF/action/storage_attestation","attest_author":"https://pith.science/pith/KMEAMYPVFU3YVYJZIQE7DJVJOF/action/author_attestation","sign_citation":"https://pith.science/pith/KMEAMYPVFU3YVYJZIQE7DJVJOF/action/citation_signature","submit_replication":"https://pith.science/pith/KMEAMYPVFU3YVYJZIQE7DJVJOF/action/replication_record"}},"created_at":"2026-07-05T12:06:04.737407+00:00","updated_at":"2026-07-05T12:06:04.737407+00:00"}